Rights statement: ©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.
Accepted author manuscript, 330 KB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - Local search heuristic for the optimisation of flight connections
AU - Alrasheed, Maab
AU - Mohammed, Wafaa
AU - Pylyavskyy, Yaroslav
AU - Kheiri, Ahmed
N1 - ©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.
PY - 2020/4/20
Y1 - 2020/4/20
N2 - 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.
AB - 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.
KW - Local Search
KW - optimalisation
KW - Metaheuristics
KW - Computational Design
KW - Travelling Salesman Problem
U2 - 10.1109/ICCCEEE46830.2019.9071395
DO - 10.1109/ICCCEEE46830.2019.9071395
M3 - Conference contribution/Paper
SN - 9781728110073
BT - International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)
PB - IEEE
ER -