A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783)
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 2102601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search heuristic for the vehicle routing problem with time windows and split deliveries |
scientific article; zbMATH DE number 2102601 |
Statements
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (English)
0 references
23 September 2004
0 references
0 references
0 references
0 references
0 references
0 references
0.8693065047264099
0 references
0.8618155121803284
0 references
0.8528455495834351
0 references
0.8473265767097473
0 references
0.8438645005226135
0 references
