Approximation Algorithms for the Load-Balanced Capacitated Vehicle Routing Problem
نویسندگان
چکیده
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملApproximation algorithms for a vehicle routing problem
In this paper we investigate a vehicle routing problem motivated by a realworld application in cooperation with the German Automobile Association (ADAC). The general task is to assign service requests to service units and to plan tours for the units such as to minimize the overall cost. The characteristics of this large-scale problem due to the data volume involve strict real-time requirements....
متن کاملImproved Approximation Algorithms for the Capacitated Multicast Routing Problem
For the Capacitated Multicast Routing Problem, we considered two models which are the Multicast k-Path Routing and the Multicast k-Tree Routing. We presented two improved approximation algorithms for them, which have worst case performance ratios of 3 and (2 + ρ) (ρ is the best approximation ratio for the Steiner Tree problem, and is about 1.55), respectively, thus improving upon the previous b...
متن کاملHeuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem
The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot...
متن کاملHeuristic Methods for Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is a well known problem in the optimization literature. In this paper, we consider that there is a single depot (or distribution centre) that caters to the customer demands at a set of sales points (or demand centers) using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Iranian Mathematical Society
سال: 2020
ISSN: 1017-060X,1735-8515
DOI: 10.1007/s41980-020-00440-3