A biased-randomized iterated local search for the vehicle routing problem with optional backhauls
The vehicle routing problem with backhauls integrates decisions on product delivery with decisions on the collection of returnable items. In this paper, we analyze a scenario in which collection of items is optional—but subject to a penalty cost. Both transportation costs and penalties associated wi...
Gespeichert in:
| Veröffentlicht in: | TOP 2021-07, Vol.29 (2), p.387-416 |
|---|---|
| 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 | 416 |
|---|---|
| container_issue | 2 |
| container_start_page | 387 |
| container_title | TOP |
| container_volume | 29 |
| creator | Londoño, Julio C. Tordecilla, Rafael D. Martins, Leandro do C. Juan, Angel A. |
| description | The vehicle routing problem with backhauls integrates decisions on product delivery with decisions on the collection of returnable items. In this paper, we analyze a scenario in which collection of items is optional—but subject to a penalty cost. Both transportation costs and penalties associated with non-collecting decisions are considered. A mixed-integer linear model is proposed and solved for small instances. Also, a metaheuristic algorithm combining biased randomization techniques with iterated local search is introduced for larger instances. Our approach yields cost savings and is competitive when compared to other state-of-the-art approaches. |
| doi_str_mv | 10.1007/s11750-020-00558-x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2544895557</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2544895557</sourcerecordid><originalsourceid>FETCH-LOGICAL-c409t-7ba698e7444dc451266a48023490e5f8b6580ab6cb8b23b9ffeac9d690c6cadc3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWLR_wFPA82q-kz2W4hcUvOg5JNlsN7rd1GSr1V9vdIXePAwzMM878_ICcIHRFUZIXmeMJUcVIqUQ56raH4EZVoJWisj6uMyYsopLwU7BPOdgEaGYCUnoDJgFtMFk31TJDE3chC_fwDD6ZMYy9NGZHmZvkutgGxMcOw_ffRdc72GKuzEMa7hN0fZ-Az_C2MG4HUMcisga99qZXZ_PwUlr-uznf_0MPN_ePC3vq9Xj3cNysaocQ_VYSWtErbxkjDWOcUyEMEwVp6xGnrfKCq6QscJZZQm1ddt64-pG1MgJZxpHz8DldLf4edv5POqXuEvFStaEM6ZqzrksFJkol2LOybd6m8LGpE-Nkf5JU09p6pKm_k1T74sITiLv4hDyQSIFoQUirCB0QnJZDmufDt__OfwNsmKDxQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2544895557</pqid></control><display><type>article</type><title>A biased-randomized iterated local search for the vehicle routing problem with optional backhauls</title><source>Springer Nature - Complete Springer Journals</source><creator>Londoño, Julio C. ; Tordecilla, Rafael D. ; Martins, Leandro do C. ; Juan, Angel A.</creator><creatorcontrib>Londoño, Julio C. ; Tordecilla, Rafael D. ; Martins, Leandro do C. ; Juan, Angel A.</creatorcontrib><description>The vehicle routing problem with backhauls integrates decisions on product delivery with decisions on the collection of returnable items. In this paper, we analyze a scenario in which collection of items is optional—but subject to a penalty cost. Both transportation costs and penalties associated with non-collecting decisions are considered. A mixed-integer linear model is proposed and solved for small instances. Also, a metaheuristic algorithm combining biased randomization techniques with iterated local search is introduced for larger instances. Our approach yields cost savings and is competitive when compared to other state-of-the-art approaches.</description><identifier>ISSN: 1134-5764</identifier><identifier>EISSN: 1863-8279</identifier><identifier>DOI: 10.1007/s11750-020-00558-x</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Business and Management ; Cost control ; Decisions ; Economic Theory/Quantitative Economics/Mathematical Methods ; Economics ; Finance ; Heuristic methods ; Industrial and Production Engineering ; Insurance ; Management ; Mixed integer ; Operating costs ; Operations Research/Decision Theory ; Optimization ; Original Paper ; Randomization ; Route planning ; Statistics for Business ; Vehicle routing</subject><ispartof>TOP, 2021-07, Vol.29 (2), p.387-416</ispartof><rights>Sociedad de Estadística e Investigación Operativa 2020</rights><rights>Sociedad de Estadística e Investigación Operativa 2020.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c409t-7ba698e7444dc451266a48023490e5f8b6580ab6cb8b23b9ffeac9d690c6cadc3</citedby><cites>FETCH-LOGICAL-c409t-7ba698e7444dc451266a48023490e5f8b6580ab6cb8b23b9ffeac9d690c6cadc3</cites><orcidid>0000-0001-7390-8341 ; 0000-0003-1392-1776 ; 0000-0003-3028-1686 ; 0000-0001-6529-0270</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11750-020-00558-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11750-020-00558-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Londoño, Julio C.</creatorcontrib><creatorcontrib>Tordecilla, Rafael D.</creatorcontrib><creatorcontrib>Martins, Leandro do C.</creatorcontrib><creatorcontrib>Juan, Angel A.</creatorcontrib><title>A biased-randomized iterated local search for the vehicle routing problem with optional backhauls</title><title>TOP</title><addtitle>TOP</addtitle><description>The vehicle routing problem with backhauls integrates decisions on product delivery with decisions on the collection of returnable items. In this paper, we analyze a scenario in which collection of items is optional—but subject to a penalty cost. Both transportation costs and penalties associated with non-collecting decisions are considered. A mixed-integer linear model is proposed and solved for small instances. Also, a metaheuristic algorithm combining biased randomization techniques with iterated local search is introduced for larger instances. Our approach yields cost savings and is competitive when compared to other state-of-the-art approaches.</description><subject>Algorithms</subject><subject>Business and Management</subject><subject>Cost control</subject><subject>Decisions</subject><subject>Economic Theory/Quantitative Economics/Mathematical Methods</subject><subject>Economics</subject><subject>Finance</subject><subject>Heuristic methods</subject><subject>Industrial and Production Engineering</subject><subject>Insurance</subject><subject>Management</subject><subject>Mixed integer</subject><subject>Operating costs</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Original Paper</subject><subject>Randomization</subject><subject>Route planning</subject><subject>Statistics for Business</subject><subject>Vehicle routing</subject><issn>1134-5764</issn><issn>1863-8279</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWLR_wFPA82q-kz2W4hcUvOg5JNlsN7rd1GSr1V9vdIXePAwzMM878_ICcIHRFUZIXmeMJUcVIqUQ56raH4EZVoJWisj6uMyYsopLwU7BPOdgEaGYCUnoDJgFtMFk31TJDE3chC_fwDD6ZMYy9NGZHmZvkutgGxMcOw_ffRdc72GKuzEMa7hN0fZ-Az_C2MG4HUMcisga99qZXZ_PwUlr-uznf_0MPN_ePC3vq9Xj3cNysaocQ_VYSWtErbxkjDWOcUyEMEwVp6xGnrfKCq6QscJZZQm1ddt64-pG1MgJZxpHz8DldLf4edv5POqXuEvFStaEM6ZqzrksFJkol2LOybd6m8LGpE-Nkf5JU09p6pKm_k1T74sITiLv4hDyQSIFoQUirCB0QnJZDmufDt__OfwNsmKDxQ</recordid><startdate>20210701</startdate><enddate>20210701</enddate><creator>Londoño, Julio C.</creator><creator>Tordecilla, Rafael D.</creator><creator>Martins, Leandro do C.</creator><creator>Juan, Angel A.</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-7390-8341</orcidid><orcidid>https://orcid.org/0000-0003-1392-1776</orcidid><orcidid>https://orcid.org/0000-0003-3028-1686</orcidid><orcidid>https://orcid.org/0000-0001-6529-0270</orcidid></search><sort><creationdate>20210701</creationdate><title>A biased-randomized iterated local search for the vehicle routing problem with optional backhauls</title><author>Londoño, Julio C. ; Tordecilla, Rafael D. ; Martins, Leandro do C. ; Juan, Angel A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c409t-7ba698e7444dc451266a48023490e5f8b6580ab6cb8b23b9ffeac9d690c6cadc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Business and Management</topic><topic>Cost control</topic><topic>Decisions</topic><topic>Economic Theory/Quantitative Economics/Mathematical Methods</topic><topic>Economics</topic><topic>Finance</topic><topic>Heuristic methods</topic><topic>Industrial and Production Engineering</topic><topic>Insurance</topic><topic>Management</topic><topic>Mixed integer</topic><topic>Operating costs</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Original Paper</topic><topic>Randomization</topic><topic>Route planning</topic><topic>Statistics for Business</topic><topic>Vehicle routing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Londoño, Julio C.</creatorcontrib><creatorcontrib>Tordecilla, Rafael D.</creatorcontrib><creatorcontrib>Martins, Leandro do C.</creatorcontrib><creatorcontrib>Juan, Angel A.</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><jtitle>TOP</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Londoño, Julio C.</au><au>Tordecilla, Rafael D.</au><au>Martins, Leandro do C.</au><au>Juan, Angel A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A biased-randomized iterated local search for the vehicle routing problem with optional backhauls</atitle><jtitle>TOP</jtitle><stitle>TOP</stitle><date>2021-07-01</date><risdate>2021</risdate><volume>29</volume><issue>2</issue><spage>387</spage><epage>416</epage><pages>387-416</pages><issn>1134-5764</issn><eissn>1863-8279</eissn><abstract>The vehicle routing problem with backhauls integrates decisions on product delivery with decisions on the collection of returnable items. In this paper, we analyze a scenario in which collection of items is optional—but subject to a penalty cost. Both transportation costs and penalties associated with non-collecting decisions are considered. A mixed-integer linear model is proposed and solved for small instances. Also, a metaheuristic algorithm combining biased randomization techniques with iterated local search is introduced for larger instances. Our approach yields cost savings and is competitive when compared to other state-of-the-art approaches.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s11750-020-00558-x</doi><tpages>30</tpages><orcidid>https://orcid.org/0000-0001-7390-8341</orcidid><orcidid>https://orcid.org/0000-0003-1392-1776</orcidid><orcidid>https://orcid.org/0000-0003-3028-1686</orcidid><orcidid>https://orcid.org/0000-0001-6529-0270</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1134-5764 |
| ispartof | TOP, 2021-07, Vol.29 (2), p.387-416 |
| issn | 1134-5764 1863-8279 |
| language | eng |
| recordid | cdi_proquest_journals_2544895557 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Algorithms Business and Management Cost control Decisions Economic Theory/Quantitative Economics/Mathematical Methods Economics Finance Heuristic methods Industrial and Production Engineering Insurance Management Mixed integer Operating costs Operations Research/Decision Theory Optimization Original Paper Randomization Route planning Statistics for Business Vehicle routing |
| title | A biased-randomized iterated local search for the vehicle routing problem with optional backhauls |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T00%3A25%3A21IST&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%20biased-randomized%20iterated%20local%20search%20for%20the%20vehicle%20routing%20problem%20with%20optional%20backhauls&rft.jtitle=TOP&rft.au=Londo%C3%B1o,%20Julio%20C.&rft.date=2021-07-01&rft.volume=29&rft.issue=2&rft.spage=387&rft.epage=416&rft.pages=387-416&rft.issn=1134-5764&rft.eissn=1863-8279&rft_id=info:doi/10.1007/s11750-020-00558-x&rft_dat=%3Cproquest_cross%3E2544895557%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=2544895557&rft_id=info:pmid/&rfr_iscdi=true |