Home > Research > Publications & Outputs > Local search heuristic for the optimisation of ...

Text available via DOI:

View graph of relations

Local search heuristic for the optimisation of flight connections

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date21/09/2019
Host publicationProceedings of the International Conference on Computer, Control, Electrical, and Electronics Engineering 2019, ICCCEEE 2019
EditorsAhmed Hassan Mohammed Hassan, Ahmed M. Alhassan
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728110066
ISBN (Print)9781728110073
<mark>Original language</mark>English
Externally publishedYes
Event2019 International Conference on Computer, Control, Electrical, and Electronics Engineering, ICCCEEE 2019 - Khartoum North, Sudan
Duration: 21/09/201923/09/2019

Conference

Conference2019 International Conference on Computer, Control, Electrical, and Electronics Engineering, ICCCEEE 2019
Country/TerritorySudan
CityKhartoum North
Period21/09/1923/09/19

Publication series

NameProceedings of the International Conference on Computer, Control, Electrical, and Electronics Engineering 2019, ICCCEEE 2019

Conference

Conference2019 International Conference on Computer, Control, Electrical, and Electronics Engineering, ICCCEEE 2019
Country/TerritorySudan
CityKhartoum North
Period21/09/1923/09/19

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.