O problema multiobjetivo de roteamento de veículos com janela de tempo e com tempo de viagem/serviço estocástico

Abstract

This thesis tackles the vehicle routing problem with hard time windows and stochastic travel and service times using multiobjective optimization. A new method to compute the service level (probability of the vehicle visiting the customer before the end of the time window) is presented. The problem is modeled with two objective functions using the Pareto ranking technique in which the two objective dimensions are the operational cost and the service level. The trade-off between the minimization of the operational cost and the maximization of the service level is explored and the algorithm returns a set of solutions that fairly consider both of these dimensions. A memetic multiobjective algorithm is developed to solve all the 56 well know Solomon instances with 100 customers. It is provided details of the design and implementation of the algorithm and also a number of computational experiments with comprehensive analysis of the results. To our knowledge, this method is unprecedented in the literature.