Citation
An analysis of constructive algorithms for the airport baggage sorting station assignment problem. Journal of Scheduling, 17 (6): 601-619, 2014.
Selected
Abstract
The assignment of airport resources can significantly affect the quality of service provided by airlines and airports. High quality assignments can support airlines and airports in adhering to published schedules by minimising changes or delays while waiting for resources to become available. In this paper, we consider the problem of assigning available baggage sorting stations to flights which have already been scheduled and allocated to stands. A model for the problem is presented, and the different objectives which have to be considered are highlighted. A number of constructive algorithms for sorting station assignments are then presented and their effects are compared and analysed when different numbers of sorting stations are available. It can be observed that appropriate algorithm selection is highly dependent upon whether or not reductions in service time are permitted and upon the flight density in relation to the number of sorting stations. Finally, since these constructive approaches produce different solutions which are better for different trade-offs of the objectives, we utilise these as initial solutions for an evolutionary algorithm as well as for an Integer Linear Programming model in CPLEX. We show that in both cases they are helpful for improving the results which are obtainable within reasonable solution times.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-013-0361-x You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@ARTICLE{2014-601-619-SI, author = {A. Asco and J. A. D. Atkin and E. K. Burke},
title = {An analysis of constructive algorithms for the airport baggage sorting station assignment problem},
journal = {Journal of Scheduling},
year = {2014},
volume = {17},
pages = {601--619},
number = {6},
note = {Selected},
abstract = {The assignment of airport resources can significantly affect the quality of service provided by airlines and airports. High quality assignments can support airlines and airports in adhering to published schedules by minimising changes or delays while waiting for resources to become available. In this paper, we consider the problem of assigning available baggage sorting stations to flights which have already been scheduled and allocated to stands. A model for the problem is presented, and the different objectives which have to be considered are highlighted. A number of constructive algorithms for sorting station assignments are then presented and their effects are compared and analysed when different numbers of sorting stations are available. It can be observed that appropriate algorithm selection is highly dependent upon whether or not reductions in service time are permitted and upon the flight density in relation to the number of sorting stations. Finally, since these constructive approaches produce different solutions which are better for different trade-offs of the objectives, we utilise these as initial solutions for an evolutionary algorithm as well as for an Integer Linear Programming model in CPLEX. We show that in both cases they are helpful for improving the results which are obtainable within reasonable solution times.},
doi = {10.1007/s10951-013-0361-x},
owner = {user},
timestamp = {2012.05.25} }