Abstract
The capacitated location-routing problem (CLRP) is a new research area in logistics and distribution management. This problem combines two difficult problems: the facility location problem (FLP) and vehicle routing problem (VRP). The goal of the CLRP is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. The time windows constraint has numerous real-life applications, however there are little attention to this fact in the CLRP. This paper, considers the CLRP with hard time windows (CLRPHTW). At first, a mixed integer linear programming (MILP) formulations for the CLRPHTW is presented, then a meta-heuristic approach based on variable neighborhood search for solving the CLRPHTW is proposed. In order to evaluate the performance of the suggested method, this framework is tested on a set of instances. The experimental results show the effectiveness of the proposed approach.
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 callDisclaimer: 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.
