Optimization by ant algorithms: possible roles for an individual ant
From MaRDI portal
Publication:1758036
DOI10.1007/s11590-011-0327-xzbMath1254.90308OpenAlexW2083951772MaRDI QIDQ1758036
Publication date: 7 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0327-x
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Design of a quality control network for an international food company ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Metaheuristics for truck loading in the car production industry ⋮ A time-based pheromone approach for the ant system ⋮ Improving the extraction and expansion method for large graph coloring
Cites Work
- Unnamed Item
- The oracle penalty method
- A memetic algorithm for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A Metaheuristic Approach for the Vertex Coloring Problem
- A survey on vertex coloring problems
- Ant Local Search and its efficient adaptation to graph colouring
- Ants can colour graphs
This page was built for publication: Optimization by ant algorithms: possible roles for an individual ant
