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

Full description

Bibliographic Details

Published in:	Annual IEEE India Conference pp. 1 - 7
Main Authors:	Rajaramon, Viknesh, Pandiri, Venkatesh
Format:	Conference Proceeding
Language:	English
Published:	IEEE 24.11.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!