A vehicle routing improvement algorithm comparison of a ''greedy'' and a matching implementation for inventory routing (Q1820686)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3995439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A vehicle routing improvement algorithm comparison of a ''greedy'' and a matching implementation for inventory routing |
scientific article; zbMATH DE number 3995439 |
Statements
A vehicle routing improvement algorithm comparison of a ''greedy'' and a matching implementation for inventory routing (English)
0 references
1986
0 references
Given an initial solution to a vehicle routing problem - (VRP) - we present three heuristic route improvement schemes based on the concept of node interchange between different routes. Three algorithms are presented together with their computational performance when applied to an inventory routing problem for 12 consecutive weekly periods. All three procedures improve the initial solution constructed by a modified Clark and Wright algorithm by over 50 \% as measured by the change in the value of the objective function. In two of the algorithms a minimum weight matching problem is solved repetitively.
0 references
vehicle routing
0 references
heuristic route improvement schemes
0 references
minimum weight matching
0 references
0.8302602767944336
0 references
0.8181294798851013
0 references
0.8005547523498535
0 references
0.798717200756073
0 references
