ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
From MaRDI portal
Publication:2359156
DOI10.1007/s10732-013-9228-8zbMath1365.90008OpenAlexW2015662972MaRDI QIDQ2359156
Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Verel, Jérémie Humeau
Publication date: 27 June 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-013-9228-8
local searchmetaheuristicfitness landscapessoftware frameworkalgorithm design and analysisconceptual unified model
Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Distributed localized bi-objective search ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ ParadisEO-MOEO ⋮ EasyAnalyzer
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Parameter setting in evolutionary algorithms.
- Adaptive evolution on neutral networks
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Parallel and distributed local search in COMET
- A probabilistic heuristic for a computationally difficult set covering problem
- Global optimization and simulated annealing
- A parallel adaptive tabu search approach
- The noising method: A new method for combinatorial optimization
- Variable neighborhood search
- Experiments with new stochastic global optimization search techniques
- The min-conflict packing problem
- Greedy randomized adaptive search procedures
- Guided local search and its application to the traveling salesman problem
- Semi-greedy heuristics: An empirical study
- Future paths for integer programming and links to artificial intelligence
- Optimization software class libraries
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- ParamILS: An Automatic Algorithm Configuration Framework
- Artificial Evolution
- Neutrality in fitness landscapes.
- Lectures on Monte Carlo methods
