Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
Revision as of 04:31, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem |
scientific article |
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
