The article presents a practicle approach to a vehicle routing problem. From a single depot several clients are served by equally capacitated vehicles. The total distance per vehicle is limited and the overall distance is minimized. This NP-hard problem is attacked by a branch-and-cut algorithm. A lot of numerical results are given for problems ranging from 15 to 95 customers. In the examples some modifications of the solution methods are compared to give an overview on the effectiveness of the approach.
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A new subtour elimination constraint for the vehicle routing problem
- scientific article; zbMATH DE number 3648431 (Why is no real title available?)
- scientific article; zbMATH DE number 3912104 (Why is no real title available?)
- scientific article; zbMATH DE number 1234739 (Why is no real title available?)
- On the vehicle routing problem
- Optimal Routing under Capacity and Distance Restrictions
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- The savings algorithm for the vehicle routing problem
- The traveling salesman problem: An overview of exact and approximate algorithms
Cited in
(32)- Vehicle routing with a sparse feasibility graph
- A branch-and-cut algorithm for vehicle routing problems
- A decision support system for a real vehicle routing problem.
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
- The driver and vehicle routing problem
- The stop number minimization problem: complexity and polyhedral analysis
- The vehicle routing problem with service level constraints
- The demand weighted vehicle routing problem
- Transportation problem on a graph
- Variants and formulations of the vehicle routing problem
- Vehicle routing problem in real case application
- The vehicle routing problem
- Exact algorithms for a selective vehicle routing problem where the longest route is minimized
- Solution of a min-max vehicle routing problem
- Vehicle Routing
- On a periodic vehicle routing problem
- The Skill Vehicle Routing Problem
- Brief note a routing problem for a plant nursery
- On a Labeled Vehicle Routing Problem
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- Vehicle Routing Problems with Inter-Tour Resource Constraints
- Optimal Routing under Capacity and Distance Restrictions
- scientific article; zbMATH DE number 3984951 (Why is no real title available?)
- scientific article; zbMATH DE number 1301848 (Why is no real title available?)
- On the vehicle routing problem
- A generalized exchange heuristic for the capacitated vehicle routing problem
- A Heuristic for Vehicle Routeing and Depot Staffing
- Algorithms and Data Structures
- On distributed solving of the capacitated vehicle routing problem with branch-and-cut algorithms
- scientific article; zbMATH DE number 956786 (Why is no real title available?)
- The rendezvous vehicle routing problem
- Polyhedral study of the capacitated vehicle routing problem
This page was built for publication: On the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378935)
