Abstract
The vehicle routing problem derived from a real cold-chain distribution company is studied in this paper. It is formulated as a multi-compartment vehicle routing problem with some practical constraints. A mathematical model is provided and an adaptive large neighborhood search (ALNS) algorithm is developed to solve the real-world problems. The computational experiments demonstrate the effectiveness and efficiency of the ALNS algorithm compared with the manual method based mostly on experience. In addition, a sensitivity analysis provides valuable managerial insights for the decision-makers.
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.
