Continuous Truck Delivery Scheduling and Execution System with Multiple Agents
Proceedings of the 5th Pacific Rim International Workshop on Multi Agents: Intelligent Agents and Multi-Agent Systems
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Computers and Operations Research
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
Towards Agent-Based Evolutionary Planning in Transportation Systems
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Multi-agent Crisis Management in Transport Domain
ICCS 2009 Proceedings of the 9th International Conference on Computational Science
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Computers and Operations Research
Guided ejection search for the pickup and delivery problem with time windows
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon's benchmark test cases for VRPTW. Experimental results show that our approach yields very good solutions when compared with the benchmarking solutions.