Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343)
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: Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling |
scientific article; zbMATH DE number 6650412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling |
scientific article; zbMATH DE number 6650412 |
Statements
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (English)
0 references
10 November 2016
0 references
stochastic vehicle routing
0 references
Monte Carlo sampling
0 references
local search
0 references
random restart local search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8561748266220093
0 references
0.834290623664856
0 references
0.8261687755584717
0 references
0.7720719575881958
0 references
0.7649261355400085
0 references
