The location routing problem with facility sizing decisions
The location routing problem (LRP) integrates operational decisions on vehicle routing operations with strategic decisions on the location of the facilities or depots from which the distribution will take place. In other words, it combines the well‐known vehicle routing problem (VRP) with the facili...
Gespeichert in:
| Veröffentlicht in: | International transactions in operational research 2023-03, Vol.30 (2), p.915-945 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 945 |
|---|---|
| container_issue | 2 |
| container_start_page | 915 |
| container_title | International transactions in operational research |
| container_volume | 30 |
| creator | Tordecilla, Rafael D. Montoya‐Torres, Jairo R. Quintero‐Araujo, Carlos L. Panadero, Javier Juan, Angel A. |
| description | The location routing problem (LRP) integrates operational decisions on vehicle routing operations with strategic decisions on the location of the facilities or depots from which the distribution will take place. In other words, it combines the well‐known vehicle routing problem (VRP) with the facility location problem (FLP). Hence, the LRP is an NP‐hard combinatorial optimization problem, which justifies the use of metaheuristic approaches whenever large‐scale instances need to be solved. In this paper, we explore a realistic version of the LRP in which facilities of different capacities are considered, i.e., the manager has to consider not only the location but also the size of the facilities to open. In order to tackle this optimization problem, three mixed‐integer linear formulations are proposed and compared. As expected, they have been proved to be cost‐ and time‐ inefficient. Hence, a biased‐randomized iterated local search algorithm is proposed. Classical instances for the LRP with homogeneous facilities are naturally extended to test the performance of our approach. |
| doi_str_mv | 10.1111/itor.13125 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2723015968</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2723015968</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3625-8f26adf248f9c23619c201b670a537b52edab3fc45a64d43c8e07f23b86de5fe3</originalsourceid><addsrcrecordid>eNp90E1LwzAcBvAgCs7pxU8Q8CZ05qVJGjzJcDoYDGSeQ5omLqNrZtIx5qc3s4I3c0gO-fHknweAW4wmOK8H34c4wRQTdgZGuBSsoFKyczBCksuCI8wvwVVKG4QQZliMwONqbWEbjO596GAM-953H3AXQ93aLTz4fg2dNr71_REm_3W6bKzxKet0DS6cbpO9-T3H4H32vJq-Fovly3z6tCgM5YQVlSNcN46UlZOGUI7zjnDNBdKMipoR2-iaOlMyzcumpKaySDhC64o3ljlLx-BuyM1jfe5t6tUm7GOXn1REEJp_InmV1f2gTAwpRevULvqtjkeFkTqVo07lqJ9yMoYDtiZ0Pv3RiiBeCi5JJnggB9_a4z9har5avg2x326ucW8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2723015968</pqid></control><display><type>article</type><title>The location routing problem with facility sizing decisions</title><source>Wiley Online Library - AutoHoldings Journals</source><source>EBSCOhost Business Source Complete</source><creator>Tordecilla, Rafael D. ; Montoya‐Torres, Jairo R. ; Quintero‐Araujo, Carlos L. ; Panadero, Javier ; Juan, Angel A.</creator><creatorcontrib>Tordecilla, Rafael D. ; Montoya‐Torres, Jairo R. ; Quintero‐Araujo, Carlos L. ; Panadero, Javier ; Juan, Angel A.</creatorcontrib><description>The location routing problem (LRP) integrates operational decisions on vehicle routing operations with strategic decisions on the location of the facilities or depots from which the distribution will take place. In other words, it combines the well‐known vehicle routing problem (VRP) with the facility location problem (FLP). Hence, the LRP is an NP‐hard combinatorial optimization problem, which justifies the use of metaheuristic approaches whenever large‐scale instances need to be solved. In this paper, we explore a realistic version of the LRP in which facilities of different capacities are considered, i.e., the manager has to consider not only the location but also the size of the facilities to open. In order to tackle this optimization problem, three mixed‐integer linear formulations are proposed and compared. As expected, they have been proved to be cost‐ and time‐ inefficient. Hence, a biased‐randomized iterated local search algorithm is proposed. Classical instances for the LRP with homogeneous facilities are naturally extended to test the performance of our approach.</description><identifier>ISSN: 0969-6016</identifier><identifier>EISSN: 1475-3995</identifier><identifier>DOI: 10.1111/itor.13125</identifier><language>eng</language><publisher>Oxford: Blackwell Publishing Ltd</publisher><subject>biased randomization ; Combinatorial analysis ; Decisions ; heterogeneous facilities ; Heuristic methods ; location routing problem ; metaheuristics ; Operations research ; Optimization ; Route planning ; Search algorithms ; Site selection ; Vehicle routing</subject><ispartof>International transactions in operational research, 2023-03, Vol.30 (2), p.915-945</ispartof><rights>2022 The Authors. published by John Wiley & Sons Ltd on behalf of International Federation of Operational Research Societies</rights><rights>2022. This article is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3625-8f26adf248f9c23619c201b670a537b52edab3fc45a64d43c8e07f23b86de5fe3</citedby><cites>FETCH-LOGICAL-c3625-8f26adf248f9c23619c201b670a537b52edab3fc45a64d43c8e07f23b86de5fe3</cites><orcidid>0000-0003-3028-1686 ; 0000-0001-8563-4456 ; 0000-0002-6251-3667 ; 0000-0002-3793-3328 ; 0000-0003-1392-1776</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.13125$$EPDF$$P50$$Gwiley$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fitor.13125$$EHTML$$P50$$Gwiley$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Tordecilla, Rafael D.</creatorcontrib><creatorcontrib>Montoya‐Torres, Jairo R.</creatorcontrib><creatorcontrib>Quintero‐Araujo, Carlos L.</creatorcontrib><creatorcontrib>Panadero, Javier</creatorcontrib><creatorcontrib>Juan, Angel A.</creatorcontrib><title>The location routing problem with facility sizing decisions</title><title>International transactions in operational research</title><description>The location routing problem (LRP) integrates operational decisions on vehicle routing operations with strategic decisions on the location of the facilities or depots from which the distribution will take place. In other words, it combines the well‐known vehicle routing problem (VRP) with the facility location problem (FLP). Hence, the LRP is an NP‐hard combinatorial optimization problem, which justifies the use of metaheuristic approaches whenever large‐scale instances need to be solved. In this paper, we explore a realistic version of the LRP in which facilities of different capacities are considered, i.e., the manager has to consider not only the location but also the size of the facilities to open. In order to tackle this optimization problem, three mixed‐integer linear formulations are proposed and compared. As expected, they have been proved to be cost‐ and time‐ inefficient. Hence, a biased‐randomized iterated local search algorithm is proposed. Classical instances for the LRP with homogeneous facilities are naturally extended to test the performance of our approach.</description><subject>biased randomization</subject><subject>Combinatorial analysis</subject><subject>Decisions</subject><subject>heterogeneous facilities</subject><subject>Heuristic methods</subject><subject>location routing problem</subject><subject>metaheuristics</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Route planning</subject><subject>Search algorithms</subject><subject>Site selection</subject><subject>Vehicle routing</subject><issn>0969-6016</issn><issn>1475-3995</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>24P</sourceid><sourceid>WIN</sourceid><recordid>eNp90E1LwzAcBvAgCs7pxU8Q8CZ05qVJGjzJcDoYDGSeQ5omLqNrZtIx5qc3s4I3c0gO-fHknweAW4wmOK8H34c4wRQTdgZGuBSsoFKyczBCksuCI8wvwVVKG4QQZliMwONqbWEbjO596GAM-953H3AXQ93aLTz4fg2dNr71_REm_3W6bKzxKet0DS6cbpO9-T3H4H32vJq-Fovly3z6tCgM5YQVlSNcN46UlZOGUI7zjnDNBdKMipoR2-iaOlMyzcumpKaySDhC64o3ljlLx-BuyM1jfe5t6tUm7GOXn1REEJp_InmV1f2gTAwpRevULvqtjkeFkTqVo07lqJ9yMoYDtiZ0Pv3RiiBeCi5JJnggB9_a4z9har5avg2x326ucW8</recordid><startdate>202303</startdate><enddate>202303</enddate><creator>Tordecilla, Rafael D.</creator><creator>Montoya‐Torres, Jairo R.</creator><creator>Quintero‐Araujo, Carlos L.</creator><creator>Panadero, Javier</creator><creator>Juan, Angel A.</creator><general>Blackwell Publishing Ltd</general><scope>24P</scope><scope>WIN</scope><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-0003-3028-1686</orcidid><orcidid>https://orcid.org/0000-0001-8563-4456</orcidid><orcidid>https://orcid.org/0000-0002-6251-3667</orcidid><orcidid>https://orcid.org/0000-0002-3793-3328</orcidid><orcidid>https://orcid.org/0000-0003-1392-1776</orcidid></search><sort><creationdate>202303</creationdate><title>The location routing problem with facility sizing decisions</title><author>Tordecilla, Rafael D. ; Montoya‐Torres, Jairo R. ; Quintero‐Araujo, Carlos L. ; Panadero, Javier ; Juan, Angel A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3625-8f26adf248f9c23619c201b670a537b52edab3fc45a64d43c8e07f23b86de5fe3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>biased randomization</topic><topic>Combinatorial analysis</topic><topic>Decisions</topic><topic>heterogeneous facilities</topic><topic>Heuristic methods</topic><topic>location routing problem</topic><topic>metaheuristics</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Route planning</topic><topic>Search algorithms</topic><topic>Site selection</topic><topic>Vehicle routing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tordecilla, Rafael D.</creatorcontrib><creatorcontrib>Montoya‐Torres, Jairo R.</creatorcontrib><creatorcontrib>Quintero‐Araujo, Carlos L.</creatorcontrib><creatorcontrib>Panadero, Javier</creatorcontrib><creatorcontrib>Juan, Angel A.</creatorcontrib><collection>Wiley Online Library (Open Access Collection)</collection><collection>Wiley Online Library (Open Access Collection)</collection><collection>ECONIS</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & 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>Tordecilla, Rafael D.</au><au>Montoya‐Torres, Jairo R.</au><au>Quintero‐Araujo, Carlos L.</au><au>Panadero, Javier</au><au>Juan, Angel A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The location routing problem with facility sizing decisions</atitle><jtitle>International transactions in operational research</jtitle><date>2023-03</date><risdate>2023</risdate><volume>30</volume><issue>2</issue><spage>915</spage><epage>945</epage><pages>915-945</pages><issn>0969-6016</issn><eissn>1475-3995</eissn><abstract>The location routing problem (LRP) integrates operational decisions on vehicle routing operations with strategic decisions on the location of the facilities or depots from which the distribution will take place. In other words, it combines the well‐known vehicle routing problem (VRP) with the facility location problem (FLP). Hence, the LRP is an NP‐hard combinatorial optimization problem, which justifies the use of metaheuristic approaches whenever large‐scale instances need to be solved. In this paper, we explore a realistic version of the LRP in which facilities of different capacities are considered, i.e., the manager has to consider not only the location but also the size of the facilities to open. In order to tackle this optimization problem, three mixed‐integer linear formulations are proposed and compared. As expected, they have been proved to be cost‐ and time‐ inefficient. Hence, a biased‐randomized iterated local search algorithm is proposed. Classical instances for the LRP with homogeneous facilities are naturally extended to test the performance of our approach.</abstract><cop>Oxford</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/itor.13125</doi><tpages>31</tpages><orcidid>https://orcid.org/0000-0003-3028-1686</orcidid><orcidid>https://orcid.org/0000-0001-8563-4456</orcidid><orcidid>https://orcid.org/0000-0002-6251-3667</orcidid><orcidid>https://orcid.org/0000-0002-3793-3328</orcidid><orcidid>https://orcid.org/0000-0003-1392-1776</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0969-6016 |
| ispartof | International transactions in operational research, 2023-03, Vol.30 (2), p.915-945 |
| issn | 0969-6016 1475-3995 |
| language | eng |
| recordid | cdi_proquest_journals_2723015968 |
| source | Wiley Online Library - AutoHoldings Journals; EBSCOhost Business Source Complete |
| subjects | biased randomization Combinatorial analysis Decisions heterogeneous facilities Heuristic methods location routing problem metaheuristics Operations research Optimization Route planning Search algorithms Site selection Vehicle routing |
| title | The location routing problem with facility sizing decisions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T14%3A39%3A02IST&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=The%20location%20routing%20problem%20with%20facility%20sizing%20decisions&rft.jtitle=International%20transactions%20in%20operational%20research&rft.au=Tordecilla,%20Rafael%20D.&rft.date=2023-03&rft.volume=30&rft.issue=2&rft.spage=915&rft.epage=945&rft.pages=915-945&rft.issn=0969-6016&rft.eissn=1475-3995&rft_id=info:doi/10.1111/itor.13125&rft_dat=%3Cproquest_cross%3E2723015968%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=2723015968&rft_id=info:pmid/&rfr_iscdi=true |