Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization

DOI10.1016/J.INS.2017.08.058MaRDI QIDQ780956zbMATH OpenOpenAlexWikidataFDO

Authors Adil Baykasoğlu, Fehmi Burcin Ozsoydan

Publication date 16 July 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2017.08.058

zbMATH Keywords

metaheuristic algorithmsgreedy randomized adaptive search proceduredynamic combinatorial optimizationmulti-dimensional knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Survey on dynamic optimization algorithms
• Evolutionary algorithms in dynamic environments
• Using competitive population evaluation in a differential evolution algorithm for dynamic environments
• Metaheuristics for dynamic combinatorial optimization problems
• A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem

Cites work

• scientific article; zbMATH DE number 2046112 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
• A survey on combinatorial optimization in dynamic environments
• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
• Firefly Algorithms for Multimodal Optimization
• Greedy randomized adaptive search procedures
• Metaheuristics for dynamic combinatorial optimization problems

Cited in

(6)

• The Use of Opposition for Decreasing Function Evaluations in Population-Based Search
• Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant
• Recent advances in selection hyper-heuristics
• Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
• MMAS versus population-based EA on a family of dynamic fitness functions
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic

Describes a project that uses

Uses Software

• WCA

This page was built for publication: Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization

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