Relaxed tours and path ejections for the traveling salesman problem

DOI10.1016/S0377-2217(97)00288-9zbMath0991.90104MaRDI QIDQ1609913

César Rego

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

tabu searchtraveling salesman problemejection chains

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)

Related Items (18)

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ Embedded local search approaches for routing optimization ⋮ Data structures and ejection chains for solving large-scale traveling salesman problems ⋮ A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ Multi-objective meta-heuristics for the traveling salesman problem with profits ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A \(k\)-level data structure for large-scale traveling salesman problems ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A filter-and-fan approach to the job shop scheduling problem ⋮ A columnar competitive model for solving multi-traveling salesman problem ⋮ A survey of very large-scale neighborhood search techniques ⋮ A simple filter-and-fan approach to the facility location problem ⋮ The traveling salesman problem: new polynomial approximation algorithms and domination analysis ⋮ An ejection chain algorithm for the quadratic assignment problem ⋮ An Efficient Genetic Algorithm for the Traveling Salesman Problem ⋮ A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP ⋮ Implementation analysis of efficient heuristic algorithms for the traveling salesman problem

Uses Software

• TSPLIB
• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modified Lin--Kernighan traveling-salesman heuristic
• Solution of large-scale symmetric travelling salesman problems
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• The vehicle routing problem: An overview of exact and approximate algorithms
• The traveling salesman. Computational solutions for RSP applications
• Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
• Tabu search for the multilevel generalized assignment problem
• Covers and packings in a family of sets
• TSPLIB—A Traveling Salesman Problem Library
• Fast Clustering Algorithms
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• Paths, Trees, and Flowers
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Relaxed tours and path ejections for the traveling salesman problem