Metaheuristics for dynamic combinatorial optimization problems
From MaRDI portal
Publication:5413305
DOI10.1093/imaman/dps021zbMath1288.90135OpenAlexW2164616704MaRDI QIDQ5413305
Yong Jiang, Trung Thanh Nguyen, Shengxiang Yang
Publication date: 29 April 2014
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/dps021
metaheuristicsgenetic algorithmdynamic optimization problemant colony optimizationdynamic combinatorial optimization problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (5)
A computational study on ant colony optimization for the traveling salesman problem with dynamic demands ⋮ Analysis of fitness landscape modifications in evolutionary dynamic optimization ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization ⋮ Unnamed Item
This page was built for publication: Metaheuristics for dynamic combinatorial optimization problems
