28th Annual conference of the Belgian Operations Research Society vol:28 pages:84-86
28th Annual conference of the Belgian Operations Research Society (ORBEL) edition:28 location:Mons, Belgium date:30-31 January 2014
In this research a number of Vehicle Routing Problems, in which only a subset of the customers has a demand, are considered in an incomplete network. We have investigated what would be the best improvement of this incomplete network, such that the total travel time of the vehicles in these routing problems is minimized. Both a Mixed Integer Programming formulation and a heuristic are presented to determine this best improvement.