About: Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem     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
  • The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main difference is that the routes are paths (not cycles), i.e. vehicles do not return to the central city. Costs are given for the straight routes between each pair of the cities and represent the time necessary for going through. Each path must not exceed a given time limit. The sum of time for all routes is to be minimized. For the exact definition see [7]. This problem is NP-hard. There are many various possibilities how to design heuris-tics (approximation methods) to solve it. One of the ways how to obtain heuristics for the TLVRP is to modify the famous savings method by Clark and Wright for this purpose. In this paper several different versions of this method are suggested, tested on some instances, and the results of single versions are evaluated and mutually compared.
  • The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main difference is that the routes are paths (not cycles), i.e. vehicles do not return to the central city. Costs are given for the straight routes between each pair of the cities and represent the time necessary for going through. Each path must not exceed a given time limit. The sum of time for all routes is to be minimized. For the exact definition see [7]. This problem is NP-hard. There are many various possibilities how to design heuris-tics (approximation methods) to solve it. One of the ways how to obtain heuristics for the TLVRP is to modify the famous savings method by Clark and Wright for this purpose. In this paper several different versions of this method are suggested, tested on some instances, and the results of single versions are evaluated and mutually compared. (en)
Title
  • Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem
  • Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem (en)
skos:prefLabel
  • Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem
  • Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem (en)
skos:notation
  • RIV/60460709:41110/10:47920!RIV15-MSM-41110___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
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
  • 254376
http://linked.open...ai/riv/idVysledku
  • RIV/60460709:41110/10:47920
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • time limited vehicle routing problem, vehicle routing problem, traveling salesman problem, savings method (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1D9454816874]
http://linked.open...v/mistoKonaniAkce
  • České Budějovice
http://linked.open...i/riv/mistoVydani
  • České Budějovice
http://linked.open...i/riv/nazevZdroje
  • MME 2010
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kučera, Petr
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 0
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Jihočeská univerzita v Českých Budějovicích
https://schema.org/isbn
  • 978-80-7394-218-2
http://localhost/t...ganizacniJednotka
  • 41110
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software