Abstract
A touristic company that offers fly-in safaris is faced with the challenge to route and schedule its fleet of aircrafts in an optimal way. Over the course of a given time horizon several groups of tourists have to be picked up at airports and flown to their destinations within a certain time window. Furthermore the number of available seats, the consumption of fuel, the maximal takeoff weight, and restrictions on the detour of the individual groups have to be taken into account. A flow-over-flow formulation on the time expanded graph of the airports was used in the literature in combination with a so called time-free relaxation in order to solve this problem with a solver for MILP. We give an alternative MILP formulation of the problem, that still allows for similar relaxation techniques to be used. This formulation, however, also allows for the construction of graphs which can be interpreted as intermediate graphs between the time-free and the (totally) time-expanded graph and therefore yield stronger relaxations. With knowledge obtained from the solutions of these relaxations the number of vertices that have to be expanded in order to guarantee feasibility is reduced significantly. On the benchmark set this lead to a decrease of the average computation time and a significant reduction of the remaining optimality gaps.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boland, N., Hewitt, M., Vu, D.M., Savelsbergh, M.: Solving the traveling salesman problem with time windows using time-expanded networks. In: International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 254–262. Springer, Cham (2017)
Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous-time service network design problem. Oper. Res. 65(5), 1303–1321 (2017)
Fügenschuh, A., Nemhauser, G., Zeng, Y.: Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model, pp. 419–447. Springer, Berlin (2013)
Gavish, B., Graves, S.C.: The Traveling Salesman Problem and Related Problems. Technical Report OR 078-78, Operations Research Center, Massachusetts Institute of Technology, 1978
Acknowledgement
This project was funded by the German Research Association (DFG), grant number FU 860/1-1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Gnegel, F., Fügenschuh, A. (2019). A Time-Flow Approach for Scheduling and Routing of Fly-in Safari Airplanes. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)