Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467)
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: Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem |
scientific article; zbMATH DE number 6038202
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem |
scientific article; zbMATH DE number 6038202 |
Statements
Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (English)
0 references
23 May 2012
0 references
hybrid algorithms
0 references
variable neighborhood search
0 references
vehicle routing problem
0 references
probabilistic algorithms
0 references
0 references
0 references
0 references
