A taxonomy of evolutionary algorithms in combinatorial optimization
From MaRDI portal
Publication:2567871
DOI10.1023/A:1009625526657zbMath1071.90572OpenAlexW2129527459MaRDI QIDQ2567871
Pierre Kuonen, Giovanni Coray, Patrice Calégari, Alain Hertz
Publication date: 13 October 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009625526657
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (11)
Setup coordination between two stages of a production system: a multi-objective evolutionary approach ⋮ Hybrid Metaheuristics: An Introduction ⋮ Comparison of exact and approximate approaches to UAVs mission contingency planning in dynamic environments ⋮ A unified framework for population-based metaheuristics ⋮ Graph Coloring Models and Metaheuristics for Packing Applications ⋮ An adaptive memory algorithm for the \(k\)-coloring problem ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ A framework for the description of evolutionary algorithms ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
This page was built for publication: A taxonomy of evolutionary algorithms in combinatorial optimization
