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

DOI10.1016/j.ins.2017.08.058zbMath1436.90116OpenAlexW2747672495WikidataQ65555201 ScholiaQ65555201MaRDI QIDQ780956

Fehmi Burcin Ozsoydan, Adil Baykasoǧlu

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)

Related Items (2)

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

Uses Software

• WCA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy randomized adaptive search procedures
• 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
• Metaheuristics for dynamic combinatorial optimization problems

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