On-demand Robotic Fleet Routing in Capacitated Networks with Time-varying Transportation Demand

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00347055" target="_blank" >RIV/68407700:21230/21:00347055 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.5220/0010261009070915" target="_blank" >https://doi.org/10.5220/0010261009070915</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.5220/0010261009070915" target="_blank" >10.5220/0010261009070915</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On-demand Robotic Fleet Routing in Capacitated Networks with Time-varying Transportation Demand

Popis výsledku v původním jazyce

In large-scale automated mobility-on-demand systems, the fleet manager is able to assign routes to individual automated vehicles in a way that minimizes formation of congestion. We formalize the problem of on-demand fleet routing in capacitated networks with time-varying demand. We demonstrate the limits of application of the steady-state flows approach in systems with time-varying demand and formulate a linear program to compute congestion-free routes for the vehicles in capacitated networks under time-varying demand. We evaluate the proposed approach in the simulation of a simplified, but characteristic illustrative example. The experiment reveals that the proposed routing approach can route 42% more traffic in congestion-free regime than the steady-state flow approach through the same network.

Název v anglickém jazyce

On-demand Robotic Fleet Routing in Capacitated Networks with Time-varying Transportation Demand

Popis výsledku anglicky

In large-scale automated mobility-on-demand systems, the fleet manager is able to assign routes to individual automated vehicles in a way that minimizes formation of congestion. We formalize the problem of on-demand fleet routing in capacitated networks with time-varying demand. We demonstrate the limits of application of the steady-state flows approach in systems with time-varying demand and formulate a linear program to compute congestion-free routes for the vehicles in capacitated networks under time-varying demand. We evaluate the proposed approach in the simulation of a simplified, but characteristic illustrative example. The experiment reveals that the proposed routing approach can route 42% more traffic in congestion-free regime than the steady-state flow approach through the same network.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Výzkumné centrum informatiky</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 13th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART

ISBN

978-989-758-484-8

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

907-915

Název nakladatele

SCITEPRESS – Science and Technology Publications, Lda

Místo vydání

Lisboa

Místo konání akce

Vídeň

Datum konání akce

4. 2. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000661455800101