{"id":"https://openalex.org/W4292565479","doi":"https://doi.org/10.1007/s10589-022-00405-8","title":"A generalized shortest path tour problem with time windows","display_name":"A generalized shortest path tour problem with time windows","publication_year":2022,"publication_date":"2022-08-10","ids":{"openalex":"https://openalex.org/W4292565479","doi":"https://doi.org/10.1007/s10589-022-00405-8"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-022-00405-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-022-00405-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00405-8.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00405-8.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010455422","display_name":"Luigi Di Puglia Pugliese","orcid":"https://orcid.org/0000-0002-6895-1457"},"institutions":[{"id":"https://openalex.org/I3005160176","display_name":"Institute for High Performance Computing and Networking","ror":"https://ror.org/04r5fge26","country_code":"IT","type":"facility","lineage":["https://openalex.org/I3005160176","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Di Puglia Pugliese","raw_affiliation_strings":["Istituto di Calcolo e Reti ad Alte Prestazioni, Consiglio Nazionale delle Ricerche, Rende, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto di Calcolo e Reti ad Alte Prestazioni, Consiglio Nazionale delle Ricerche, Rende, Italy","institution_ids":["https://openalex.org/I3005160176"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038612874","display_name":"Daniele Ferone","orcid":"https://orcid.org/0000-0003-4696-7826"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"D. Ferone","raw_affiliation_strings":["Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090584718","display_name":"Paola Festa","orcid":"https://orcid.org/0000-0002-2243-6054"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Festa","raw_affiliation_strings":["Department of Mathematics and Applications, University of Napoli Federico II, Naples, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, University of Napoli Federico II, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081616385","display_name":"Francesca Guerriero","orcid":"https://orcid.org/0000-0002-3887-1317"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"F. Guerriero","raw_affiliation_strings":["Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Italy"],"raw_orcid":"https://orcid.org/0000-0002-3887-1317","affiliations":[{"raw_affiliation_string":"Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081616385"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.2252,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56996618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"83","issue":"2","first_page":"593","last_page":"614"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.800528347492218},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7010311484336853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6597066521644592},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6159251928329468},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6103870272636414},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.587763786315918},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5423449277877808},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5238854289054871},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5180525779724121},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5169934034347534},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5074405074119568},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5049982666969299},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4654320776462555},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.46429643034935},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.4483250677585602},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4423273801803589},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4393956661224365},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.418832004070282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35966193675994873},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.32615047693252563},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2695625126361847},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26933032274246216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07363605499267578}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.800528347492218},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7010311484336853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6597066521644592},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6159251928329468},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6103870272636414},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.587763786315918},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5423449277877808},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5238854289054871},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5180525779724121},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5169934034347534},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5074405074119568},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5049982666969299},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4654320776462555},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.46429643034935},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.4483250677585602},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4423273801803589},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4393956661224365},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.418832004070282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35966193675994873},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.32615047693252563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2695625126361847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26933032274246216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07363605499267578},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10589-022-00405-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-022-00405-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00405-8.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:coopap:v:83:y:2022:i:2:d:10.1007_s10589-022-00405-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-022-00405-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10589-022-00405-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-022-00405-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00405-8.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4292565479.pdf","grobid_xml":"https://content.openalex.org/works/W4292565479.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W197883060","https://openalex.org/W640136309","https://openalex.org/W1589941033","https://openalex.org/W1969483458","https://openalex.org/W1995415305","https://openalex.org/W2058845836","https://openalex.org/W2061632451","https://openalex.org/W2086778464","https://openalex.org/W2115781168","https://openalex.org/W2159637648","https://openalex.org/W2168381469","https://openalex.org/W2336786694","https://openalex.org/W2408262133","https://openalex.org/W2572760112","https://openalex.org/W2754446034","https://openalex.org/W2766388960","https://openalex.org/W2886002802","https://openalex.org/W2901983157","https://openalex.org/W2909366371","https://openalex.org/W2923442889","https://openalex.org/W2971760385","https://openalex.org/W3008779020","https://openalex.org/W3106189041","https://openalex.org/W3112624924","https://openalex.org/W4224237592","https://openalex.org/W4247477093"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2198982833","https://openalex.org/W2368964068","https://openalex.org/W2562562750","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W1617152041","https://openalex.org/W2366342492","https://openalex.org/W4321491762","https://openalex.org/W2384965074"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"studies":[3],"a":[4,23,44,63,74],"generalization":[5],"of":[6,36,59,77,84],"the":[7,56,82,85],"shortest":[8,26],"path":[9],"tour":[10],"problem":[11],"with":[12],"time":[13,45],"windows":[14],"(":[15],"GSPTPTW":[16,60],").":[17],"The":[18],"aim":[19],"is":[20],"to":[21,30,50,67],"find":[22],"single-origin":[24],"single-destination":[25],"path,":[27],"which":[28,51],"has":[29,43],"pass":[31],"through":[32],"an":[33],"ordered":[34],"sequence":[35],"not":[37],"necessarily":[38],"disjoint":[39],"node-subsets.":[40],"Each":[41],"node":[42],"window":[46],"for":[47],"each":[48],"node-subset":[49],"it":[52],"belongs.":[53],"We":[54],"investigate":[55],"theoretical":[57],"properties":[58],"and":[61],"propose":[62],"dynamic":[64],"programming":[65],"approach":[66],"solve":[68],"it.":[69],"Numerical":[70],"results":[71],"collected":[72],"on":[73],"large":[75],"set":[76],"new":[78],"benchmark":[79],"instances":[80],"highlight":[81],"effectiveness":[83],"proposed":[86],"solution":[87],"approach.":[88]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}