Abstract
Abstract The Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW) is an important variant of the Vehicle Routing Problem (VRP), which is complex and still not resolved well. To solve the problem, mathematical model of the MDHVRPTW is constructed and a modified variable neighborhood search algorithm is proposed. In the algorithm, a hybrid operator of insert and exchange are used to achieve the shaking process, the Best-improvement strategy is adopted, and it can make the algorithm to achieve a better balance in the solution quality and running time. The performance of the proposed algorithm is tested on the benchmark instances proposed by Golden and compared with other algorithms in the literature. The results indicate that the proposed algorithm is competitive and feasible in solving the MDHVRPTW.
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.
