Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
From MaRDI portal
Publication:5284220
DOI10.1287/ijoc.8.2.125zbMath0866.90130OpenAlexW2125350144MaRDI QIDQ5284220
Luciano Margara, Giovanni Manzini, Bruno Codenotti, Giovanni Resta
Publication date: 6 July 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/97d5bb1ec0f263ac83c5284d9e8f4275cc24e775
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06)
Related Items
Embedded local search approaches for routing optimization, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, Iterated local search for consecutive block minimization, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, Using regression models to understand the impact of route-length variability in practical vehicle routing, Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates, Two-phase Pareto local search for the biobjective traveling salesman problem, Fast and high precision algorithms for optimization in large-scale genomic problems, A Neural-Network-Based Approach to the Double Traveling Salesman Problem, The Travelling Salesman Problem for finite-sized cities, Guided local search and its application to the traveling salesman problem, Perturbation heuristics for the pickup and delivery traveling salesman problem
