Paralell evolution heuristic approach for the traveling salesman problem

zbMATH Open1088.65539MaRDI QIDQ3371201FDOQ3371201

Authors: Wojciech Bożejko, Mieczysław Wodecki 

Publication date: 21 February 2006

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

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)

Cited In (8)

• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• Computational Science - ICCS 2004
• Title not available (Why is that?)
• Using 2-Opt based evolution strategy for travelling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Divide and conquer strategies for parallel TSP heuristics
• A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

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)