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

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 worksh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International transactions in operational research 2024-11, Vol.31 (6), p.4025-4067
Hauptverfasser: Polino, Sahori, Camacho‐Vallejo, José‐Fernando, Villegas, Juan G.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 4067
container_issue 6
container_start_page 4025
container_title International transactions in operational research
container_volume 31
creator Polino, Sahori
Camacho‐Vallejo, José‐Fernando
Villegas, Juan G.
description 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.
doi_str_mv 10.1111/itor.13368
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3069552812</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3069552812</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3538-e6c81851c40a7edce50b5359a2b9f120754ebdcd56d55534e02d4fde9b9b8b493</originalsourceid><addsrcrecordid>eNp90N9KwzAUBvAgCs7pjU8Q8E7oTJqmTbwb4p_BYCDzuqTpqcvMmpq0zt35CD6jT2JnBe_MxcnNj-9wPoTOKZnQ_l2Z1vkJZSwVB2hEk4xHTEp-iEZEpjJKCU2P0UkIa0II5TQboWqKK6WNNe0OW6dVa1yNG-8KCxtcOY_hvfVKd94b3Vnl8db5l7ByDW6sqmtTP1_jwnx9fFp4A4s3ruynqku8gVatoPMmtEaHU3RUKRvg7Pcfo6e72-XNQzRf3M9upvNIM85EBKkWVHCqE6IyKDVwUnDGpYoLWdGYZDyBotQlT0vOOUuAxGVSlSALWYgikWyMLobc_oTXDkKbr13n635lzkgqOY8FjXt1OSjtXQgeqrzxZqP8Lqck3_eY73vMf3rsMR4waFeb8EeFFAmjJNsTOpCtsbD7JyyfLRePQ-w3cuODBw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3069552812</pqid></control><display><type>article</type><title>A facility location problem for extracurricular workshop planning: bi‐level model and metaheuristics</title><source>Access via Wiley Online Library</source><creator>Polino, Sahori ; Camacho‐Vallejo, José‐Fernando ; Villegas, Juan G.</creator><creatorcontrib>Polino, Sahori ; Camacho‐Vallejo, José‐Fernando ; Villegas, Juan G.</creatorcontrib><description>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.</description><identifier>ISSN: 0969-6016</identifier><identifier>EISSN: 1475-3995</identifier><identifier>DOI: 10.1111/itor.13368</identifier><language>eng</language><publisher>Oxford: Blackwell Publishing Ltd</publisher><subject>bi‐level programming ; Cost allocation ; education for sustainable development ; educational planning ; Elementary school students ; facility location ; Heuristic methods ; iterated local search ; NGOs ; Nongovernmental organizations ; path‐relinking ; Site selection ; Upper bounds ; Workshops</subject><ispartof>International transactions in operational research, 2024-11, Vol.31 (6), p.4025-4067</ispartof><rights>2023 International Federation of Operational Research Societies.</rights><rights>2024 The Authors.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c3538-e6c81851c40a7edce50b5359a2b9f120754ebdcd56d55534e02d4fde9b9b8b493</cites><orcidid>0000-0001-6519-7690</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fitor.13368$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fitor.13368$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Polino, Sahori</creatorcontrib><creatorcontrib>Camacho‐Vallejo, José‐Fernando</creatorcontrib><creatorcontrib>Villegas, Juan G.</creatorcontrib><title>A facility location problem for extracurricular workshop planning: bi‐level model and metaheuristics</title><title>International transactions in operational research</title><description>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.</description><subject>bi‐level programming</subject><subject>Cost allocation</subject><subject>education for sustainable development</subject><subject>educational planning</subject><subject>Elementary school students</subject><subject>facility location</subject><subject>Heuristic methods</subject><subject>iterated local search</subject><subject>NGOs</subject><subject>Nongovernmental organizations</subject><subject>path‐relinking</subject><subject>Site selection</subject><subject>Upper bounds</subject><subject>Workshops</subject><issn>0969-6016</issn><issn>1475-3995</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp90N9KwzAUBvAgCs7pjU8Q8E7oTJqmTbwb4p_BYCDzuqTpqcvMmpq0zt35CD6jT2JnBe_MxcnNj-9wPoTOKZnQ_l2Z1vkJZSwVB2hEk4xHTEp-iEZEpjJKCU2P0UkIa0II5TQboWqKK6WNNe0OW6dVa1yNG-8KCxtcOY_hvfVKd94b3Vnl8db5l7ByDW6sqmtTP1_jwnx9fFp4A4s3ruynqku8gVatoPMmtEaHU3RUKRvg7Pcfo6e72-XNQzRf3M9upvNIM85EBKkWVHCqE6IyKDVwUnDGpYoLWdGYZDyBotQlT0vOOUuAxGVSlSALWYgikWyMLobc_oTXDkKbr13n635lzkgqOY8FjXt1OSjtXQgeqrzxZqP8Lqck3_eY73vMf3rsMR4waFeb8EeFFAmjJNsTOpCtsbD7JyyfLRePQ-w3cuODBw</recordid><startdate>202411</startdate><enddate>202411</enddate><creator>Polino, Sahori</creator><creator>Camacho‐Vallejo, José‐Fernando</creator><creator>Villegas, Juan G.</creator><general>Blackwell Publishing Ltd</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-6519-7690</orcidid></search><sort><creationdate>202411</creationdate><title>A facility location problem for extracurricular workshop planning: bi‐level model and metaheuristics</title><author>Polino, Sahori ; Camacho‐Vallejo, José‐Fernando ; Villegas, Juan G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3538-e6c81851c40a7edce50b5359a2b9f120754ebdcd56d55534e02d4fde9b9b8b493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>bi‐level programming</topic><topic>Cost allocation</topic><topic>education for sustainable development</topic><topic>educational planning</topic><topic>Elementary school students</topic><topic>facility location</topic><topic>Heuristic methods</topic><topic>iterated local search</topic><topic>NGOs</topic><topic>Nongovernmental organizations</topic><topic>path‐relinking</topic><topic>Site selection</topic><topic>Upper bounds</topic><topic>Workshops</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Polino, Sahori</creatorcontrib><creatorcontrib>Camacho‐Vallejo, José‐Fernando</creatorcontrib><creatorcontrib>Villegas, Juan G.</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International transactions in operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Polino, Sahori</au><au>Camacho‐Vallejo, José‐Fernando</au><au>Villegas, Juan G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A facility location problem for extracurricular workshop planning: bi‐level model and metaheuristics</atitle><jtitle>International transactions in operational research</jtitle><date>2024-11</date><risdate>2024</risdate><volume>31</volume><issue>6</issue><spage>4025</spage><epage>4067</epage><pages>4025-4067</pages><issn>0969-6016</issn><eissn>1475-3995</eissn><abstract>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.</abstract><cop>Oxford</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/itor.13368</doi><tpages>43</tpages><orcidid>https://orcid.org/0000-0001-6519-7690</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0969-6016
ispartof International transactions in operational research, 2024-11, Vol.31 (6), p.4025-4067
issn 0969-6016
1475-3995
language eng
recordid cdi_proquest_journals_3069552812
source Access via Wiley Online Library
subjects bi‐level programming
Cost allocation
education for sustainable development
educational planning
Elementary school students
facility location
Heuristic methods
iterated local search
NGOs
Nongovernmental organizations
path‐relinking
Site selection
Upper bounds
Workshops
title A facility location problem for extracurricular workshop planning: bi‐level model and metaheuristics
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T00%3A42%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20facility%20location%20problem%20for%20extracurricular%20workshop%20planning:%20bi%E2%80%90level%20model%20and%20metaheuristics&rft.jtitle=International%20transactions%20in%20operational%20research&rft.au=Polino,%20Sahori&rft.date=2024-11&rft.volume=31&rft.issue=6&rft.spage=4025&rft.epage=4067&rft.pages=4025-4067&rft.issn=0969-6016&rft.eissn=1475-3995&rft_id=info:doi/10.1111/itor.13368&rft_dat=%3Cproquest_cross%3E3069552812%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3069552812&rft_id=info:pmid/&rfr_iscdi=true