 The Latency Location-Routing ProblemMohammad Moshref-Javadi and Seokcheon Lee European Journal of Operational Research, 2016, vol. 255, issue 2, 604-619 Abstract: This paper introduces the Latency Location-Routing Problem (LLRP) whose goal is to minimize waiting time of recipients by optimally determining both the locations of depots and the routes of vehicles. The LLRP is customer oriented by pursuing minimization of the latency instead of minimization of the length of routes. One of the main applications of this problem is the distribution of supplies to affected areas in post-disaster relief activities. It is also relevant in customer-oriented supply chain where latency at demand locations plays a significant role in the satisfaction of the customers. The problem is formulated mathematically and two heuristics, the Memetic Algorithm (MA) and the Recursive Granular Algorithm (RGA), are proposed. An extensive experimental study shows that both algorithms are able to produce promising results in reasonable time. Keywords: Location routing; Minimum latency problem; Memetic Algorithm; Granular search; Humanitarian logistics (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:255:y:2016:i:2:p:604-619 DOI: 10.1016/j.ejor.2016.05.048 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.