A new ILP-based refinement heuristic for vehicle routing problems (Q2583137)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new ILP-based refinement heuristic for vehicle routing problems |
scientific article; zbMATH DE number 2246761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new ILP-based refinement heuristic for vehicle routing problems |
scientific article; zbMATH DE number 2246761 |
Statements
A new ILP-based refinement heuristic for vehicle routing problems (English)
0 references
13 January 2006
0 references
Vehicle Routing Problems
0 references
Heuristics
0 references
Large Neighborhood Search
0 references
Computational Analysis
0 references
Distance-Constrained Vehicle Routing Problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8312721848487854
0 references
0.7925418019294739
0 references
0.7755914926528931
0 references
0.771665096282959
0 references
0.7704892754554749
0 references
