A Multi-Start Iterated Local Search Algorithm for the Bottleneck Traveling Salesman Problem

The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem (TSP) in which the goal is to identify a Hamiltonian circuit with the lowest maximum edge cost among its constituent edges on a complete graph. The BTSP finds application in minimizing make-s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annual IEEE India Conference S. 1 - 7
Hauptverfasser: Rajaramon, Viknesh, Pandiri, Venkatesh
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 24.11.2022
Schlagworte:
2-opt move
Benchmark testing
Bottleneck traveling salesman problem
Costs
heuristic algorithm
iterated local search
Metaheuristics
Planning
Search problems
Traveling salesman problems
Vehicle routing
ISSN:2325-9418
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem (TSP) in which the goal is to identify a Hamiltonian circuit with the lowest maximum edge cost among its constituent edges on a complete graph. The BTSP finds application in minimizing make-span in a two-machine flow shop with no-wait-in-process and in the area of workforce planning. A multi-start iterated local search algorithm for the BTSP is proposed in this paper. As part of this approach, two local search algorithms have been developed - one based on modified 2-opt moves and the other based on node insertion. The performance of the proposed approach is investigated by using the standard TSPLIB's benchmark instances. The effectiveness of the proposed approach is demonstrated through computational results and their interpretation.
AbstractList The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem (TSP) in which the goal is to identify a Hamiltonian circuit with the lowest maximum edge cost among its constituent edges on a complete graph. The BTSP finds application in minimizing make-span in a two-machine flow shop with no-wait-in-process and in the area of workforce planning. A multi-start iterated local search algorithm for the BTSP is proposed in this paper. As part of this approach, two local search algorithms have been developed - one based on modified 2-opt moves and the other based on node insertion. The performance of the proposed approach is investigated by using the standard TSPLIB's benchmark instances. The effectiveness of the proposed approach is demonstrated through computational results and their interpretation.
Author Pandiri, Venkatesh
Rajaramon, Viknesh
Author_xml – sequence: 1
  givenname: Viknesh
  surname: Rajaramon
  fullname: Rajaramon, Viknesh
  email: viknesh0209@gmail.com
  organization: Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram,Department of Computer Science and Engineering,Chennai,India,600 127
– sequence: 2
  givenname: Venkatesh
  surname: Pandiri
  fullname: Pandiri, Venkatesh
  email: venkateshpandiri@iiitdm.ac.in
  organization: Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram,Department of Computer Science and Engineering,Chennai,India,600 127
BookMark eNo10LtOw0AQQNEFgUQS8gcUK3qHmX34UYYQwFJIkBIqimhsjxPD2kbrBYm_pwCq253ijsVZ13csxDXCDBGym3x9ly82axtjgjMFSs0QQGepUSdijHFsTaItZKdipLSyUWYwvRDTYXgDAAWAaM1IvM7l06cLTbQN5IPMA3sKXMlVX5KTWyZfHuXcHXrfhGMr697LcGR524fguOPyXe48fbFruoPckuOhpU4--75w3F6K85rcwNO_TsTL_XK3eIxWm4d8MV9FDWoTIiYkZbAqdJJSYuMUYlPHUGNGWNaGU5tUcam1KaAobUJUpSazXFBhiUzNeiKuft2GmfcfvmnJf-__Z-gf3ENXag
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/INDICON56171.2022.10039842
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1665473509
9781665473507
EISSN 2325-9418
EndPage 7
ExternalDocumentID 10039842
Genre orig-research
GrantInformation_xml – fundername: Science and Engineering Research Board
  funderid: 10.13039/501100001843
GroupedDBID 6IE
6IF
6IL
6IN
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i134t-ea1a241db378a7568064f60f19a1cf4e857d6c334b0bc57aad8495ebab5aa4fe3
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000978286100128&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:06:25 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i134t-ea1a241db378a7568064f60f19a1cf4e857d6c334b0bc57aad8495ebab5aa4fe3
PageCount 7
ParticipantIDs ieee_primary_10039842
PublicationCentury 2000
PublicationDate 2022-Nov.-24
PublicationDateYYYYMMDD 2022-11-24
PublicationDate_xml – month: 11
  year: 2022
  text: 2022-Nov.-24
  day: 24
PublicationDecade 2020
PublicationTitle Annual IEEE India Conference
PublicationTitleAbbrev INDICON
PublicationYear 2022
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002001154
Score 1.8139968
Snippet The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem (TSP) in which the goal is to identify a...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms 2-opt move
Benchmark testing
Bottleneck traveling salesman problem
Costs
heuristic algorithm
iterated local search
Metaheuristics
Planning
Search problems
Traveling salesman problems
Vehicle routing
Title A Multi-Start Iterated Local Search Algorithm for the Bottleneck Traveling Salesman Problem
URI https://ieeexplore.ieee.org/document/10039842
WOSCitedRecordID wos000978286100128&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8MgGCa6eNCLXzN-h4PXzlJoocc5XVyy1CVOs8SDAfqii641XefvF9iHevDgjXAAAoHneYHneRG6IJSH0uRJIBXYACW34Y6QRASxpBpYqqn2r-ePfZ5lYjRKBwuxutfCAID_fAYtV_Rv-XmpZ-6qzO7wkKaC2RN3nfNkLtZaXahEc2uZhbEoCdPLXnbd69xlliFwFwlGUWvZwK9UKh5Jutv_HMMOan5r8vBghTa7aA2KPbT1w05wHz21sdfTBpZBVjXuecNkyHHf4RWefyzG7feXshrXrxNs6Sq29A9flc7HuAD9hocuGZETqON7CxzTiSxcny7jTBM9dG-GndtgkTwhGBPK6gAkkRadc0W5kDxOhOUeJgkNSSXRhoGIeZ5oSpkKlY65lLmwsRIoqWIpmQF6gBpFWcAhwkQaiIFIZVLGNFMq5RCZhGqSCsO4OEJNN0_PH3N_jOflFB3_UX-CNt1qOEVfxE5Ro65mcIY29Gc9nlbnflW_AE99o9U
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwHG0MmqgXvzB-24PX4Uq7tTsiSiDiJBENiQfSdr8qUYaB4d9vuw3UgwdvSw9b06Z779f2vYfQBaHclyYJPanAFiiJLXeEJMILJNXAIk11fnr-1OVxLAaDqFeK1XMtDADkl8-g5h7zs_xkouduq8yucJ9Ggtk_7qqLzirlWsstlXphLlNaixI_uuzE153mfWw5Ane1YL1eW7ziV5hKjiWtrX_2YhtVv1V5uLfEmx20Auku2vxhKLiHnhs4V9R6lkNOM9zJLZMhwV2HWLi4Wowb7y-T6Sh7HWNLWLElgPhq4pyMU9BvuO_iiJxEHT9Y6JiNZeq-6TJnquixddNvtr0yPsEbEcoyDySRFp8TRbmQPAiFZR8m9A2JJNGGgQh4EmpKmfKVDriUibDVEiipAimZAbqPKukkhQOEiTQQAJHKRIxpplTEoW5CqkkkDOPiEFXdOA0_CoeM4WKIjv5oP0fr7f5dd9jtxLfHaMPNTKHvO0GVbDqHU7SmP7PRbHqWz_AXBvqnGQ
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=proceeding&rft.title=Annual+IEEE+India+Conference&rft.atitle=A+Multi-Start+Iterated+Local+Search+Algorithm+for+the+Bottleneck+Traveling+Salesman+Problem&rft.au=Rajaramon%2C+Viknesh&rft.au=Pandiri%2C+Venkatesh&rft.date=2022-11-24&rft.pub=IEEE&rft.eissn=2325-9418&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FINDICON56171.2022.10039842&rft.externalDocID=10039842