Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372)
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: Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows |
scientific article; zbMATH DE number 7335623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows |
scientific article; zbMATH DE number 7335623 |
Statements
Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (English)
0 references
20 April 2021
0 references
routing
0 references
team orienteering problem
0 references
time windows
0 references
adaptive memory
0 references
splitting algorithm
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8361948728561401
0 references
0.8183763027191162
0 references
0.798668384552002
0 references
0.7960938811302185
0 references
0.794776976108551
0 references
