Synchronized dial-a-ride transportation of disabled passengers at airports

Publication: Research - peer-reviewJournal article – Annual report year: 2012

View graph of relations

The largest airports have a daily average throughput of more than 500 passengers with reduced mobility. The problem of transporting these passengers is in some cases a multi-modal transportation problem with synchronization constraints. A description of the problem together with a mathematical model is presented. The objective is to schedule as many of the passengers as possible, while ensuring a smooth transport with short waiting times. A simulated annealing based heuristic for solving the problem is presented. The algorithm makes use of an abstract representation of a candidate solution which in each step is transformed to an actual schedule by use of a greedy heuristic. Local search is performed on the abstract representation using advanced neighborhoods which modify large parts of the candidate solution. Computational results show that the algorithm is able to find good solutions within a couple of minutes, making the algorithm applicable for dynamic scheduling. Moreover high-quality solutions can be obtained by running the algorithm for 10minutes.
Original languageEnglish
JournalEuropean Journal of Operational Research
Publication date2013
Volume225
Issue1
Pages106-117
ISSN0377-2217
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 2

Keywords

  • Airport operations, Transportation planning, PRM, Heuristics, Simulated annealing, Dial-a-ride
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 20802826