About: An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows based on Agent Negotiation

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows based on Agent Negotiation Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://link.springer.com/chapter/10.1007/978-3-642-44927-7_11
Description	We present an efficient route minimization algorithm for the vehicle routing problem with time windows. The algorithm uses a generic agent decomposition of the problem 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 traditional centralized algorithms. A novel negotiation semantics is introduced on the global coordination planning level allowing customers to be temporarily ejected from the emerging solution being constructed. This allows the algorithm to efficiently backtrack in situations when the currently processed customer cannot be feasibly allocated to the emerging solution. Over the relevant widely-used benchmarks the algorithm equals the best known solutions achieved by the centralized algorithms in 90.7% of the cases with an overall relative error of 0.3%, outperforming the previous comparable agent-based algorithms. We present an efficient route minimization algorithm for the vehicle routing problem with time windows. The algorithm uses a generic agent decomposition of the problem 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 traditional centralized algorithms. A novel negotiation semantics is introduced on the global coordination planning level allowing customers to be temporarily ejected from the emerging solution being constructed. This allows the algorithm to efficiently backtrack in situations when the currently processed customer cannot be feasibly allocated to the emerging solution. Over the relevant widely-used benchmarks the algorithm equals the best known solutions achieved by the centralized algorithms in 90.7% of the cases with an overall relative error of 0.3%, outperforming the previous comparable agent-based algorithms. (en)
Title	An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows based on Agent Negotiation An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows based on Agent Negotiation (en)
skos:prefLabel	An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows based on Agent Negotiation An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows based on Agent Negotiation (en)
skos:notation	RIV/68407700:21230/13:00207017!RIV14-MSM-21230___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(TE01020197), S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Vokřínek, Jiří Mařík, Vladimír Kalina, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	60331
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00207017
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Multi-Agent Systems; Optimization; Logistics; VRPTW (en)
http://linked.open.../riv/klicoveSlovo	VRPTW Logistics Optimization Multi-Agent Systems
http://linked.open...ontrolniKodProRIV	[74FE939FF3B7]
http://linked.open...v/mistoKonaniAkce	Dunedin
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Proceedings of the 16th International Conference on Principles and Practice of Multi-Agent Systems
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Centre for Applied Cybernetics 3
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Kalina, Petr Vokřínek, Jiří Mařík, Vladimír
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-12-01 (xsd:date)
issn	0302-9743
number of pages	16 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-44927-7_11
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-44926-0
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software