{"id":"https://openalex.org/W4200614336","doi":"https://doi.org/10.1109/ictc52510.2021.9621108","title":"A Floyd-Warshall-Based Reoptimization of Q Matrix on the Single DVRPPD with On-Demand Cancellations","display_name":"A Floyd-Warshall-Based Reoptimization of Q Matrix on the Single DVRPPD with On-Demand Cancellations","publication_year":2021,"publication_date":"2021-10-20","ids":{"openalex":"https://openalex.org/W4200614336","doi":"https://doi.org/10.1109/ictc52510.2021.9621108"},"language":"en","primary_location":{"id":"doi:10.1109/ictc52510.2021.9621108","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictc52510.2021.9621108","pdf_url":null,"source":{"id":"https://openalex.org/S4363607766","display_name":"2021 International Conference on Information and Communication Technology Convergence (ICTC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Conference on Information and Communication Technology Convergence (ICTC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006619044","display_name":"Jasper Kyle Catapang","orcid":"https://orcid.org/0000-0002-4510-0975"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jasper Kyle Catapang","raw_affiliation_strings":["Department of English Language and Linguistics, University of Birmingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of English Language and Linguistics, University of Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086938101","display_name":"Geoffrey A. Solano","orcid":"https://orcid.org/0000-0002-4223-1355"},"institutions":[{"id":"https://openalex.org/I5791819","display_name":"University of the Philippines Manila","ror":"https://ror.org/01rrczv41","country_code":"PH","type":"education","lineage":["https://openalex.org/I103911934","https://openalex.org/I5791819"]}],"countries":["PH"],"is_corresponding":false,"raw_author_name":"Geoffrey A. Solano","raw_affiliation_strings":["Department of Physical Sciences and Mathematics, College of Arts and Sciences University of the Philippines Manila, Manila City, Philippines"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physical Sciences and Mathematics, College of Arts and Sciences University of the Philippines Manila, Manila City, Philippines","institution_ids":["https://openalex.org/I5791819"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4449,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56939502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6315645575523376},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5521732568740845},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.541208028793335},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5161932110786438},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.483719140291214},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4799085557460785},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.47454628348350525},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.4722140431404114},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4718618094921112},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.47083237767219543},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42087966203689575},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.380882203578949},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3390941619873047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27752119302749634},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27169495820999146}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6315645575523376},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5521732568740845},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.541208028793335},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5161932110786438},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.483719140291214},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4799085557460785},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.47454628348350525},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.4722140431404114},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4718618094921112},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.47083237767219543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42087966203689575},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.380882203578949},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3390941619873047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27752119302749634},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27169495820999146},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ictc52510.2021.9621108","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictc52510.2021.9621108","pdf_url":null,"source":{"id":"https://openalex.org/S4363607766","display_name":"2021 International Conference on Information and Communication Technology Convergence (ICTC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Conference on Information and Communication Technology Convergence (ICTC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/3","display_name":"Good health and well-being","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1501435780","https://openalex.org/W1972700856","https://openalex.org/W2059810217","https://openalex.org/W2066878540","https://openalex.org/W2079747430","https://openalex.org/W2096305430","https://openalex.org/W2107862175","https://openalex.org/W2246680151","https://openalex.org/W3003686452","https://openalex.org/W3011120880","https://openalex.org/W3204415704","https://openalex.org/W4295138992","https://openalex.org/W6748487558"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W2031913815","https://openalex.org/W3119129187","https://openalex.org/W2470251263","https://openalex.org/W2193306078"],"abstract_inverted_index":{"Delivery":[0],"services":[1,24],"have":[2],"reached":[3],"an":[4,34,169],"all-time":[5],"high":[6],"in":[7,37],"terms":[8],"of":[9,72,96,129,177,204],"demands":[10],"due":[11],"to":[12,63,160,163,229,238],"the":[13,77,107,114,123,127,174,181,190,208,226,230],"COVID-19":[14],"pandemic.":[15],"An":[16],"optimal":[17],"routing":[18,30,80],"plan":[19],"for":[20,151],"these":[21],"different":[22],"courier":[23],"is":[25,33,91,111,135,158],"a":[26,58,68,102,118,140,148,201],"must.":[27],"The":[28,88,132,219],"vehicle":[29,79],"problem":[31,36,81],"(VRP)":[32],"NP-hard":[35],"logistics":[38],"research":[39],"and":[40,49,75,85,206,212],"it":[41],"can":[42,197],"be":[43,198],"solved":[44],"by":[45,117],"exact":[46],"algorithms,":[47],"heuristics,":[48],"machine":[50],"learning":[51],"through":[52],"reinforcement":[53],"learning.":[54],"This":[55],"study":[56,171],"introduces":[57],"reoptimization":[59,89],"alternative":[60],"as":[61,215],"opposed":[62],"trivial":[64],"Q-learning":[65,104,154,166,187,216,232],"retraining":[66],"on":[67,147,200],"newly":[69],"introduced":[70],"subproblem":[71],"dynamic":[73,78],"VRP":[74],"VRPPD,":[76],"with":[82,101,156,217],"pickup,":[83],"delivery,":[84],"cancellation":[86],"(DVRPPDC).":[87],"technique":[90],"called":[92],"Floyd-Warshall":[93,138],"LookUp":[94],"Reoptimization":[95],"Rewards":[97],"Yearned":[98],"(FLURRY).":[99],"Combined":[100],"one-time":[103,153],"computation":[105],"beforehand,":[106],"Q":[108,202],"matrix":[109,203],"produced":[110],"updated":[112],"at":[113,189,194],"cell":[115],"level":[116],"lookup":[119,133],"table":[120,134],"containing":[121],"all":[122],"shortest":[124,142],"paths":[125],"among":[126],"pairs":[128],"parcel":[130],"lockers.":[131],"generated":[136],"via":[137],"algorithm,":[139],"well-known":[141],"path":[143,210],"algorithm.":[144],"Upon":[145],"testing":[146],"new":[149],"dataset":[150],"DVRPPDC,":[152],"combined":[155],"FLURRY":[157,196,221],"6.1x":[159,235],"10.6x":[161,237],"faster":[162],"compute":[164],"than":[165],"retraining.":[167],"Furthermore,":[168],"additional":[170],"done":[172,199],"after":[173],"main":[175],"series":[176],"experiments":[178],"reveal":[179],"that":[180],"methodology":[182],"does":[183],"not":[184],"necessitate":[185],"any":[186],"training":[188],"first":[191],"time":[192,214],"step":[193],"all.":[195],"zeroes":[205],"achieve":[207],"same":[209],"output":[211],"traversal":[213],"FLURRY.":[218],"standalone":[220],"algorithm":[222],"further":[223],"speeds":[224],"up":[225],"computation,":[227],"compared":[228],"naive":[231],"approach,":[233],"from":[234],"\u2013":[236,240],"26.5x":[239],"117.5x.":[241]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}