A biased random-key genetic algorithm for the two-stage capacitated facility location problem
Lacerda, Fabrício Biajoli [UNIFESP]
Chaves, Antônio Augusto [UNIFESP]
Lorena, Luiz Antonio Nogueira [UNIFESP]
MetadataShow full item record
This paper presents a new metaheuristic approach for the two-stage capacitated facility location problem (TSCFLP), which the objective is to minimize the operation costs of the underlying two-stage transportation system, satisfying demand and capacity constraints. In this problem, a single product must be transported from a set of plants to meet customers demands passing out by intermediate depots. Since this problem is known to be NP-hard, approximated methods become an efficient alternative to solve real-industry problems. As far as we know, the TSCFLP is being solved in most cases by hybrid approaches supported by an exact method, and sometimes a commercial solver is used for this purpose. Bearing this in mind, a BRKGA metaheuristic and a new local search for TSCFLP are proposed. It is the first time that BRKGA had been applied to this problem and the computational results show the competitiveness of the approach developed in terms of quality of the solutions and required computational time when compared with those obtained by state-of-the-art heuristics. The approach proposed can be easily coupled in intelligent systems to help organizations enhance competitiveness by optimally placing facilities in order to minimize operational costs.
CitationBIAJOLI, Fabrício Lacerda ; CHAVES, Antônio Augusto ; LORENA, Luiz Antonio Nogueira . A biased random-key genetic algorithm for the two-stage capacitated facility location problem. EXPERT SYSTEMS WITH APPLICATIONS, v. 115, p. 418-426, 2019.
KeywordsTwo-stage capacitated facility location
Biased random-key genetic algorithm
SponsorshipCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
- ICT - Artigos