Genetic local search in combinatorial optimization

Autor:	Erwin Pesch, Antoon W. J. Kolen
Rok vydání:	1994
Předmět:	Mathematical optimization business.industry Applied Mathematics Genetic algorithm Combinatorial optimization problem Discrete Mathematics and Combinatorics Combinatorial optimization Local search (optimization) business Travelling salesman problem Running time Mathematics
Zdroj:	Discrete Applied Mathematics. 48:273-284
ISSN:	0166-218X
DOI:	10.1016/0166-218x(92)00180-t
Popis:	The most common application of genetic algorithms to combinatorial optimization problems has been restricted to the traveling salesman problem. We review some of these ideas and present some new results, especially in the case that severe time constraints are imposed on the running time of the algorithm.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbdd2e1f1aebaf30a0380269f4ba0cc0 https://doi.org/10.1016/0166-218x(92)00180-t Zobrazit plný text záznamu