Savings based ant colony optimization for the capacitated minimum spanning tree problem

DOI10.1016/J.COR.2004.11.019MaRDI QIDQ2581619zbMATH OpenOpenAlexFDO

Authors Marc Reimann, Marco Laumanns

Publication date 10 January 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.11.019

zbMATH Keywords

Ant colony OptimizationCapacitated minimum spanning tree problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 2090612
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• Heuristics for the multi-level capacitated minimum spanning tree problem
• A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems

Cites work

• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• A new rank based version of the ant system. -- A computational study
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• ACO algorithms with guaranteed convergence to the optimal solution
• Ant colony optimization.
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1488087 (Why is no real title available?)
• scientific article; zbMATH DE number 1420487 (Why is no real title available?)
• scientific article; zbMATH DE number 3026527 (Why is no real title available?)
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Topological design of centralized computer networks—formulations and algorithms
• Topological design of telecommunication networks --- local access design methods
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs

Cited in

(10)

• Design of capacitated degree constrained min-sum arborescence
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
• Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
• A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• ACS-TS: Train scheduling using ant colony system
• Ant colony pattern search algorithms for unconstrained and bound constrained optimization

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Savings based ant colony optimization for the capacitated minimum spanning tree problem

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