Tabu Search Heuristics for the Probabilistic Dial-a-Ride Problem

Sin C. Ho
University of Bergen, Norway

Dag Haugland
University of Bergen, Norway

Ladda ner artikel

Ingår i: Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society

Linköping Electronic Conference Proceedings 14:14, s.

Visa mer +

Publicerad: 2004-12-28


ISSN: 1650-3686 (tryckt), 1650-3740 (online)


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.


Inga nyckelord är tillgängliga


Inga referenser tillgängliga

Citeringar i Crossref