Multi-objective capacitated location-routing problem: modelling and a simulated annealing heuristic

Nader Ghaffari-Nasab, M. Saeed Jabalameli and Ali Saboury

International Journal of Services and Operations Management, 2013, vol. 15, issue 2, 140-156

Abstract: Location-routing problem (LRP) is established as a new research area in the context of location analysis that concerns simultaneously both the problems of location of facilities and routing of vehicles among the established facilities and the existing demand points. In this paper, we address the multi-objective capacitated LRP, which may arise in many practical contexts in logistics and supply chain management. We present a bi-objective mathematical programming formulations to model the problem. The first objective is to minimise the overall system-wide costs, while the second objective is to minimise the maximum of delivery times to the customers. To solve the developed model, a simulated annealing (SA) based heuristic is proposed and the efficiency of the proposed solution procedure is illustrated by applying it to a standard benchmark set from literature.

Keywords: capacitated location routing; logistics; multi-objective optimisation; simulated annealing; supply chain management; SCM. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=53642 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:15:y:2013:i:2:p:140-156

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().