Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows

Authors:
Penny L. Holborn;Jonathan M. Thompson;Rhyd Lewis
Affiliations:
School of Mathematics, Cardiff University, Cardiff, Wales, UK;School of Mathematics, Cardiff University, Cardiff, Wales, UK;School of Mathematics, Cardiff University, Cardiff, Wales, UK
Venue:
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2012

Citing 8
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
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
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

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

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows

Computers and Operations Research
An Application of the Ant Colony System Metaheuristic to the Vehicle Routing Problem with Pickup and Delivery and Time Windows

SBRN '10 Proceedings of the 2010 Eleventh Brazilian Symposium on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The vehicle routing problem with pickups, deliveries and time windows (PDPTW) is an important member in the class of vehicle routing problems. In this paper a general heuristic to construct an initial feasible solution is proposed and compared with other construction methods. New route reconstruction heuristics are then shown to improve on this. These reconstruction heuristics look to reorder individual routes and recombine multiple routes to decrease the number of vehicles used in the solution. A tabu search scheme where the attribute to be recorded has been specifically adapted to the PDPTW is proposed. A new method based on branch and bound optimisation attempts to optimise the final ordering of requests in routes to further improve the solutions. Results are analysed for a standard set of benchmark instances and are shown to be competitive with the state of the art.