"CZ - \u010Cesk\u00E1 republika" . . . . . "time limited vehicle routing problem, vehicle routing problem, traveling salesman problem, savings"@en . "131252" . "41110" . . "S" . . "DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM"@en . "1211-8516" . "LX" . "0" . "Ku\u010Dera, Petr" . . "The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main diff erence is that the routes are paths (not cycles), i.e. vehicles do not return to the central city (or at least we do not observe their way back). 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 times for all routes is to be minimized. This problem is NP-hard. There are many various possibilities how to design the heuristics (approximation methods) to solve it. One of the ways of how to obtain an approximation method for the TLVRP is to modify the famous savings method by Clark and Wright (1964) for this purpose. In this paper we suggest several diff erent versions of this method, test them in some instances, and evaluate and mutually compare the results of individual versions."@en . . . "DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM" . "7" . . "[08D943321317]" . "Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis" . "The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main diff erence is that the routes are paths (not cycles), i.e. vehicles do not return to the central city (or at least we do not observe their way back). 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 times for all routes is to be minimized. This problem is NP-hard. There are many various possibilities how to design the heuristics (approximation methods) to solve it. One of the ways of how to obtain an approximation method for the TLVRP is to modify the famous savings method by Clark and Wright (1964) for this purpose. In this paper we suggest several diff erent versions of this method, test them in some instances, and evaluate and mutually compare the results of individual versions." . "RIV/60460709:41110/12:55968" . "1"^^ . . . "8"^^ . . . "DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM" . "1"^^ . . . "RIV/60460709:41110/12:55968!RIV13-MSM-41110___" . "DIFFERENT VERSIONS OF THE SAVINGS METHOD FOR THE TIME LIMITED VEHICLE ROUTING PROBLEM"@en .