Local Search for the Asymmetric Traveling Salesman Problem

DOI10.1287/opre.28.5.1086zbMath0447.90082OpenAlexW2141056356MaRDI QIDQ3893693

Paris C. Kanellakis, Christos H. Papadimitriou

Publication date: 1980

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.28.5.1086

zbMATH Keywords

computational resultsheuristic algorithmasymmetric traveling salesman problemLin-Kernighan local search algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Embedded local search approaches for routing optimization, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, An inexact algorithm for the sequential ordering problem, Optimization of the movements of a component placement machine, A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, A three-phase heuristic for the fairness-oriented crew rostering problem, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem, LS(graph): a constraint-based local search for constraint optimization on trees and paths, Travelling salesman problem tools for microcomputers, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, Implementation of a linear time algorithm for certain generalized traveling salesman problems, Ejection chain and filter-and-fan methods in combinatorial optimization, The traveling salesman problem: An overview of exact and approximate algorithms, Ejection chain and filter-and-fan methods in combinatorial optimization, Determination of the candidate arc set for the asymmetric traveling salesman problem, A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP, Heuristic methods and applications: A categorized survey, k-interchange procedures for local search in a precedence-constrained routing problem, A useful transform of standard input data for a classical NP-complete problem, Local search procedures for improving feasible solutions to the sequential ordering problem