{"id":"https://openalex.org/W7140186588","doi":"https://doi.org/10.48550/arxiv.2603.21880","title":"Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price","display_name":"Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140186588","doi":"https://doi.org/10.48550/arxiv.2603.21880"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.21880","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21880","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.21880","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bhat, Anoop","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bhat, Anoop","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Gutow, Geordan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gutow, Geordan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Singh, Surya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singh, Surya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Ren, Zhongqiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ren, Zhongqiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Rathinam, Sivakumar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rathinam, Sivakumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Choset, Howie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Choset, Howie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6769999861717224,"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.6769999861717224,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.10130000114440918,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.028699999675154686,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48089998960494995},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4763999879360199},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.42419999837875366},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4228000044822693},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.42149999737739563},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41600000858306885},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3995000123977661},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3937999904155731},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.39309999346733093}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.67330002784729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6614000201225281},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48089998960494995},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4763999879360199},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.42419999837875366},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4228000044822693},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.42149999737739563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3937999904155731},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.39309999346733093},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3634999990463257},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.35670000314712524},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.3434999883174896},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.3190999925136566},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.314300000667572},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.28119999170303345},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2522999942302704},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.21880","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21880","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.21880","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21880","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,84,109],"Moving":[1],"Target":[2],"Vehicle":[3],"Routing":[4],"Problem":[5],"with":[6,52,177],"Obstacles":[7],"(MT-VRP-O)":[8],"seeks":[9],"trajectories":[10],"for":[11,61,70,98,126,197],"several":[12],"agents":[13,37],"that":[14,220],"collectively":[15],"intercept":[16],"a":[17,75,81,89,96,104,192,198,202],"set":[18],"of":[19,91,107,170,187,204,228],"moving":[20,153],"targets.":[21,154],"Each":[22],"target":[23],"has":[24],"one":[25],"or":[26],"more":[27],"time":[28],"windows":[29],"where":[30],"it":[31,147],"must":[32,38],"be":[33],"visited,":[34],"and":[35,42,45,80,208],"the":[36,62,67,115,120,124,134,141,162,168,184],"avoid":[39],"static":[40],"obstacles":[41],"satisfy":[43],"speed":[44],"capacity":[46],"constraints.":[47,180],"We":[48,181,190,218],"introduce":[49],"Lazy":[50,64,155,221],"Branch-and-Price":[51],"Relaxed":[53],"Continuity":[54],"(Lazy":[55],"BPRC),":[56],"which":[57,72],"finds":[58],"optimal":[59],"solutions":[60],"MT-VRP-O.":[63],"BPRC":[65,156,222],"applies":[66],"branch-and-price":[68],"framework":[69],"VRPs,":[71],"alternates":[73],"between":[74,152],"restricted":[76],"master":[77],"problem":[78,111],"(RMP)":[79],"pricing":[82,110],"problem.":[83],"RMP":[85,121,163],"aims":[86],"to":[87,101,114,129,225],"select":[88],"sequence":[90],"target-time":[92],"window":[93],"pairings":[94],"(called":[95],"tour)":[97],"each":[99,131,171],"agent":[100,128],"follow,":[102],"from":[103],"limited":[105,116,135],"subset":[106],"tours.":[108],"adds":[112],"tours":[113,188],"subset.":[117,136],"Conventionally,":[118],"solving":[119,161],"requires":[122,148],"computing":[123],"cost":[125,158,194],"an":[127,226],"follow":[130],"tour":[132],"in":[133,140],"Computing":[137],"these":[138],"costs":[139,169,186],"MT-VRP-O":[142],"is":[143],"computationally":[144],"intensive,":[145],"since":[146],"collision-free":[149],"motion":[150,175],"planning":[151,176],"defers":[157],"computations":[159],"by":[160,195],"using":[164,213],"lower":[165],"bounds":[166],"on":[167,201],"tour,":[172],"computed":[173],"via":[174],"relaxed":[178],"continuity":[179,215],"lazily":[182],"evaluate":[183],"true":[185],"as-needed.":[189],"compute":[191],"tour's":[193],"searching":[196],"shortest":[199],"path":[200],"Graph":[203],"Convex":[205],"Sets":[206],"(GCS),":[207],"we":[209],"accelerate":[210],"this":[211],"search":[212],"our":[214],"relaxation":[216],"method.":[217],"demonstrate":[219],"runs":[223],"up":[224],"order":[227],"magnitude":[229],"faster":[230],"than":[231],"two":[232],"ablations.":[233]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-25T00:00:00"}