Local search heuristics for the probabilistic dial-a-ride problem

Authors:
Sin C. Ho;Dag Haugland
Affiliations:
CORAL, Department of Business Studies, Aarhus School of Business, Aarhus University, Århus V, Denmark 8210;Department of Informatics, University of Bergen, Bergen, Norway 5020
Venue:
OR Spectrum
Year:
2011

Citing 11
Cited 1

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
A priori solution of a travelling salesman problem in which a random subset of the customers are visited

Operations Research
A priori optimization

Operations Research
A tabu search heuristic for the vehicle routing problem

Management Science
VRP with pickup and delivery

The vehicle routing problem
Tabu Search

Tabu Search
Statistical Analysis of Computational Tests of Algorithms and Heuristics

INFORMS Journal on Computing
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

Parallel Computing
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

Networks
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Operations Research
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem

Transportation Science

Stochastic Preplanned Household Activity Pattern Problem with Uncertain Activity Participation SHAPP

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the probabilistic dial-a-ride problem, and describes an efficient request-relocation neighborhood evaluation procedure for the problem. The running time of the procedure is $${\mathcal{O}(n^5)}$$ , compared to $${\mathcal{O}(n^6)}$$ for a straightforward approach. For solving the problem we embed the suggested evaluation procedure in a pure local search heuristic and in a tabu search heuristic. The quality of the solutions obtained by the two heuristics have been compared experimentally. Computational results confirm that our neighborhood evaluation technique is much faster than the straightforward one, and for cases with 144 users and 4 vehicles it is demonstrated that the computation time can be reduced by a factor larger than 27.