Cremers, M.L.A.G. Klein Haneveld, W.K. Vlerk, M.H. van der (Groningen University)
Abstract
In a previous paper we developed a non-standard two-stage recourse model for the dynamic day-ahead paratransit planning problem. Two heuristics, which are frequently applied in the recourse model, contain many details which leads to large CPU times to solve instances of relatively small size. In this paper we simplify both heuristics to decrease CPU time considerably while maintaining the quality of the obtained solutions as much as possible. Numerical experiments on (semi-)realistic instances, inspired by practice, show that our recourse model with fast heuristics provides acceptable solutions within reasonable time.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Groningen, Research Institute SOM (Systems, Organisations and Management) in its series Research Report with number
08004.
Did you know? You can import bibliographic info in various formats into you bibliographic tool, or just into your word processor. See under "publisher info" on each abstract page.