A generalized shortest path tour problem with time windows
This paper studies a generalization of the shortest path tour problem with time windows ( GSPTPTW ). The aim is to find a single-origin single-destination shortest path, which has to pass through an ordered sequence of not necessarily disjoint node-subsets. Each node has a time window for each node-...
Gespeichert in:
| Veröffentlicht in: | Computational optimization and applications 2022-11, Vol.83 (2), p.593-614 |
|---|---|
| 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 | 614 |
|---|---|
| container_issue | 2 |
| container_start_page | 593 |
| container_title | Computational optimization and applications |
| container_volume | 83 |
| creator | Di Puglia Pugliese, L. Ferone, D. Festa, P. Guerriero, F. |
| description | This paper studies a generalization of the shortest path tour problem with time windows (
GSPTPTW
). The aim is to find a single-origin single-destination shortest path, which has to pass through an ordered sequence of not necessarily disjoint node-subsets. Each node has a time window for each node-subset to which it belongs. We investigate the theoretical properties of
GSPTPTW
and propose a dynamic programming approach to solve it. Numerical results collected on a large set of new benchmark instances highlight the effectiveness of the proposed solution approach. |
| doi_str_mv | 10.1007/s10589-022-00405-8 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2719231260</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2719231260</sourcerecordid><originalsourceid>FETCH-LOGICAL-c244t-e5cc3081ef38273a82948f2663682e8ed6f1723acab3309728483a4528fe9c23</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxYMoWKtfwNOC5-hkZjebeCvFf1Dw0ntIt7Ptlna3JluKfnpTV_DmaYbhvTc_nhC3Cu4VQPkQFRTGSkCUADkU0pyJkSpKkmhsfi5GYFFLDUCX4irGDQDYknAkHifZilsOftt88TKL6y70HPts7_t11neHkO1Dt9jyLjs2p0uz47S1y-4Yr8VF7beRb37nWMyfn-bTVzl7f3mbTmaywjzvJRdVRWAU12SwJG_Q5qZGrUkbZMNLXasSyVd-QZSo0OSGfF6gqdlWSGNxN8QmkI9DYnObhNWmjw5LZZEUakgqHFRV6GIMXLt9aHY-fDoF7lSRGypyqSL3U5EzyUSDKSZxu-LwF_2P6xsd42fk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2719231260</pqid></control><display><type>article</type><title>A generalized shortest path tour problem with time windows</title><source>SpringerLink Journals</source><source>EBSCOhost Business Source Complete</source><creator>Di Puglia Pugliese, L. ; Ferone, D. ; Festa, P. ; Guerriero, F.</creator><creatorcontrib>Di Puglia Pugliese, L. ; Ferone, D. ; Festa, P. ; Guerriero, F.</creatorcontrib><description>This paper studies a generalization of the shortest path tour problem with time windows (
GSPTPTW
). The aim is to find a single-origin single-destination shortest path, which has to pass through an ordered sequence of not necessarily disjoint node-subsets. Each node has a time window for each node-subset to which it belongs. We investigate the theoretical properties of
GSPTPTW
and propose a dynamic programming approach to solve it. Numerical results collected on a large set of new benchmark instances highlight the effectiveness of the proposed solution approach.</description><identifier>ISSN: 0926-6003</identifier><identifier>EISSN: 1573-2894</identifier><identifier>DOI: 10.1007/s10589-022-00405-8</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Convex and Discrete Geometry ; Dynamic programming ; Management Science ; Mathematics ; Mathematics and Statistics ; Network topologies ; Nodes ; Operations Research ; Operations Research/Decision Theory ; Optimization ; Statistics ; Windows (intervals)</subject><ispartof>Computational optimization and applications, 2022-11, Vol.83 (2), p.593-614</ispartof><rights>The Author(s) 2022</rights><rights>The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/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><cites>FETCH-LOGICAL-c244t-e5cc3081ef38273a82948f2663682e8ed6f1723acab3309728483a4528fe9c23</cites><orcidid>0000-0002-3887-1317</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/s10589-022-00405-8$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10589-022-00405-8$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Di Puglia Pugliese, L.</creatorcontrib><creatorcontrib>Ferone, D.</creatorcontrib><creatorcontrib>Festa, P.</creatorcontrib><creatorcontrib>Guerriero, F.</creatorcontrib><title>A generalized shortest path tour problem with time windows</title><title>Computational optimization and applications</title><addtitle>Comput Optim Appl</addtitle><description>This paper studies a generalization of the shortest path tour problem with time windows (
GSPTPTW
). The aim is to find a single-origin single-destination shortest path, which has to pass through an ordered sequence of not necessarily disjoint node-subsets. Each node has a time window for each node-subset to which it belongs. We investigate the theoretical properties of
GSPTPTW
and propose a dynamic programming approach to solve it. Numerical results collected on a large set of new benchmark instances highlight the effectiveness of the proposed solution approach.</description><subject>Algorithms</subject><subject>Convex and Discrete Geometry</subject><subject>Dynamic programming</subject><subject>Management Science</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Network topologies</subject><subject>Nodes</subject><subject>Operations Research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Statistics</subject><subject>Windows (intervals)</subject><issn>0926-6003</issn><issn>1573-2894</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kE9LAzEQxYMoWKtfwNOC5-hkZjebeCvFf1Dw0ntIt7Ptlna3JluKfnpTV_DmaYbhvTc_nhC3Cu4VQPkQFRTGSkCUADkU0pyJkSpKkmhsfi5GYFFLDUCX4irGDQDYknAkHifZilsOftt88TKL6y70HPts7_t11neHkO1Dt9jyLjs2p0uz47S1y-4Yr8VF7beRb37nWMyfn-bTVzl7f3mbTmaywjzvJRdVRWAU12SwJG_Q5qZGrUkbZMNLXasSyVd-QZSo0OSGfF6gqdlWSGNxN8QmkI9DYnObhNWmjw5LZZEUakgqHFRV6GIMXLt9aHY-fDoF7lSRGypyqSL3U5EzyUSDKSZxu-LwF_2P6xsd42fk</recordid><startdate>20221101</startdate><enddate>20221101</enddate><creator>Di Puglia Pugliese, L.</creator><creator>Ferone, D.</creator><creator>Festa, P.</creator><creator>Guerriero, F.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</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>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</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><orcidid>https://orcid.org/0000-0002-3887-1317</orcidid></search><sort><creationdate>20221101</creationdate><title>A generalized shortest path tour problem with time windows</title><author>Di Puglia Pugliese, L. ; Ferone, D. ; Festa, P. ; Guerriero, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c244t-e5cc3081ef38273a82948f2663682e8ed6f1723acab3309728483a4528fe9c23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Convex and Discrete Geometry</topic><topic>Dynamic programming</topic><topic>Management Science</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Network topologies</topic><topic>Nodes</topic><topic>Operations Research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Statistics</topic><topic>Windows (intervals)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Di Puglia Pugliese, L.</creatorcontrib><creatorcontrib>Ferone, D.</creatorcontrib><creatorcontrib>Festa, P.</creatorcontrib><creatorcontrib>Guerriero, F.</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</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>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</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>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering 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><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><jtitle>Computational optimization and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Di Puglia Pugliese, L.</au><au>Ferone, D.</au><au>Festa, P.</au><au>Guerriero, F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A generalized shortest path tour problem with time windows</atitle><jtitle>Computational optimization and applications</jtitle><stitle>Comput Optim Appl</stitle><date>2022-11-01</date><risdate>2022</risdate><volume>83</volume><issue>2</issue><spage>593</spage><epage>614</epage><pages>593-614</pages><issn>0926-6003</issn><eissn>1573-2894</eissn><abstract>This paper studies a generalization of the shortest path tour problem with time windows (
GSPTPTW
). The aim is to find a single-origin single-destination shortest path, which has to pass through an ordered sequence of not necessarily disjoint node-subsets. Each node has a time window for each node-subset to which it belongs. We investigate the theoretical properties of
GSPTPTW
and propose a dynamic programming approach to solve it. Numerical results collected on a large set of new benchmark instances highlight the effectiveness of the proposed solution approach.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10589-022-00405-8</doi><tpages>22</tpages><orcidid>https://orcid.org/0000-0002-3887-1317</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0926-6003 |
| ispartof | Computational optimization and applications, 2022-11, Vol.83 (2), p.593-614 |
| issn | 0926-6003 1573-2894 |
| language | eng |
| recordid | cdi_proquest_journals_2719231260 |
| source | SpringerLink Journals; EBSCOhost Business Source Complete |
| subjects | Algorithms Convex and Discrete Geometry Dynamic programming Management Science Mathematics Mathematics and Statistics Network topologies Nodes Operations Research Operations Research/Decision Theory Optimization Statistics Windows (intervals) |
| title | A generalized shortest path tour problem with time windows |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T10%3A10%3A14IST&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%20generalized%20shortest%20path%20tour%20problem%20with%20time%20windows&rft.jtitle=Computational%20optimization%20and%20applications&rft.au=Di%20Puglia%20Pugliese,%20L.&rft.date=2022-11-01&rft.volume=83&rft.issue=2&rft.spage=593&rft.epage=614&rft.pages=593-614&rft.issn=0926-6003&rft.eissn=1573-2894&rft_id=info:doi/10.1007/s10589-022-00405-8&rft_dat=%3Cproquest_cross%3E2719231260%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=2719231260&rft_id=info:pmid/&rfr_iscdi=true |