scientific article; zbMATH DE number 1754728

MaRDI QIDQ4535157zbMATH OpenFDO

Authors Víctor Robles, P. de Miguel, Pedro Larrañaga

Publication date 12 June 2002

zbMATH Keywords

estimation of distribution algorithmsheuristicsurveytraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Review text

At first the authors give a survey of well-known heuristic techniques used to solve the traveling salesman problem. Then they present a new approach using EDAs (Estimation of Distribution Algorithms) based on some learning methods, but in this reviev it is not possible to give further explanations. Also experimental results are given. For the entire collection see [Zbl 0979.00024].

Recommendations

• scientific article; zbMATH DE number 4104744
• Genetic algorithms for the traveling salesman problem
• The traveling salesman problem. Approximate algorithms
• Solving the traveling salesman problem using the enhanced genetic algorithm
• A new genetic algorithm applied to the traveling salesman problem

Cited in

(7)

• Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
• Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
• Edge histogram based sampling with local search for solving permutation problems
• Seeking global edges for traveling salesman problem in multi-start search
• Evolutionary algorithms for solving multi-objective travelling salesman problem
• A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
• Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem

This page was built for publication:

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