Multi-objective capacitated location-routing problem: modelling and a simulated annealing heuristic Online publication date: Mon, 28-Apr-2014
by Nader Ghaffari-Nasab; M. Saeed Jabalameli; Ali Saboury
International Journal of Services and Operations Management (IJSOM), Vol. 15, No. 2, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook