scientific article; zbMATH DE number 2158374

MaRDI QIDQ4668203zbMATH OpenFDO

Authors Laurenţiu Rudeanu, Mitică Craus

Publication date 18 April 2005

zbMATH Keywords

frameworkmessage passing interfaceparallel algorithms

Mathematics Subject Classification ID

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

Recommendations

• A parallel implementation of ant colony optimization.
• Using the ant colony algorithm and the simulated annealing parallel algorithm to solve the traveling salesman problem
• scientific article; zbMATH DE number 1304530
• An ant colony algorithm based on clustering and partition optimization
• A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem

Cited in

(10)

• Solving large batches of traveling salesman problems with parallel and distributed computing
• A parallel implementation of ant colony optimization.
• Using the ant colony algorithm and the simulated annealing parallel algorithm to solve the traveling salesman problem
• A parallel ant colony optimization algorithm based on fine-grained model with GPU-accelerated
• Distributed multi-agent system for solving traveling salesman problem using ant colony optimization
• scientific article; zbMATH DE number 4174699 (Why is no real title available?)
• Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study
• PNACO: parallel algorithm for neighbour joining hybridized with ant colony optimization on multi-core system
• Parallel max-min ant system based on heterogeneous platform
• A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman 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 Q4668203)