Article | Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society | Tabu Search Heuristics for the Probabilistic Dial-a-Ride Problem

Title:
Tabu Search Heuristics for the Probabilistic Dial-a-Ride Problem
Author:
Sin C. Ho: University of Bergen, Norway Dag Haugland: University of Bergen, Norway
Download:
Full text (pdf)
Year:
2004
Conference:
Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Issue:
014
Article no.:
014
No. of pages:
1
Publication type:
Abstract
Published:
2004-12-28
Series:
Linköping Electronic Conference Proceedings
ISSN (print):
1650-3686
ISSN (online):
1650-3740
Publisher:
Linköping University Electronic Press; Linköpings universitet


Export in BibTex, RIS or text

We present an efficient neighborhood search procedure for the probabilistic dial-a-ride problem. The suggested approach requires O(n4) computations as opposed to O(n6) operations required by a straightforward neighborhood evaluation. In the current work a tabu search and a hybrid GRASP/tabu search exploiting this search procedure are developed and compared through numerical experiments.

Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society

Author:
Sin C. Ho, Dag Haugland
Title:
Tabu Search Heuristics for the Probabilistic Dial-a-Ride Problem
References:
No references available

Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society

Author:
Sin C. Ho, Dag Haugland
Title:
Tabu Search Heuristics for the Probabilistic Dial-a-Ride Problem
Note: the following are taken directly from CrossRef
Citations:
No citations available at the moment