Files:DescriptionFile size FormatBrowse
Fulltext0.01 MBPDF (requires Acrobat Reader)Previous | Next
  
Authors:Sin C. Ho: University of Bergen, Norway
Dag Haugland: University of Bergen, Norway
Publication title:Tabu Search Heuristics for the Probabilistic Dial-a-Ride Problem
Conference:Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Publication type: Abstract
Issue:014
Article No.:014
Abstract: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.
Language:English
Year:2004
No. of pages:1
Series:Linköping Electronic Conference Proceedings
ISSN (print):1650-3686
ISSN (online):1650-3740
File:http://www.ep.liu.se/ecp/014/014/ecp014014.pdf
Available:2004-12-28
Publisher:Linköping University Electronic Press; Linköpings universitet

REFERENCE TO THIS PAGE
Sin C. Ho, Dag Haugland (2004). Tabu Search Heuristics for the Probabilistic Dial-a-Ride Problem, Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society http://www.ep.liu.se/ecp_article/index.en.aspx?issue=014;article=014 (accessed 10/25/2014)