Vehicle routing via column generation (Q1058983)
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 3902390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vehicle routing via column generation |
scientific article; zbMATH DE number 3902390 |
Statements
Vehicle routing via column generation (English)
0 references
1985
0 references
This paper explores an approximate method for solving a routing problem in a four-level distribution which has ''double-ended'' demand. Routes are represented as columns in a linear program and column generation is used to improve the solution by generating new routes. The generation of new routes is based on an LP subproblem. Its solution is rounded down to integer values to insure its feasibility as a route for inclusion in the restricted master problem. Finally, an illustrative problem is solved.
0 references
vehicle routing
0 references
column generation
0 references
double-ended demand
0 references
approximate method
0 references
four-level distribution
0 references
0 references
0.8301056027412415
0 references
0.8274253606796265
0 references
0.8237675428390503
0 references
0.8194584846496582
0 references
