A biased random-key genetic algorithm for the two-stage capacitated facility location problem

Biajoli, Fabrício Lacerda; Chaves, Antônio Augusto; Lorena, Luiz Antônio Nogueira

doi:10.1016/j.eswa.2018.08.024

Cited by 35 publications

(15 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Biajoli et al (2019) proposed a BRKGA to solve the SP-TSCFLP. The plants and depots to be opened were defined by the BRKGA while a local search procedure was employed to determine the product flow from plants to customers.…”

Section: Sp-tscflp-single Productmentioning

confidence: 99%

“…Litvinchev and Ozuna (2012) proposed a mathematical model for SP-TSCFLP. The same model was used by Rabello et al (2016) and Biajoli et al (2019). The model can be adapted for a multiproduct approach after some modifications.…”

Section: Mp-tscflp-multiple Productsmentioning

confidence: 99%

“…For the SP-TSCFLP, both CS and BRKGA outperformed other traditional metaheuristics such as genetic algorithm (GA) and tabu search (TS) (see Guo et al, 2017;Biajoli et al, 2019). Besides the SP-TSCFLP (Rabello et al, 2016), CS has been successfully applied to several other optimization problems such as cartographic label placement (Rabello et al, 2014;Guerine et al, 2020), job-shop scheduling (Bissoli et al, 2021), and traffic counting location (González et al, 2019).…”

Section: Introductionmentioning

confidence: 99%

“…Besides the SP-TSCFLP (Rabello et al, 2016), CS has been successfully applied to several other optimization problems such as cartographic label placement (Rabello et al, 2014;Guerine et al, 2020), job-shop scheduling (Bissoli et al, 2021), and traffic counting location (González et al, 2019). BRKGA has also been successfully applied to SP-TSCFLP (Biajoli et al, 2019) and other problems such as telecommunication (Resende, 2012), job-shop scheduling (Gonçalves and Resende, 2014), network planning (Andrade et al, 2015), hub location (Pessoa et al, 2017), load scheduling problem (Brandão et al, 2017), vehicle routing (Prasetyo et al, 2018), project scheduling problems (Almeida et al, 2018), and flowshop problem (Andrade et al, 2019).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem

Mauri

Biajoli

Rabello³

et al. 2020

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

This paper presents two hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem (MP-TSCFLP). In this problem, a set of different products must be transported from a set of plants to a set of intermediate depots (first stage) and from these depots to a set of customers (second stage). The objective is to minimize the cost related to open plants and depots plus the cost for transporting the products from the plants to the customers satisfying demand and capacity constraints. Recently, the methods clustering search (CS) and biased random-key genetic algorithm (BRKGA) were successfully applied to solve a singleproduct problem (SP-TSCFLP). Therefore, in this paper we propose adaptations and implementations of these methods for handling with a multiproduct approach. To the best of our knowledge, CS and BRKGA presented the best results for the SP-TSCFLP and both have not yet been applied to solve the problem with multiple products. Four sets of large-sized instances with different characteristics are proposed and computational experiments compare the obtained results to those from a commercial solver.

show abstract

Section: Sp-tscflp-single Productmentioning

confidence: 99%

Section: Mp-tscflp-multiple Productsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem

Mauri

Biajoli

Rabello³

et al. 2020

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then, we perform the genetic operation. Along with the coding principle of the genetic algorithm [43], this paper uses the integer arrangement coding method to construct the 0-1 programming mathematical model. The number of n candidates is 1, 2,..., n, and the chromosome is divided into n segments, with each segment corresponding to a person number, and the sequence of the number is the job matched to the person.…”

Section: Matching Modelling Based On Competency and Complexity Strengmentioning

confidence: 99%

Exploring the Optimal Safety Person–job Matching Method of Major Equipment Based on Human Reliability

Zhang

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

Under the background of intelligent manufacturing, this paper aims to develop a model for person–job safe matching that optimizes safety with consideration of major equipment operator competency and task complexity. Safe matching cost is minimized in the developed model and is measured by the equipment downtime, production defect rate, and operator labor costs oriented by human factors. Human reliability is calculated with the goal of best value individual competency and best admit task complexity with a hierarchical structure. The 0-1 integer programming person–job matching model minimizes the human factor safety and wage costs and satisfies the requirements of the production order, budget and operator quantity requirement. An improved genetic algorithm is designed to solve the model. The computational results of the proposed model based on a case study for a large iron and steel company evidently demonstrated its effectiveness. A new integrated model provides more realistic matches for person–job assignment.

show abstract

A Social Distancing-Based Facility Location Approach for Combating COVID-19

Banerjee

Pal

Singhamahapatra

2021

Computational Science and Its Applications – ICCSA 2021

View full text Add to dashboard Cite

A biased random-key genetic algorithm for the two-stage capacitated facility location problem

Cited by 35 publications

References 12 publications

Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem

Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem

Exploring the Optimal Safety Person–job Matching Method of Major Equipment Based on Human Reliability

A Social Distancing-Based Facility Location Approach for Combating COVID-19

Contact Info

Product

Resources

About