A taxonomy of evolutionary algorithms in combinatorial optimization
From MaRDI portal
Recommendations
Cited in
(19)- A survey on metaheuristics for stochastic combinatorial optimization
- Decomposition, reformulation, and diving in university course timetabling
- New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
- A framework for the description of evolutionary algorithms
- A review of evolutionary algorithms in solving large scale benchmark optimisation problems
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Setup coordination between two stages of a production system: a multi-objective evolutionary approach
- An adaptive memory algorithm for the k-coloring problem
- An algebraic approach to population-based evolutionary algorithm generation
- Comparison of exact and approximate approaches to UAVs mission contingency planning in dynamic environments
- scientific article; zbMATH DE number 1728445 (Why is no real title available?)
- Hybrid metaheuristics: an introduction
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Graph coloring models and metaheuristics for packing applications
- scientific article; zbMATH DE number 2150402 (Why is no real title available?)
- scientific article; zbMATH DE number 2102024 (Why is no real title available?)
- Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index
- A unifying view on recombination spaces and abstract convex evolutionary search
- A unified framework for population-based metaheuristics
This page was built for publication: A taxonomy of evolutionary algorithms in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567871)
