Single row facility layout problem using a permutation-based genetic algorithm

Abstract : In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2011, 213 (2), pp.388-394. 〈http://www.sciencedirect.com/science/article/pii/S0377221711002712〉. 〈10.1016/j.ejor.2011.03.034〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00602168
Contributeur : Jose Rui Figueira <>
Soumis le : mardi 21 juin 2011 - 16:36:46
Dernière modification le : jeudi 11 janvier 2018 - 06:21:48

Identifiants

Collections

Citation

José Rui Figueira, Dilip Datta, André R.S Amaral. Single row facility layout problem using a permutation-based genetic algorithm. European Journal of Operational Research, Elsevier, 2011, 213 (2), pp.388-394. 〈http://www.sciencedirect.com/science/article/pii/S0377221711002712〉. 〈10.1016/j.ejor.2011.03.034〉. 〈inria-00602168〉

Partager

Métriques

Consultations de la notice

96