Agents Towards Vehicle Routing Problem with Time Windows

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

Agents Towards Vehicle Routing Problem with Time Windows

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/LD12044" target="_blank" >LD12044: Agent-based Computing for Autonomic Road Transport Support Systems</a><br>

Continuities

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

Publication year

2015

Confidentiality

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

Name of the periodical

Journal of Intelligent Transportation Systems

ISSN

1547-2450

e-ISSN

—

Volume of the periodical

19

Issue of the periodical within the volume

1

Country of publishing house

GB - UNITED KINGDOM

Number of pages

15

Pages from-to

3-17

UT code for WoS article

000350110900002

EID of the result in the Scopus database

2-s2.0-84924044169