Analysing the run-time behaviour of iterated local search for the travelling salesman problem.

MaRDI QIDQ2776576zbMATH OpenFDO

Authors Thomas Stützle, Holger H. Hoos

Publication date 2002

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
• Efficiency of a local algorithm for solving the traveling salesman problem
• Sequential and parallel local search for the time-constrained traveling salesman problem
• An iterated local search for the traveling salesman problem with release dates and completion time minimization
• An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
• scientific article; zbMATH DE number 177832
• scientific article; zbMATH DE number 4131978

Cited in

(7)

• Efficiency of a local algorithm for solving the traveling salesman problem
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
• A probabilistic cooperative-competitive hierarchical model for global optimization
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Iterated local search for the quadratic assignment problem

This page was built for publication: Analysing the run-time behaviour of iterated local search for the travelling salesman problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776576)