{"id":"https://openalex.org/W7161119954","doi":"https://doi.org/10.48550/arxiv.2605.13035","title":"Conveyor Parcel Routing with Order-Contiguous Arrivals","display_name":"Conveyor Parcel Routing with Order-Contiguous Arrivals","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161119954","doi":"https://doi.org/10.48550/arxiv.2605.13035"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13035","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13035","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.2605.13035","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110924760","display_name":"Takuro Kato","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kato, Takuro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038362443","display_name":"Keisuke Okumura","orcid":"https://orcid.org/0000-0002-9491-7367"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Okumura, Keisuke","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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.384799987077713,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.384799987077713,"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.32820001244544983,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.1298999935388565,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6640999913215637},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6176000237464905},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6050000190734863},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5810999870300293},{"id":"https://openalex.org/keywords/downstream","display_name":"Downstream (manufacturing)","score":0.5389000177383423},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5385000109672546},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.430400013923645},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.3765000104904175}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7038999795913696},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6640999913215637},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6176000237464905},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6050000190734863},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5810999870300293},{"id":"https://openalex.org/C2776207758","wikidata":"https://www.wikidata.org/wiki/Q5303302","display_name":"Downstream (manufacturing)","level":2,"score":0.5389000177383423},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.46939998865127563},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46470001339912415},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3765000104904175},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30160000920295715},{"id":"https://openalex.org/C2780927502","wikidata":"https://www.wikidata.org/wiki/Q577998","display_name":"Conveyor system","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.2671999931335449},{"id":"https://openalex.org/C2781468064","wikidata":"https://www.wikidata.org/wiki/Q1267117","display_name":"Lead time","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.25679999589920044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13035","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13035","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.2605.13035","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13035","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":{"In":[0],"warehouse":[1],"logistics,":[2],"parcels":[3,37],"released":[4],"from":[5,127],"the":[6,40,50],"outfeed":[7],"of":[8,30],"an":[9,27],"automated":[10],"storage":[11],"system":[12],"must":[13,43],"be":[14],"routed":[15],"through":[16],"conveyor":[17],"networks":[18],"to":[19,39,53,136],"workstations.":[20],"Beyond":[21],"collision":[22],"avoidance,":[23],"practical":[24,132],"operations":[25],"impose":[26],"additional":[28],"requirement":[29],"order-contiguous":[31],"arrivals:":[32],"at":[33],"each":[34],"delivery":[35],"point,":[36],"belonging":[38],"same":[41],"order":[42],"arrive":[44],"as":[45,62],"a":[46,93,98],"consecutive":[47],"block":[48],"in":[49],"arrival":[51,105],"sequence":[52],"reduce":[54],"downstream":[55],"re-sorting":[56],"effort.":[57],"We":[58],"formalize":[59],"this":[60],"problem":[61],"online":[63,85],"multi-agent":[64],"path":[65],"finding":[66],"with":[67,97],"order-contiguity":[68],"(online":[69],"MAPF-OC),":[70],"where":[71],"agents":[72],"(i.e.,":[73],"parcels)":[74],"appear":[75],"over":[76],"time":[77,142],"and":[78,111,134],"exit":[79],"upon":[80],"delivery.":[81],"To":[82],"efficiently":[83],"solve":[84],"MAPF-OC,":[86],"we":[87],"propose":[88],"Dual-Ordering":[89],"Prioritized":[90],"Planning":[91],"(DOPP),":[92],"complete":[94],"polynomial-time":[95],"algorithm":[96],"three-level":[99],"structure":[100],"that":[101],"(i)":[102],"searches":[103],"order-level":[104],"sequences,":[106],"(ii)":[107],"refines":[108],"agent-level":[109],"priorities,":[110],"(iii)":[112],"synthesizes":[113],"feasible":[114],"solutions":[115],"via":[116],"prioritized":[117],"planning.":[118],"Experiments":[119],"on":[120],"various":[121],"conveyor-network":[122],"layouts,":[123],"including":[124],"those":[125],"derived":[126],"actual":[128],"warehouses,":[129],"demonstrate":[130],"DOPP's":[131],"scalability":[133],"ability":[135],"generate":[137],"high-quality":[138],"plans":[139],"within":[140],"tight":[141],"budgets.":[143]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-15T00:00:00"}