A heuristic for the pickup and delivery traveling salesman problem
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Pickup and Delivery with Time Windows: Algorithms and Test Case Generation
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
A Metaheuristic for the Pickup and Delivery Problem with Time Windows
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Effective Heuristics to Solve Pickup and Delivery Problems with Time Windows
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows
Computers and Industrial Engineering
| Hi-index | 0.00 |
The single vehicle pickup and delivery problem with time windows is an important practical problem, yet only a few researchers have tackled it. In this research, we compare three different approaches to the problem: a genetic algorithm, a simulated annealing approach, and a hill climbing algorithm. In all cases, we adopt a solution representation that depends on a duplicate code for both the pickup request and its delivery. We also present an intelligent neighborhood move, that is guided by the time window, aiming to overcome the difficult problem constraints efficiently. Results presented herein improve upon those that have been previously published.