A framework for the description of evolutionary algorithms
From MaRDI portal
Publication:1584807
DOI10.1016/S0377-2217(99)00435-XzbMath0970.90122OpenAlexW2070878875MaRDI QIDQ1584807
Publication date: 5 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00435-x
Related Items (19)
An optimization approach for ambulance location and the districting of the response segments on highways ⋮ Setup coordination between two stages of a production system: a multi-objective evolutionary approach ⋮ Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem ⋮ An effective new island model genetic algorithm for job shop scheduling problem ⋮ Hybrid Metaheuristics: An Introduction ⋮ A unified framework for population-based metaheuristics ⋮ A hypercube queueing model embedded into a genetic algorithm for ambulance deployment on highways ⋮ An adaptive memory algorithm for the \(k\)-coloring problem ⋮ New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem ⋮ Synergy between evolutionary optimization and induction graphs learning for simulated manufacturing systems ⋮ Solving the vehicle routing problem with adaptive memory programming methodology ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ Optimization and analysis aid via data-mining for simulated production systems ⋮ An adaptive memory programming method for risk logistics operations ⋮ Local search algorithms for the \(k\)-cardinality tree problem. ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ An artificial beehive algorithm for continuous optimization ⋮ Scheduling multiple variant programs under hard real-time constraints ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling subject to resource constraints: Classification and complexity
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- A genetic algorithm for the multidimensional knapsack problem
- A genetic algorithm for the set covering problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Genetic and hybrid algorithms for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Probabilistic diversification and intensification in local search for vehicle routing
- A taxonomy of evolutionary algorithms in combinatorial optimization
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Ants can colour graphs
- Outline for a Logical Theory of Adaptive Systems
This page was built for publication: A framework for the description of evolutionary algorithms
