"time limited vehicle routing problem, vehicle routing problem, traveling salesman problem, heuristics (approximation method)"@en . . "[8F704692B23F]" . "Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles"@en . "Professional Publishing" . . "978-80-7431-059-1" . "29th International Conference on Mathematical Methods in Economics 2011" . . "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." . . "230539" . "0" . . "S" . "1"^^ . . . . . "1"^^ . "Ku\u010Dera, Petr" . "Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles"@en . . "41110" . . "2011-09-06+02:00"^^ . . "RIV/60460709:41110/11:51203!RIV14-MSM-41110___" . . . "Praha" . "RIV/60460709:41110/11:51203" . . "Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles" . "6"^^ . "Solution of the Time Limited Vehicle Routing Problem by Dif-ferent Approximation Methods Depending on the Number of Necessary Vehicles" . . "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 . "Jansk\u00E1 Dolina" . .