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

Podrobná bibliografia

Vydané v:	Annual IEEE India Conference s. 1 - 7
Hlavní autori:	Rajaramon, Viknesh, Pandiri, Venkatesh
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 24.11.2022
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!