Modelo real de planificación y rutas bi-objetivo. Equilibrio entre costes y preferencias de clientes

Abstract

A bi-objective model for the design of daily routes of a company over a planning period is analyzed. This model is motivated by a real design problem routes Chemical Analysis Company over a planning horizon and allocation schedules visit to its customers. The two objectives under consideration are: minimizing transport costs and reducing modifications on current customer schedules. For resolution, it has developed an ad hoc methodology based on tabu search in the context of PVRP (Periodic Vehicle Routing Problem). The solution method was developed by application of combined tabu search with MOAMP (Multiobjective Adaptive Memory Procedure) strategy and the results are compared with an implementation of NSGA-II (Non-dominated Sorting Genetic Algorithm), a well-known approach to multi-objective optimization.