An adaptive hybrid VNS/SA approach to the one-commodity pickup and delivery problem

Authors:
Manar I. Hosny;Christine L. Mumford
Affiliations:
Cardiff University, Cardiff, Wales Uk;Cardiff University, Cardiff, Wales Uk
Venue:
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Year:
2010

Citing 4
Cited 0

Variable neighborhood search

Computers and Operations Research
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

Transportation Science
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The One-Commodity Pickup and Delivery Problem (1-PDP) is an NP-hard problem, in which one type of commodity is collected from a set of pickup customers to be delivered to a set of delivery customers, and the origins and destinations of the goods are not paired. We introduce a new adaptive hybrid VNS/SA (Variable Neighborhood Search/Simulated Annealing) approach for solving the 1-PDP. We perform multiple VNS runs, where neighborhood sizes, within which the search is performed at each run, are adaptable and depend on the search progress. Experimental results on a large number of benchmark instances indicate that the algorithm outperforms previous heuristics in 90% of the large size benchmark instances. Nevertheless, this comes at the expense of an increased processing time.