A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102)
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 variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction |
scientific article; zbMATH DE number 7634067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction |
scientific article; zbMATH DE number 7634067 |
Statements
A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (English)
0 references
19 December 2022
0 references
multi-depot vehicle routing problem with time windows
0 references
variable neighborhood search
0 references
neighborhood
0 references
local search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9342478
0 references
0.92141795
0 references
0.9169755
0 references
0.91400707
0 references
0.9098457
0 references
