A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
Summary: The bottleneck travelling salesman problem is to find a Hamiltonian circuit that minimises the maximum arc length in a graph. We first modify an existing lexisearch algorithm by incorporating good upper and lower bounds to obtain exact optimal solution to the problem. Then we present a data-guided lexisearch algorithm. Depending on the medians of rows of the cost matrix for the problem, the nodes of the network are renamed and a new alphabet table is constructed and then the modified lexisearch algorithm is applied. It is shown that this minor preprocessing of the data, before the lexisearch algorithm is applied, improves computational time substantially. The efficiency of our algorithms as against the existing lexisearch algorithm to the problem has been examined for some TSPLIB instances and a variety of randomly generated instances of different sizes and different types.
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
- An Algorithm for the Bottleneck Traveling Salesman Problem
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- An Algorithm for the Bottleneck Traveling Salesman Problem
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- An exact algorithm for the clustered travelling salesman problem
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
This page was built for publication: A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758845)
