Abstract
Dynamic vehicle routing problem (DVRP) with single depot has received increasing interest from engineers and scientists. Dynamic multi-depot vehicle routing problem (DMDVRP), an extension of DVRP, however, has not received much attention. In our paper, a distance-based clustering approach is introduced to simplify the DMDVRP by allocating each customer to its nearest depot. Thus, DMDVRP is decomposed to a sequence of DVRPs. An improved ant colony optimisation (IACO) with ant-weight strategy and mutation operation is presented to optimise vehicle routing problem (VRP) in this paper. Moreover, to satisfy the real-time feature of DMDVRP, the nearest addition approach is used to handle the new orders occurring during a time slice on the basis of VRP solution. Finally, the computational results for 17 benchmark problems are reported to validate that IACO with the distance-based clustering approach is more suitable for solving DMDVRP.
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: International Journal of Logistics Research and Applications
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.
