This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n8http://purl.org/net/nknouf/ns/bibtex#
n23http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n24http://linked.opendata.cz/resource/domain/vavai/subjekt/
n5http://linked.opendata.cz/ontology/domain/vavai/
n6https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n7http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F13%3A00206970%21RIV14-MSM-21230___/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F13%3A00206970%21RIV14-MSM-21230___
rdf:type
n5:Vysledek skos:Concept
rdfs:seeAlso
http://link.springer.com/chapter/10.1007%2F978-3-642-40090-2_17
dcterms:description
We present an ongoing effort in developing efficient agent-based algorithms for solving the vehicle routing problem with time windows. An abstract algorithm based on a generic agent decomposition of the problem is introduced featuring a clear separation between the local planning performed by the individual vehicles and the global coordination achieved by negotiation. The semantics of the underlying negotiation process is discussed as well as the alternative local planning strategies used by the individual vehicles. Finally a parallel version of the algorithm is presented based on efficient search diversification and intensification strategies. The presented effort is relevant namely for (i) yielding results significantly improving on all previous agent-based studies, (ii) the inclusion of relevant widely-used benchmarks missing from these studies and (iii) the breadth and depth of the provided evidence and analysis including relevant comparison to the state-of-the-art centralized solvers. We present an ongoing effort in developing efficient agent-based algorithms for solving the vehicle routing problem with time windows. An abstract algorithm based on a generic agent decomposition of the problem is introduced featuring a clear separation between the local planning performed by the individual vehicles and the global coordination achieved by negotiation. The semantics of the underlying negotiation process is discussed as well as the alternative local planning strategies used by the individual vehicles. Finally a parallel version of the algorithm is presented based on efficient search diversification and intensification strategies. The presented effort is relevant namely for (i) yielding results significantly improving on all previous agent-based studies, (ii) the inclusion of relevant widely-used benchmarks missing from these studies and (iii) the breadth and depth of the provided evidence and analysis including relevant comparison to the state-of-the-art centralized solvers.
dcterms:title
The Art of Negotiation: Developing Efficient Agent-Based Algorithms for Solving Vehicle Routing Problem with Time Windows The Art of Negotiation: Developing Efficient Agent-Based Algorithms for Solving Vehicle Routing Problem with Time Windows
skos:prefLabel
The Art of Negotiation: Developing Efficient Agent-Based Algorithms for Solving Vehicle Routing Problem with Time Windows The Art of Negotiation: Developing Efficient Agent-Based Algorithms for Solving Vehicle Routing Problem with Time Windows
skos:notation
RIV/68407700:21230/13:00206970!RIV14-MSM-21230___
n5:predkladatel
n24:orjk%3A21230
n3:aktivita
n15:S n15:P
n3:aktivity
P(LD12044), S
n3:dodaniDat
n17:2014
n3:domaciTvurceVysledku
n4:7393199 n4:4346785 n4:9724699
n3:druhVysledku
n20:D
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
62108
n3:idVysledku
RIV/68407700:21230/13:00206970
n3:jazykVysledku
n22:eng
n3:klicovaSlova
Multi-Agent Systems; Transportation Logistics; Optimization
n3:klicoveSlovo
n18:Optimization n18:Multi-Agent%20Systems n18:Transportation%20Logistics
n3:kontrolniKodProRIV
[957D6B8F9DCC]
n3:mistoKonaniAkce
Prague
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Proceedings of the 6th International Conference on Industrial Applications of Holonic and Multi-Agent Systems
n3:obor
n11:JC
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n23:LD12044
n3:rokUplatneniVysledku
n17:2013
n3:tvurceVysledku
Vokřínek, Jiří Mařík, Vladimír Kalina, Petr
n3:typAkce
n21:EUR
n3:zahajeniAkce
2013-08-26+02:00
s:issn
0302-9743
s:numberOfPages
12
n7:doi
10.1007/978-3-642-40090-2_17
n8:hasPublisher
Springer-Verlag
n6:isbn
978-3-642-40089-6
n19:organizacniJednotka
21230