Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9384-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025746323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of the \((1+1)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in memetic algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real royal road functions -- where crossover provably is essential / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Metropolis algorithm for graph bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on the use of ``self-generation'' in memetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization and local search for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum cuts by randomized search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified drift analysis for proving lower bounds in evolutionary computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of parametrization in memetic evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank

Latest revision as of 22:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
scientific article

    Statements

    Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (English)
    0 references
    0 references
    0 references
    30 March 2011
    0 references
    0 references
    evolutionary algorithms
    0 references
    hybridization
    0 references
    iterated local search
    0 references
    memetic algorithms
    0 references
    simulated annealing
    0 references
    runtime analysis
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references