Multi-strategy grouping genetic algorithm for the pickup and delivery problem with time windows

Authors:
Genhong Ding;Linye Li;Yao Ju
Affiliations:
Hohai University, Nanjing, China;Hohai University, Nanjing, China;Hohai University, Nanjing, China
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 2
Cited 2

Genetic Algorithms and Grouping Problems

Genetic Algorithms and Grouping Problems
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms

Simulation evaluation for on-demand bus system with electrical vehicles

Intelligent Decision Technologies - Special issue on design of intelligent environment
Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Pickup and Delivery Problem with Time Windows (PDPTW) is a generalization of the well studied Vehicle Routing Problem with Time Windows (VRPTW). This paper studies a Grouping Genetic Algorithm for solving the PDPTW. The insertion-searching heuristics (in GGA) which can generate feasible solutions was improved, new data structures were built, and then three routing adjustment strategies were added to come up with the Multi-Strategy Grouping Genetic Algorithm (MSGGA). The PDPTW benchmark problems with 100 customers are calculated with MSGGA, and the comparison between the result and that of the reference shows that the new algorithm shortens the calculating time with its astringency, better solutions of four cases are obtained and stability is improved.