Evolution strategies for solving discrete optimization problems

Cai, JB

doi:10.1016/0965-9978(95)00104-2

Return

Evolution strategies for solving discrete optimization problems

1996-03-01

PRE

Cai, JB *

Thierauf, G

DOI：10.1016/0965-9978(95)00104-2

Original

Original request for help

Save

Abstract

En 中文

A method to solve discrete optimization problems using evolution strategies (ESs) is described. The ESs imitate biological evolution in nature and have two characteristics that differ from other conventional optimization algorithms: (a) ESs use randomized operators instead of the usual deterministic ones; (b) instead of a single design point, the ESs work simultaneously with a population of design points in the space of variables. The important operators of ESs are mutation, selection and recombination. The ESs are commonly applied for continuous optimization problems. For the application to discrete problems, several modifications on the operators mutation and recombination are suggested here. Several examples from the literature are solved with this modified ES and the results compared. The examples show that the modified ES is robust and suitable for discrete optimization problems. Copyright (C) 1996 Civil-Comp Limited and Elsevier Science Limited.

Keywords:

evolution strategies

discrete optimization problems

genetic algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.