Paralell evolution heuristic approach for the traveling salesman problem

MaRDI QIDQ3371201zbMATH OpenFDO

Authors Wojciech Bożejko, Mieczysław Wodecki

Publication date 21 February 2006

zbMATH Keywords

optimizationsimulated annealingmetaheuristicsparallel algorithmgenetic algorithmtraveling salesman problemtabu searchNP-complete problemsheuristic algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 5300053
• scientific article; zbMATH DE number 1304530
• scientific article; zbMATH DE number 4093206
• The parallel complexity of TSP heuristics
• Divide and conquer strategies for parallel TSP heuristics

Cited in

(8)

• Computational Science - ICCS 2004
• Using 2-Opt based evolution strategy for travelling salesman problem
• Divide and conquer strategies for parallel TSP heuristics
• scientific article; zbMATH DE number 2078921 (Why is no real title available?)
• scientific article; zbMATH DE number 5300053 (Why is no real title available?)
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• scientific article; zbMATH DE number 1703862 (Why is no real title available?)
• A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Paralell evolution heuristic approach for the traveling salesman problem

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