Abstract

This paper applies GLS to vehicle routing problems with time windows and capacity constraints. Results indicate that GLS can provide excellent results. This paper is organised as follows. In section 2, we introduce a local search algorithm for the vehicle routing problem. We begin first by describing the move operators and model, and then go on to describe the objective function and search itself. The GLS meta-heuristic is then presented in section 3. The application of the meta-heuristic to a vehicle routing framework is discussed. Experiments are then performed using GLS on some standard benchmark problems from the literature that involve both capacity constraints on vehicles, and time windows at customers. Conclusions are drawn on the quality of the results in comparison to other methods.

Citations