Back to Results
First PageMeta Content
Operations research / Mathematical optimization / Search algorithms / NP-complete problems / Combinatorial optimization / Variable neighborhood search / Vehicle routing problem / Travelling salesman problem / Heuristic / A* search algorithm / Lagrangian relaxation / Local search


Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1
Add to Reading List

Document Date: 2010-05-18 03:15:30

Open Document

File Size: 175,71 KB

Share Result on Facebook