A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics

被引:5
作者
Polino, Sahori [1 ]
Camacho-Vallejo, Jose-Fernando [2 ]
Villegas, Juan G. [3 ]
机构
[1] Univ Autonoma Nuevo Leon, Fac Ciencias Fisico Matemat, Ave Univ S-N, San Nicolas De Los Garza 66450, Nuevo Leon, Mexico
[2] Escuela Ingn & Ciencias, Tecnol Monterrey, Ave Eugenio Garza Sada 2501 Sur, Monterrey 64849, Nuevo Leon, Mexico
[3] Univ Antioquia, Dept Ind Engn, ALIADO Analyt & Res Decis Making, Calle 67 53-108, Medellin 050010, Colombia
关键词
facility location; bi-level programming; path-relinking; iterated local search; educational planning; education for sustainable development; SCHOOL LOCATION; PATH-RELINKING; ALGORITHM; DESIGN; GRASP;
D O I
10.1111/itor.13368
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a facility location problem with capacitated multiservice facilities in which the allocation of the users is based on their preferences. The problem arises from an educational program, where a government agency or a nongovernmental organization (NGO) offers extracurricular workshops to elementary school students. These workshops promote the development of academic, social, or cultural skills of the students. This problem is formulated as a bi-level program. The government/NGO is associated with the upper level, which aims to minimize the costs for opening workshops in different schools and the costs of allocating students to each workshop. The lower level is related to the students and seeks to optimize their global preferences for the offered workshops. To solve this problem, we propose a single-level reformulation and two metaheuristics (a path-relinking metaheuristic (PRM) and an iterated local search (ILS) procedure). The best performing method is the PRM that generates saturated initial random solutions following a drop heuristic approach. After different phases of improvement (with drop and exchange heuristics), the solutions undergo a path-relinking procedure. The trajectory between the initial solution and the best solution found so far is explored using a randomized backward path-relinking strategy that thoroughly explores the neighborhood of the best solution. Computational experimentation indicates that the proposed PRM metaheuristic is effective and efficient. The results obtained provide better upper bounds in shorter running times than the ones obtained by the single-level reformulation or the ILS procedure. Finally, the application to a realistic case study of Apodaca municipality in Nuevo Leon, Mexico, shows that large-scale instances can be solved efficiently using the proposed metaheuristic.
引用
收藏
页码:4025 / 4067
页数:43
相关论文
共 75 条
[1]   Scatter search with path relinking for multiprocessor open shop scheduling [J].
Abdelmaguid, Tamer F. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 141 (141)
[2]  
[Anonymous], 2014, P JADT
[3]  
[Anonymous], A New Learning Agenda for the realization of SDG 4 in MENA
[4]  
Aras N, 2017, SPRINGER OPTIM APPL, V118, P1, DOI 10.1007/978-3-319-52654-6_1
[5]  
Armas Jesica, 2018, Applied Mathematics and Computational Intelligence. Advances in Intelligent Systems and Computing (AISC 730), P287, DOI 10.1007/978-3-319-75792-6_22
[6]  
Baeyens An, 2015, Eur J Health Law, V22, P508
[7]  
Beech J., 2019, CLOSING EXTRACURRICU, P1
[8]  
Burkhardt R., 2016, THESIS GOUCHER COLL
[9]   A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences [J].
Calvete, Herminia, I ;
Gale, Carmen ;
Iranzo, Jose A. ;
Camacho-Vallejo, Jose-Fernando ;
Casas-Ramirez, Martha-Selene .
COMPUTERS & OPERATIONS RESEARCH, 2020, 124
[10]   The rank pricing problem: Models and branch-and-cut algorithms [J].
Calvete, Herminia, I ;
Dominguez, Concepcion ;
Gale, Carmen ;
Labbe, Martine ;
Marin, Alfredo .
COMPUTERS & OPERATIONS RESEARCH, 2019, 105 :12-31