MMAS versus population-based EA on a family of dynamic fitness functions
From MaRDI portal
Publication:306495
DOI10.1007/S00453-015-9975-ZzbMath1350.68249DBLPjournals/algorithmica/LissovoiW16OpenAlexW2145942149WikidataQ57200576 ScholiaQ57200576MaRDI QIDQ306495
Publication date: 31 August 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://backend.orbit.dtu.dk/ws/files/127386457/maze_algorithmica.pdf
Related Items (6)
A runtime analysis of parallel evolutionary algorithms in dynamic optimization ⋮ Populations can be essential in tracking dynamic optima ⋮ MMAS versus population-based EA on a family of dynamic fitness functions ⋮ Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function ⋮ The impact of a sparse migration topology on the runtime of island models in dynamic optimization ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MMAS versus population-based EA on a family of dynamic fitness functions
- Metaheuristics for bi-level optimization
- Running time analysis of ant colony optimization for shortest path problems
- Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Using markov-chain mixing time estimates for the analysis of ant colony optimization
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
This page was built for publication: MMAS versus population-based EA on a family of dynamic fitness functions
