Implementation techniques for the vehicle routing problem (Q1086140): Difference between revisions

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.

0 references

Mathematics Subject Classification ID

90B35

0 references

0 references

0 references

0 references

Clarke-Wright algorithm

0 references

vehicle routing

0 references

large test problems

0 references

describes a project that uses

VRP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0305-0548(85)90026-7

0 references

OpenAlex ID

W2081361162

0 references

cites work

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

An Integer Programming Approach to the Vehicle Scheduling Problem

0 references

A Heuristic Algorithm for the Vehicle-Dispatch Problem

0 references

Implementing vehicle routing algorithms

0 references

A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme

0 references

Q4195901

0 references

Q5585020

0 references

Computer Solutions of the Traveling Salesman Problem

0 references

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1086140

@@ Property / describes a project that uses @@
+VRP
@@ Property / describes a project that uses: VRP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(85)90026-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2081361162
@@ Property / OpenAlex ID: W2081361162 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+An Integer Programming Approach to the Vehicle Scheduling Problem
+Normal rank
@@ Property / cites work @@
+A Heuristic Algorithm for the Vehicle-Dispatch Problem
+Normal rank
@@ Property / cites work @@
+Implementing vehicle routing algorithms
@@ Property / cites work: Implementing vehicle routing algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
+Normal rank
@@ Property / cites work @@
+Q4195901
@@ Property / cites work: Q4195901 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1086140