{"id":"https://openalex.org/W7129382550","doi":"https://doi.org/10.48550/arxiv.2602.14652","title":"Temporally Flexible Transport Scheduling on Networks with Departure-Arrival Constriction and Nodal Capacity Limits","display_name":"Temporally Flexible Transport Scheduling on Networks with Departure-Arrival Constriction and Nodal Capacity Limits","publication_year":2026,"publication_date":"2026-02-16","ids":{"openalex":"https://openalex.org/W7129382550","doi":"https://doi.org/10.48550/arxiv.2602.14652"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.14652","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126242739","display_name":"Anqi Dong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dong, Anqi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126203668","display_name":"Karl H. Johansson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johansson, Karl H.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126182912","display_name":"Johan Karlsson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karlsson, Johan","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14637664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.36730000376701355,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.36730000376701355,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.15199999511241913,"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.09830000251531601,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/uniqueness","display_name":"Uniqueness","score":0.6104999780654907},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5175999999046326},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4293999969959259},{"id":"https://openalex.org/keywords/transit-time","display_name":"Transit time","score":0.3971000015735626},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.38100001215934753},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.33230000734329224},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.32839998602867126},{"id":"https://openalex.org/keywords/retard","display_name":"Retard","score":0.3269999921321869}],"concepts":[{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.6104999780654907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5913000106811523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5720999836921692},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5175999999046326},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4293999969959259},{"id":"https://openalex.org/C3018129524","wikidata":"https://www.wikidata.org/wiki/Q7834377","display_name":"Transit time","level":2,"score":0.3971000015735626},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.38100001215934753},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.33230000734329224},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3319999873638153},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C2777131613","wikidata":"https://www.wikidata.org/wiki/Q18394147","display_name":"Retard","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.30300000309944153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2939999997615814},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.14652","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.14652","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.14652","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.14652","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,112],"investigate":[1],"the":[2,35,127,133,142,147,176,191,195,206],"optimal":[3,123],"transport":[4,124],"(OT)":[5],"problem":[6,178],"over":[7,161],"networks,":[8],"wherein":[9],"supply":[10],"and":[11,26,51,61,79,92,98,144,159],"demand":[12],"are":[13,95],"conceptualized":[14],"as":[15,67],"temporal":[16],"marginals":[17],"governing":[18],"departure":[19,91],"rates":[20,28,94],"of":[21,146,165,175,190,194,212],"particles":[22],"from":[23],"source":[24,78],"nodes":[25],"arrival":[27,93],"at":[29,47,53,63,77],"sink":[30,80],"nodes.":[31],"This":[32],"setting":[33],"extends":[34],"classical":[36],"OT":[37,115,135],"framework,":[38],"where":[39,90,103],"all":[40],"mass":[41],"is":[42,109],"conventionally":[43],"assumed":[44],"to":[45,179,197],"depart":[46],"$t":[48,54],"=":[49,55],"0$":[50],"arrive":[52],"t_f$.":[56],"Our":[57,201],"generalization":[58],"accommodates":[59],"departures":[60],"arrivals":[62],"specified":[64],"times,":[65],"referred":[66],"departure--arrival(DA)":[68],"constraints.":[69],"In":[70],"particular,":[71],"we":[72,140,153,171],"impose":[73],"nodal-temporal":[74],"flux":[75],"constraints":[76,119],"nodes,":[81],"characterizing":[82],"two":[83],"distinct":[84],"scenarios:":[85],"(i)":[86],"Independent":[87],"DA":[88,101,118,129],"constraints,":[89,102],"prescribed":[96,163],"independently,":[97],"(ii)":[99],"Coupled":[100],"each":[104],"particle's":[105],"transportation":[106],"time":[107],"span":[108],"explicitly":[110],"specified.":[111],"establish":[113],"that":[114],"with":[116,132],"independent":[117],"admits":[120],"a":[121,155,162,168],"multi-marginal":[122,185],"formulation,":[125],"while":[126],"coupled":[128],"case":[130],"aligns":[131],"unequal-dimensional":[134],"framework.":[136],"For":[137,150],"line":[138],"graphs,":[139,152],"analyze":[141],"existence":[143],"uniqueness":[145],"solution":[148],"path.":[149],"general":[151],"use":[154,189],"constructive":[156],"path-based":[157],"reduction":[158],"optimize":[160],"set":[164],"paths.":[166],"From":[167],"computational":[169],"perspective,":[170],"consider":[172],"entropic":[173],"regularization":[174],"original":[177],"efficiently":[180],"provide":[181],"solutions":[182],"based":[183],"on":[184],"Sinkhorn":[186],"method,":[187],"making":[188],"graphical":[192],"structure":[193],"cost":[196],"further":[198,204],"improve":[199],"scalability.":[200],"numerical":[202],"simulation":[203],"illustrates":[205],"linear":[207],"convergence":[208],"rate":[209],"in":[210],"terms":[211],"marginal":[213],"violation.":[214]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-18T00:00:00"}