Hybrid iterated local search algorithm for optimization route of airplane travel plans

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of electrical and computer engineering (Malacca, Malacca) Vol. 13; no. 4; p. 4700
Main Authors: Muklason, Ahmad, Agung Premananda, I Gusti
Format: Journal Article
Language:English
Published: 01.08.2023
ISSN:2088-8708, 2722-2578
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Agung Premananda, I Gusti
Muklason, Ahmad
Author_xml – sequence: 1
  givenname: Ahmad
  orcidid: 0000-0001-7620-7532
  surname: Muklason
  fullname: Muklason, Ahmad
– sequence: 2
  givenname: I Gusti
  orcidid: 0000-0002-5523-8249
  surname: Agung Premananda
  fullname: Agung Premananda, I Gusti
BookMark eNqFkM9KAzEYxINUsNa-Q15ga_5tkr0IUtQKBS_qNSTZxEbSzZKNhfr0breevHiZb77DDMzvGsy61DkAIEYrjOsG34ZPZ93qgGlgq75nAqFqFHEB5kQQUpFayNnokZSVFEhegeUwBIMYEwwJXs_B--ZocmhhKC7r4loYk9URDk5nu4M6fqQcym4Pfcow9SXsw7cuIXUwp6_iYPJQh9xH3TlYsj64CE_PcAMuvY6DW_7eBXh7fHhdb6rty9Pz-n5bWUKYqFpBHeNGN7QxyHoqteWs5ZgT3mBkmNSUY0aZwMJ777iQ3kjRuEZio2tj6ALIc6_NaRiy86rPYa_zUWGkJkRqQqQmROqMSJ0QjdG7P1EbyrRtHBLi_wU_FPt1OA
CitedBy_id crossref_primary_10_1007_s10586_025_05115_4
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.11591/ijece.v13i4.pp4700-4707
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2722-2578
ExternalDocumentID 10_11591_ijece_v13i4_pp4700_4707
GroupedDBID .4S
.DC
8FE
8FG
AAKDD
AAYXX
ABJCF
ABUWG
AFFHD
AFKRA
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ARCSS
BENPR
BGLVJ
BPHCQ
BVBZV
CCPQU
CITATION
EOJEC
HCIFZ
I-F
K6V
K7-
KWQ
L6V
M7S
OBODZ
OK1
P62
PHGZM
PHGZT
PQGLB
PQQKQ
PROAC
PTHSS
TUS
ID FETCH-LOGICAL-c2247-d73e46ba939b0cf38ac64d61626910b48a361434717fffe678fb879e981ba5bb3
ISSN 2088-8708
IngestDate Sat Nov 29 02:39:43 EST 2025
Tue Nov 18 22:33:56 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Issue 4
Language English
License http://creativecommons.org/licenses/by-sa/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c2247-d73e46ba939b0cf38ac64d61626910b48a361434717fffe678fb879e981ba5bb3
ORCID 0000-0001-7620-7532
0000-0002-5523-8249
OpenAccessLink https://ijece.iaescore.com/index.php/IJECE/article/download/31071/16748
ParticipantIDs crossref_primary_10_11591_ijece_v13i4_pp4700_4707
crossref_citationtrail_10_11591_ijece_v13i4_pp4700_4707
PublicationCentury 2000
PublicationDate 2023-08-01
PublicationDateYYYYMMDD 2023-08-01
PublicationDate_xml – month: 08
  year: 2023
  text: 2023-08-01
  day: 01
PublicationDecade 2020
PublicationTitle International journal of electrical and computer engineering (Malacca, Malacca)
PublicationYear 2023
SSID ssib044740765
ssj0000866295
Score 2.2673116
Snippet The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem...
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 4700
Title Hybrid iterated local search algorithm for optimization route of airplane travel plans
Volume 13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2722-2578
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044740765
  issn: 2088-8708
  databaseCode: M~E
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2722-2578
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000866295
  issn: 2088-8708
  databaseCode: P5Z
  dateStart: 20110901
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2722-2578
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000866295
  issn: 2088-8708
  databaseCode: K7-
  dateStart: 20110901
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: East & South Asia Database
  customDbUrl:
  eissn: 2722-2578
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000866295
  issn: 2088-8708
  databaseCode: BVBZV
  dateStart: 20110901
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/eastsouthasia
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database (subscription)
  customDbUrl:
  eissn: 2722-2578
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000866295
  issn: 2088-8708
  databaseCode: M7S
  dateStart: 20110901
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2722-2578
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000866295
  issn: 2088-8708
  databaseCode: BENPR
  dateStart: 20110901
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWwoEeEE9RKMgHbquUJnbs-IiqonKg4lBQb5HtOG1KNonCdlUu_C5-HuNHHkWgAhKXKPLGo93Mp8_feMczCL2CRR-8zsqo5NREFPRbpJJCREzEBU0LrnmqXbMJfnycnZ6KD4vF9-EszKbmTZNdXYnuv7oaxsDZ9ujsX7h7NAoDcA9Ohyu4Ha5_5Pijr_YQ1tKXSwY56VarZdjdkPVZ21fr85VLL2yBL1bhIOayb0PKgKz6zqbA2vYRG1PbRtNhS-9iSnufdhFntSd8T52x_oAOHSOWZip6aBXte1lLcKk_KhRuxeT5zyDoQ6fr85UsRkieAS_ZlBGbcNsUbvo7gDhw1HzrIiFj4lxguAQoDuh43xOw8WMcomPLI9comsygSGd8S7mrc_qLhSAVdiWoLow2e5uYVHSv6-zTgEffZvd67e2f1sQxU9HFSGArd5ZyZyn3lnJr6Ra6nXD43CaNfjscmIxSDoFy-P_YaYKMscS1ABp_85BWBpNf_-ZrzrTSTPSc3Ef3QrSC33iUPUAL0zxE27Malo_QJ483POANO7xhjzc84g0D3vAcb9jhDbclHvCGPd6ww9tj9PHt4cnBURSadUQaVCCPCk4MZUoKItS-LkkmNaMFiyFgBkWqaCYJKEECWoiXZWlAI5Uq48IIiJtkqhR5graatjFPEaYaWAKEMzdMUmZSxTKTCBkXhlFJVbmD-PBach0q2duGKnV-k7d2UDzO7Hw1lxvnPPuHOc_R3Qnvu2hr3V-aF-iO3qyrL_1LB5Ufp-Oe4A
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Hybrid+iterated+local+search+algorithm+for+optimization+route+of+airplane+travel+plans&rft.jtitle=International+journal+of+electrical+and+computer+engineering+%28Malacca%2C+Malacca%29&rft.au=Muklason%2C+Ahmad&rft.au=Agung+Premananda%2C+I+Gusti&rft.date=2023-08-01&rft.issn=2088-8708&rft.eissn=2722-2578&rft.volume=13&rft.issue=4&rft.spage=4700&rft_id=info:doi/10.11591%2Fijece.v13i4.pp4700-4707&rft.externalDBID=n%2Fa&rft.externalDocID=10_11591_ijece_v13i4_pp4700_4707
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2088-8708&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2088-8708&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2088-8708&client=summon