Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003)
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 1930169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vehicle routing problem with time windows and a limited number of vehicles. |
scientific article; zbMATH DE number 1930169 |
Statements
Vehicle routing problem with time windows and a limited number of vehicles. (English)
0 references
18 June 2003
0 references
Tabu search
0 references
Heuristics
0 references
Routing
0 references
Combinatorial optimization
0 references
Vehicle routing
0 references
problem with time windows
0 references
0 references
0 references
0 references
0 references
0.8298772573471069
0 references
0.8288719654083252
0 references
0.8251075148582458
0 references
0.8249595165252686
0 references
0.823374330997467
0 references
