Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
DOI10.1016/J.INS.2017.08.058zbMATH Open1436.90116OpenAlexW2747672495WikidataQ65555201 ScholiaQ65555201MaRDI QIDQ780956FDOQ780956
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
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
metaheuristic algorithmsgreedy randomized adaptive search proceduredynamic combinatorial optimizationmulti-dimensional knapsack problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Firefly Algorithms for Multimodal Optimization
- Greedy randomized adaptive search procedures
- Metaheuristics for dynamic combinatorial optimization problems
- A survey on combinatorial optimization in dynamic environments
- Title not available (Why is that?)
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
- An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
Cited In (6)
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
- 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
- MMAS versus population-based EA on a family of dynamic fitness functions
- Recent advances in selection hyper-heuristics
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
- The Use of Opposition for Decreasing Function Evaluations in Population-Based Search
Uses Software
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)
