MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BoneRoute / rank | |||
Normal rank | |||
Revision as of 06:58, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems |
scientific article |
Statements
MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (English)
0 references
23 April 2013
0 references
randomized algorithms
0 references
combinatorial optimization
0 references
vehicle routing problem
0 references
biased random search
0 references
heuristics
0 references
