About: Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles

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

About: Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles Goto Sponge Distinct 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
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 (or we do not mind how they return) to the central city. Costs are given for the straight routes between each pair of the cities and represent the time neces-sary 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 [8]. This problem is NP-hard. One of the possibilities how to solve the TLVRP is to use heuristics (approximation methods), and thus to obtain a sufficiently good solution. In this paper we have chosen three of these approximation methods, test them on some different instances and asses the performance of single heuristics depending on the number of vehicles necessary for currying out the desired transportation and number of cities on single routes. 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 (or we do not mind how they return) to the central city. Costs are given for the straight routes between each pair of the cities and represent the time neces-sary 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 [8]. This problem is NP-hard. One of the possibilities how to solve the TLVRP is to use heuristics (approximation methods), and thus to obtain a sufficiently good solution. In this paper we have chosen three of these approximation methods, test them on some different instances and asses the performance of single heuristics depending on the number of vehicles necessary for currying out the desired transportation and number of cities on single routes. (en)
Title	Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles (en)
skos:prefLabel	Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles (en)
skos:notation	RIV/60460709:41110/11:51203!RIV14-MSM-41110___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Kučera, 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á zemědělská univerzita v Praze / Provozně ekonomická fakulta
http://linked.open...dnocenehoVysledku	230539
http://linked.open...ai/riv/idVysledku	RIV/60460709:41110/11:51203
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	time limited vehicle routing problem, vehicle routing problem, traveling salesman problem, heuristics (approximation method) (en)
http://linked.open.../riv/klicoveSlovo	vehicle routing problem heuristics (approximation method) time limited vehicle routing problem traveling salesman problem
http://linked.open...ontrolniKodProRIV	[8F704692B23F]
http://linked.open...v/mistoKonaniAkce	Janská Dolina
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...i/riv/nazevZdroje	29th International Conference on Mathematical Methods in Economics 2011
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Kučera, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	0
http://linked.open.../riv/zahajeniAkce	2011-09-06 (xsd:date)
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Professional Publishing
https://schema.org/isbn	978-80-7431-059-1
http://localhost/t...ganizacniJednotka	41110

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, 110 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software