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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annual IEEE India Conference s. 1 - 7
Hlavní autoři: Rajaramon, Viknesh, Pandiri, Venkatesh
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 24.11.2022
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:2325-9418
DOI:10.1109/INDICON56171.2022.10039842