A SOLUTION TO THE MULTI-DEPOTS PICK-UP AND DELIVERY PROBLEMS WITH TIME WINDOWS USING AN ANT COLONY-BASED ALGORITHM

Vol 56, 2024 - 309935
Complete Articles (CA)
Download
Favorite this paper
How to cite this paper?
Abstract

This paper proposes an Ant Colony Optimization algorithm to solve the Multi-Depots Pick-up and Delivery Problems with Time Windows - MDPDPTW. Due to the lack of specific problem instances, adapted instances from other literature papers were used for result comparison. Computational results demonstrate that the algorithm produces competitive solutions compared to the literature's best. Future research could explore new neighborhood movements and refinement strategies to enhance solution quality further.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Programme
13:30 to 15:00 on 11/04/2024
Pedro Lazar 3
Institutions
  • 1 CEFET-MG
Track
  • 12. L&T – Logistics and Transport
Keywords
Vehicle Routing Problem with Time Window, Pickup and Delivery, and Multiple Depots
Multiple Deposits
Pick-up & Delivery Issues