Agents Towards Vehicle Routing Problem with Time Windows

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00207020" target="_blank" >RIV/68407700:21230/15:00207020 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.tandfonline.com/doi/pdf/10.1080/15472450.2014.889953" target="_blank" >http://www.tandfonline.com/doi/pdf/10.1080/15472450.2014.889953</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1080/15472450.2014.889953" target="_blank" >10.1080/15472450.2014.889953</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Agents Towards Vehicle Routing Problem with Time Windows

Popis výsledku v původním jazyce

We suggest an efficient polynomial algorithm for the vehicle routing problem with time windows (VRPTW) based on agent negotiation. A generic agent decomposition of the problem is introduced featuring a clear separation between the local planning performed by the individual vehicles and the abstract global coordination achieved by negotiation --- differentiating the presented algorithm from the classical centralized algorithms. The semantic of the abstract negotiation process is discussed as well as thetwo alternative local planning strategies used by the individual vehicles. A relevant comparison to the state-of-the-art classical and agent-based algorithms is provided missing from most previous agent-based studies. The algorithm performs slightly worse than the state-of-the-art classical algorithms but improves on all the previous comparable agent-based algorithms.

Název v anglickém jazyce

Agents Towards Vehicle Routing Problem with Time Windows

Popis výsledku anglicky

We suggest an efficient polynomial algorithm for the vehicle routing problem with time windows (VRPTW) based on agent negotiation. A generic agent decomposition of the problem is introduced featuring a clear separation between the local planning performed by the individual vehicles and the abstract global coordination achieved by negotiation --- differentiating the presented algorithm from the classical centralized algorithms. The semantic of the abstract negotiation process is discussed as well as thetwo alternative local planning strategies used by the individual vehicles. A relevant comparison to the state-of-the-art classical and agent-based algorithms is provided missing from most previous agent-based studies. The algorithm performs slightly worse than the state-of-the-art classical algorithms but improves on all the previous comparable agent-based algorithms.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/LD12044" target="_blank" >LD12044: Agentní algoritmy pro autonomní podpůrné systémy v pozemní dopravě</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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 periodika

Journal of Intelligent Transportation Systems

ISSN

1547-2450

e-ISSN

—

Svazek periodika

19

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

15

Strana od-do

3-17

Kód UT WoS článku

000350110900002

EID výsledku v databázi Scopus

2-s2.0-84924044169