The multi-vehicle cumulative covering tour problem
This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. Th...
Gespeichert in:
| Veröffentlicht in: | Annals of operations research 2017-11, Vol.258 (2), p.761-780 |
|---|---|
| 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 | 780 |
|---|---|
| container_issue | 2 |
| container_start_page | 761 |
| container_title | Annals of operations research |
| container_volume | 258 |
| creator | Flores-Garza, David A. Salazar-Aguilar, M. Angélica Ngueveu, Sandra Ulrich Laporte, Gilbert |
| description | This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. There are three types of locations: mandatory, optional, and unreachable. Each mandatory location must be visited, and optional locations are visited in order to cover the unreachable locations. To guarantee the vehicle autonomy, the duration of each tour should not exceed a given time limit. A mixed integer linear formulation and a greedy randomized adaptive search procedure are proposed for this problem. The performance of the algorithm is assessed over a large set of instances adapted from the literature. Computational results confirm the efficiency of the proposed algorithm. |
| doi_str_mv | 10.1007/s10479-015-2062-7 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01880113v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A514774292</galeid><sourcerecordid>A514774292</sourcerecordid><originalsourceid>FETCH-LOGICAL-c524t-a657f50b303f6c509f68a804068f4e9493e10dfcdc12709a985c7ed659796eae3</originalsourceid><addsrcrecordid>eNp1kUtrGzEUhUVoIK6TH5CdoatC5V5Jo5G0NKFNCoZs3LWQ5StbYR6uNGPov6_MlLiBBoEel--IcziE3DNYMgD1NTOolKHAJOVQc6quyIxJxakRQn8gM-CyolIIuCEfc34BAMa0nBG-OeCiHZsh0hMeom9w4cfydkM8lWt_whS7_WLox7Q4pn7bYHtLroNrMt79Pefk5_dvm4cnun5-_PGwWlMveTVQV0sVJGwFiFB7CSbU2mmooNahQlMZgQx2we884wqMM1p6hbtaGmVqdCjm5PP078E19phi69Jv27ton1Zre54B07rEECdW2E8TWzz-GjEP9qU47oo9y0HLGoADXKi9a9DGLvRDcr6N2duVZJVSFTe8UMv_UGXtsI2-7zDEMn8j-PKPYDvm2GEuW477w5D3bsz5Lc4m3Kc-54ThNRwDey7TTmWWfNKey7SqaPikycdzH5gu-d4X_QE7_p1q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2085600200</pqid></control><display><type>article</type><title>The multi-vehicle cumulative covering tour problem</title><source>SpringerNature Complete Journals</source><source>EBSCOhost Business Source Complete</source><creator>Flores-Garza, David A. ; Salazar-Aguilar, M. Angélica ; Ngueveu, Sandra Ulrich ; Laporte, Gilbert</creator><creatorcontrib>Flores-Garza, David A. ; Salazar-Aguilar, M. Angélica ; Ngueveu, Sandra Ulrich ; Laporte, Gilbert</creatorcontrib><description>This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. There are three types of locations: mandatory, optional, and unreachable. Each mandatory location must be visited, and optional locations are visited in order to cover the unreachable locations. To guarantee the vehicle autonomy, the duration of each tour should not exceed a given time limit. A mixed integer linear formulation and a greedy randomized adaptive search procedure are proposed for this problem. The performance of the algorithm is assessed over a large set of instances adapted from the literature. Computational results confirm the efficiency of the proposed algorithm.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-015-2062-7</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Adaptive search techniques ; Algorithms ; Autonomy ; Business and Management ; Combinatorics ; Computational Complexity ; Computer Science ; Computer Science and Game Theory ; Humanitarian aid ; Integer programming ; Logistics ; Mathematics ; Mixed integer ; Operations Research ; Operations Research/Decision Theory ; Optimization and Control ; Studies ; Theory of Computation</subject><ispartof>Annals of operations research, 2017-11, Vol.258 (2), p.761-780</ispartof><rights>Springer Science+Business Media New York 2015</rights><rights>COPYRIGHT 2017 Springer</rights><rights>Annals of Operations Research is a copyright of Springer, (2015). All Rights Reserved.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c524t-a657f50b303f6c509f68a804068f4e9493e10dfcdc12709a985c7ed659796eae3</citedby><cites>FETCH-LOGICAL-c524t-a657f50b303f6c509f68a804068f4e9493e10dfcdc12709a985c7ed659796eae3</cites><orcidid>0009-0002-4353-2106</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/s10479-015-2062-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10479-015-2062-7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,314,776,780,881,27901,27902,41464,42533,51294</link.rule.ids><backlink>$$Uhttps://laas.hal.science/hal-01880113$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Flores-Garza, David A.</creatorcontrib><creatorcontrib>Salazar-Aguilar, M. Angélica</creatorcontrib><creatorcontrib>Ngueveu, Sandra Ulrich</creatorcontrib><creatorcontrib>Laporte, Gilbert</creatorcontrib><title>The multi-vehicle cumulative covering tour problem</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. There are three types of locations: mandatory, optional, and unreachable. Each mandatory location must be visited, and optional locations are visited in order to cover the unreachable locations. To guarantee the vehicle autonomy, the duration of each tour should not exceed a given time limit. A mixed integer linear formulation and a greedy randomized adaptive search procedure are proposed for this problem. The performance of the algorithm is assessed over a large set of instances adapted from the literature. Computational results confirm the efficiency of the proposed algorithm.</description><subject>Adaptive search techniques</subject><subject>Algorithms</subject><subject>Autonomy</subject><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Computational Complexity</subject><subject>Computer Science</subject><subject>Computer Science and Game Theory</subject><subject>Humanitarian aid</subject><subject>Integer programming</subject><subject>Logistics</subject><subject>Mathematics</subject><subject>Mixed integer</subject><subject>Operations Research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization and Control</subject><subject>Studies</subject><subject>Theory of Computation</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><sourceid>BENPR</sourceid><recordid>eNp1kUtrGzEUhUVoIK6TH5CdoatC5V5Jo5G0NKFNCoZs3LWQ5StbYR6uNGPov6_MlLiBBoEel--IcziE3DNYMgD1NTOolKHAJOVQc6quyIxJxakRQn8gM-CyolIIuCEfc34BAMa0nBG-OeCiHZsh0hMeom9w4cfydkM8lWt_whS7_WLox7Q4pn7bYHtLroNrMt79Pefk5_dvm4cnun5-_PGwWlMveTVQV0sVJGwFiFB7CSbU2mmooNahQlMZgQx2we884wqMM1p6hbtaGmVqdCjm5PP078E19phi69Jv27ton1Zre54B07rEECdW2E8TWzz-GjEP9qU47oo9y0HLGoADXKi9a9DGLvRDcr6N2duVZJVSFTe8UMv_UGXtsI2-7zDEMn8j-PKPYDvm2GEuW477w5D3bsz5Lc4m3Kc-54ThNRwDey7TTmWWfNKey7SqaPikycdzH5gu-d4X_QE7_p1q</recordid><startdate>20171101</startdate><enddate>20171101</enddate><creator>Flores-Garza, David A.</creator><creator>Salazar-Aguilar, M. Angélica</creator><creator>Ngueveu, Sandra Ulrich</creator><creator>Laporte, Gilbert</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><general>Springer Verlag</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>1XC</scope><orcidid>https://orcid.org/0009-0002-4353-2106</orcidid></search><sort><creationdate>20171101</creationdate><title>The multi-vehicle cumulative covering tour problem</title><author>Flores-Garza, David A. ; Salazar-Aguilar, M. Angélica ; Ngueveu, Sandra Ulrich ; Laporte, Gilbert</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c524t-a657f50b303f6c509f68a804068f4e9493e10dfcdc12709a985c7ed659796eae3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Adaptive search techniques</topic><topic>Algorithms</topic><topic>Autonomy</topic><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Computational Complexity</topic><topic>Computer Science</topic><topic>Computer Science and Game Theory</topic><topic>Humanitarian aid</topic><topic>Integer programming</topic><topic>Logistics</topic><topic>Mathematics</topic><topic>Mixed integer</topic><topic>Operations Research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization and Control</topic><topic>Studies</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Flores-Garza, David A.</creatorcontrib><creatorcontrib>Salazar-Aguilar, M. Angélica</creatorcontrib><creatorcontrib>Ngueveu, Sandra Ulrich</creatorcontrib><creatorcontrib>Laporte, Gilbert</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Flores-Garza, David A.</au><au>Salazar-Aguilar, M. Angélica</au><au>Ngueveu, Sandra Ulrich</au><au>Laporte, Gilbert</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The multi-vehicle cumulative covering tour problem</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2017-11-01</date><risdate>2017</risdate><volume>258</volume><issue>2</issue><spage>761</spage><epage>780</epage><pages>761-780</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. There are three types of locations: mandatory, optional, and unreachable. Each mandatory location must be visited, and optional locations are visited in order to cover the unreachable locations. To guarantee the vehicle autonomy, the duration of each tour should not exceed a given time limit. A mixed integer linear formulation and a greedy randomized adaptive search procedure are proposed for this problem. The performance of the algorithm is assessed over a large set of instances adapted from the literature. Computational results confirm the efficiency of the proposed algorithm.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10479-015-2062-7</doi><tpages>20</tpages><orcidid>https://orcid.org/0009-0002-4353-2106</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0254-5330 |
| ispartof | Annals of operations research, 2017-11, Vol.258 (2), p.761-780 |
| issn | 0254-5330 1572-9338 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_01880113v1 |
| source | SpringerNature Complete Journals; EBSCOhost Business Source Complete |
| subjects | Adaptive search techniques Algorithms Autonomy Business and Management Combinatorics Computational Complexity Computer Science Computer Science and Game Theory Humanitarian aid Integer programming Logistics Mathematics Mixed integer Operations Research Operations Research/Decision Theory Optimization and Control Studies Theory of Computation |
| title | The multi-vehicle cumulative covering tour problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T09%3A56%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20multi-vehicle%20cumulative%20covering%20tour%20problem&rft.jtitle=Annals%20of%20operations%20research&rft.au=Flores-Garza,%20David%20A.&rft.date=2017-11-01&rft.volume=258&rft.issue=2&rft.spage=761&rft.epage=780&rft.pages=761-780&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-015-2062-7&rft_dat=%3Cgale_hal_p%3EA514774292%3C/gale_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2085600200&rft_id=info:pmid/&rft_galeid=A514774292&rfr_iscdi=true |