Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times

We also describe lower bounds derived from a set-partitioning based formulation (SP ) of the problem, and computed using two efficient dual ascent heuristics that use two new

This hierarchical objective function, called Solomon’s objective in the sequel, is unusual in vehicle routing: for instance, most articles on the VRP minimize the total distance

The proposed tabu search procedure allows all kind of infeasible moves to be done (time windows, load, routes number). We have performed some empirical tests to prove the

In this paper, CLONALG (CLONal selection ALGorithm) was used to solve the problem of vehicle routing with time windows was used. It was presented by de Castro and Von Zubena in

Average number of vehicles and distances of methods for the vehicle routing problem with time windows on 100-customer problems (CNV is the cumulative number of vehicles; CTD is

We present an extended formulation for the vehicle routing problem with time windows that allows us to apply the classical (static) robust programming approach to the problem..

Our main contributions are (i) the study of techniques to reduce the number of extreme points of the uncertainty polytope that must be considered in the model, and (ii)

Let g tj = 1 or 0 depending on whether customer x t is an element of S, or not respectively, and let C (Sj ) be the cost of the TSP solution through the set of customers in