A set-covering based heuristic algorithm for the periodic vehicle routing problem
We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day o...
| Main Authors: | , , |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
Elsevier
2014
|
| Subjects: | |
| Online Access: | http://epub.wu.ac.at/3858/1/Cacchiani_etal_2014_DAM_A%2Dset%2Dcovering%2Dbased%2Dheuristic.pdf http://dx.doi.org/10.1016/j.dam.2012.08.032 |