Abstract
This paper presents an efficient meta-heuristic for the Pickup and Delivery Problem with Time Windows (PDPTW) based on Ant Colony Optimization coupled to dedicated local search algorithms. The objective function is the minimization of the number of vehicles and the minimization of the total distance travelled. In PDPTW, the demands are coupled and every couple is a request which must be satisfy in the same route. Thus, the feasible solution space is tightly constraint and then makes the design of effective heuristics more difficult. Experimental results on 56 instances of 100 customers of Li and Lim’s benchmark show that the ACO coupled with PDPTW dedicated local search algorithms outperform existing algorithms. It returns in 98.2% (55/56) of cases a solution better or equal to the best known solution, and find a better solution than the best know in 44.6% (25/56).
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.
