Parallel tabu search for a pickup and delivery problem under track contention

Authors:
Pierpaolo Caricato;Gianpaolo Ghiani;Antonio Grieco;Emanuela Guerriero
Affiliations:
Dipartimento di Elettronica, Informatica e Sistemistica, Università degli Studi della Calabria, 87030 Rende (CS), Italy;Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, 73100 Lecce, Italy;Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, 73100 Lecce, Italy;Dipartimento di Elettronica, Informatica e Sistemistica, Università degli Studi della Calabria, 87030 Rende (CS), Italy
Venue:
Parallel Computing - Special issue: Parallel computing in logistics
Year:
2003

Citing 5
Cited 2

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
The vehicle routing problem

The vehicle routing problem
MPI-The Complete Reference, Volume 1: The MPI Core

MPI-The Complete Reference, Volume 1: The MPI Core

Parallel tabu search for optimizing the OSPF weight setting problem

WSEAS TRANSACTIONS on COMMUNICATIONS
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article introduces the Pickup and Delivery Problem under Track Contention, a particular vehicle routing problem in which loads have to be transported between origin-destination pairs by means of vehicles travelling along a capacitated network. Two sequential heuristics and a parallel tabu search are proposed. Computational experiments show that the parallel tabu search is able to find much better solutions than the sequential procedures, although this comes at the expense of a higher computing time.