We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Hybrid iterated local search algorithm for optimization route of airplane travel plans.
- Authors
Muklason, Ahmad; Premananda, I. Gusti Agung
- Abstract
The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem has been classified as a Non-deterministic Polynomial Hard (NP-Hard), so a non-deterministic algorithm is needed to solve this problem. However, a non-deterministic algorithm can only produce a fairly good solution but does not guarantee an optimal solution. Therefore, there are still opportunities to develop new algorithms with better optimization results. This research develops a new algorithm by hybridizing three local search algorithms, namely, iterated local search (ILS) with simulated annealing (SA) and hill climbing (HC), to get a better optimization result. This algorithm aimed to solve TSP problems in the transportation sector, using a case study from the Traveling Salesman Challenge 2.0 (TSC 2.0). The test results show that the developed algorithm can optimize better by 15.7% on average and 11.4% based on the best results compared to previous studies using the Tabu-SA algorithm.
- Subjects
AIRWAYS (Aeronautics); AIR travel; TRAVELING salesman problem; SEARCH algorithms; TRAVEL planning; SIMULATED annealing; HYBRID electric airplanes; COMBINATORICS
- Publication
International Journal of Electrical & Computer Engineering (2088-8708), 2023, Vol 13, Issue 4, p4700
- ISSN
2088-8708
- Publication type
Article
- DOI
10.11591/ijece.v13i4.pp4700-4707