Local search heuristic for the optimisation of flight connections

Alrasheed, Maab and Mohammed, Wafaa and Pylyavskyy, Yaroslav and Kheiri, Ahmed (2020) Local search heuristic for the optimisation of flight connections. In: International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE). IEEE. ISBN 9781728110073

[img]
Text (ICCCEEE19)
ICCCEEE19.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (337kB)

Abstract

Kiwi.com proposed a real-world NP-hard optimisation problem with a focus on air travelling services, determining the cheapest connection between specific areas. Despite some similarities with the classical TSP problem, more complexity is involved that makes the problem unique. It is Time-dependent, Asymmetric and involves areas that contain sets of cities from which exactly one is visited. In addition to this, infeasibility adds more complexity to the problem since there are no flights available between specific points in the network for certain days. While solving such computationally difficult problems, exact methods often fail, particularly when the problem instance size increases; Then alternative approaches, such as heuristics, are preferred in problem solving. In this study, we present an effective local search method for solving Kiwi.com problem. The empirical results show the success of the approach, which embeds four simple operators, on most of the released instances.

Item Type:
Contribution in Book/Report/Proceedings
Additional Information:
©2019 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Subjects:
ID Code:
138078
Deposited By:
Deposited On:
21 Oct 2019 08:55
Refereed?:
Yes
Published?:
Published
Last Modified:
09 Sep 2022 00:34