New Models for Capacitated Air-cargo Scheduling Problems

DOI

10.2991/msmi-16.2016.42How to use a DOI?

Keywords

air-cargo; vehicle; hub-and-spoke; airline; hub location.

Abstract

This paper examines hub location and scheduling of planes for an express company. Two Mixed Integer Programming (MIP) models are constructed for this problem, restricted model (RM) and extensible model (EM). The comparison between the two models shows that the first one performs better than the existing models in terms of solution time, while the second one with different variable definition may further reduce the total cost by allowing more visiting hubs for serving an O-D pair. Due to the NP-hardness of the problem, a two-stage hybrid algorithm is developed to solve the large-scale instances. Numerical experiments are conducted to test the performance of the algorithm.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Fan-Rui Xie
AU  - Kun Huang
AU  - Can-Rong Zhang
PY  - 2016/08
DA  - 2016/08
TI  - New Models for Capacitated Air-cargo Scheduling Problems
BT  - Proceedings of the 2016 International Conference on Management Science and Management Innovation
PB  - Atlantis Press
SP  - 174
EP  - 177
SN  - 2352-5428
UR  - https://doi.org/10.2991/msmi-16.2016.42
DO  - 10.2991/msmi-16.2016.42
ID  - Xie2016/08
ER  -