An efficient genetic algorithm for single row facility layout

Autor:	Ravi Kothari, Diptesh Ghosh
Rok vydání:	2013
Předmět:	Mathematical optimization education.field_of_study Control and Optimization Computational complexity theory Computer science business.industry Population Computational intelligence Line (geometry) Genetic algorithm Benchmark (computing) Local search (optimization) business education Heuristics
Zdroj:	Optimization Letters. 8:679-690
ISSN:	1862-4480 1862-4472
DOI:	10.1007/s11590-012-0605-2
Popis:	The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to its computational complexity, researchers have developed several heuristics to obtain good quality solutions. In this paper, we present a genetic algorithm called GENALGO to solve large single row facility layout problem instances. Our algorithm uses standard genetic operators and periodically improves the fitness of all individuals. Our computational experiments show that our genetic algorithm yields high quality solutions in spite of starting with an initial population that is randomly generated. Our algorithm improves the previously best known solutions for the 19 instances of 58 benchmark instances and is competitive for most of the remaining ones.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e14dc623295a34cacc15fa8669eda4bd https://doi.org/10.1007/s11590-012-0605-2 Zobrazit plný text záznamu Full text from SpringerLink