The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620)
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: The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm |
scientific article; zbMATH DE number 6635654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm |
scientific article; zbMATH DE number 6635654 |
Statements
The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (English)
0 references
7 October 2016
0 references
location-routing
0 references
heterogeneous fleet
0 references
time windows
0 references
mixed integer programming
0 references
genetic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8790081739425659
0 references
0.8495059013366699
0 references
0.8324337005615234
0 references
0.8255032896995544
0 references
0.8171209692955017
0 references
