About: Parallel Solver for Vehicle Routing and Pickup and Delivery Problems 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)

AttributesValues
rdf:type
Description
  • In this paper we present a parallel solver for the vehicle routing problem with time windows (VRPTW) and the pickup and delivery problem with time windows (PDPTW). The solver is based on parallel competition of particular solvers solving the given problem instance. The particular solvers are based on negotiation between a fleet of agents representing individual vehicles using a cost structure corresponding to the well-known travel time savings insertion heuristic. The performance of the solver is assessed on the Homberger-Gehring and Li-Lim benchmark sets for the VRPTW and PDPTW case respectively. While both sets are widely used across the routing community, they were not addressed by previous agent-based studies. Thus the achieved average solution quality of 95% and 87% for the VRPTW and PDPTW cases represents a new best known result for these benchmark sets for agent-based approaches. An analysis of the solver's convergence, runtime and parameter sensitivity is provided within the experimental evaluation section that has also not been provided by previous agent-based studies.
  • In this paper we present a parallel solver for the vehicle routing problem with time windows (VRPTW) and the pickup and delivery problem with time windows (PDPTW). The solver is based on parallel competition of particular solvers solving the given problem instance. The particular solvers are based on negotiation between a fleet of agents representing individual vehicles using a cost structure corresponding to the well-known travel time savings insertion heuristic. The performance of the solver is assessed on the Homberger-Gehring and Li-Lim benchmark sets for the VRPTW and PDPTW case respectively. While both sets are widely used across the routing community, they were not addressed by previous agent-based studies. Thus the achieved average solution quality of 95% and 87% for the VRPTW and PDPTW cases represents a new best known result for these benchmark sets for agent-based approaches. An analysis of the solver's convergence, runtime and parameter sensitivity is provided within the experimental evaluation section that has also not been provided by previous agent-based studies. (en)
Title
  • Parallel Solver for Vehicle Routing and Pickup and Delivery Problems with Time Windows Based on Agent Negotiation
  • Parallel Solver for Vehicle Routing and Pickup and Delivery Problems with Time Windows Based on Agent Negotiation (en)
skos:prefLabel
  • Parallel Solver for Vehicle Routing and Pickup and Delivery Problems with Time Windows Based on Agent Negotiation
  • Parallel Solver for Vehicle Routing and Pickup and Delivery Problems with Time Windows Based on Agent Negotiation (en)
skos:notation
  • RIV/68407700:21230/12:00194083!RIV13-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(LD12044), Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 157767
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/12:00194083
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • VRPTW; PDPTW; Agents; Parallelization; Benchmarks (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [B37955D225FC]
http://linked.open...v/mistoKonaniAkce
  • Soul
http://linked.open...i/riv/mistoVydani
  • New York
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 2012 IEEE International Conference on Systems, Man, and Cybernetics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kalina, Petr
  • Vokřínek, Jiří
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE - Systems, Man, and Cybernetics Society
https://schema.org/isbn
  • 978-1-4673-1713-9
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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