Abstract
The location-routing problem (LRP) is a relatively new research area within location analysis that concerns simultaneously both the problems of location of facilities and routing of vehicles among the established facilities and the demand points. In this work, we address the capacitated LRP with probabilistic travel times, which may arise in many practical contexts in logistics and supply chain management, and present some bi-objective mathematical programming formulations to model the problem using different stochastic programming approaches. The first objective is to minimize the overall system-wide costs, while the second objective concerns minimization of the maximum delivery time to the customers. In all the cases, the deterministic equivalents of the stochastic models have been extracted. To solve the resulted models, a variable neighborhood descent-based heuristic is proposed and finally computational study is performed and numerical results are reported.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
