Implementation techniques for the vehicle routing problem

DOI10.1016/0305-0548(85)90026-7MaRDI QIDQ1086140zbMATH OpenOpenAlexFDO

Authors Marvin D. Nelson, Kendall E. Nygard, J. H. Griffin, W. E. Shreve

Publication date 1985

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(85)90026-7

zbMATH Keywords

Clarke-Wright algorithmlarge test problemsvehicle routing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Review text

Six methods for implementing the widely used Clarke-Wright algorithm for the vehicle routing problem (VRP) ae presented and compared. Fifty-five large test problems are used to compare the methods. The methods involve alternative ways to access adjacency information in both low and high density problems. The results clearly establish methods of choice for VRP problems with given characteristics.

Recommendations

• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• The savings algorithm for the vehicle routing problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• A guide to vehicle routing heuristics
• The vehicle routing problem

Cites work

• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Computer Solutions of the Traveling Salesman Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Implementing vehicle routing algorithms
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(14)

• The vehicle routing problem: An overview of exact and approximate algorithms
• Planning models for freight transportation
• A heuristic solution to the warehouse location-routing problem
• A parametric analysis of heuristics for the vehicle routing problem with side-constraints
• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• Heuristic methods and applications: A categorized survey
• Routing problems: A bibliography
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Vehicle routing problem in real case application
• Human solution strategies for the vehicle routing problem: experimental findings and a choice-based theory
• Vehicle Routing
• Applying an intensification strategy on vehicle routing problem
• The ALGACEA‐1 method for the capacitated vehicle routing problem
• An improved model for estimating optimal VRP solution values

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Implementation techniques for the vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086140)