A framework for the description of evolutionary algorithms
type: Item
instance of: scholarly article
title: A framework for the description of evolutionary algorithms
zbMATH Open document ID: 0970.90122
DOI: 10.1016/S0377-2217(99)00435-X
author: Alain Hertz
author: Daniel Kobler
published in: European Journal of Operational Research
publication date: 2000-11-05T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1525573
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: optimisation
zbMATH Keywords: population-based methods
describes a project that uses: GIDEON
MaRDI profile type: Publication
cites work: A genetic algorithm for the set covering problem
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Q4023677
cites work: A taxonomy of evolutionary algorithms in combinatorial optimization
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Q4319398
cites work: Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
cites work: Ants can colour graphs
cites work: Genetic and hybrid algorithms for graph coloring
cites work: Q5527536
cites work: Q4692508
cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Outline for a Logical Theory of Adaptive Systems
cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
cites work: Probabilistic diversification and intensification in local search for vehicle routing
full work available at URL: s0377-2217(99)00435-x
OpenAlex ID: W2070878875
description: scientific article; zbMATH DE number 1525573