%0 Journal Article 
%A Nieto Isaza, Santiago
%T A robust solving strategy for the vehicle routing problem with multiple depots and multiple objectives

%U http://hdl.handle.net/10584/8990
%X This document presents the development of a robust solving strategy for the Vehicle Routing Problem with Multiple Depots and Multiple Objectives (MO-MDVRP). The problem tackeled in this work is the problem to minimize the total cost and the load imbalance in vehicle routing plan for distribution of goods. This thesis presents a MILP mathematical model and a solution strategy based on a Hybrid Multi- Objective Scatter Search Algorithm. Several experiments using simulated instances were run proving that the proposed method is quite robust, this is shown in execution times (less than 4 minutes for an instance with 8 depots and 300 customers); also, the proposed method showed good results compared to the results found with the MILP model for small instances (up to 20 clients and 2 depots).
%K Logística en los negocios
%K Problemas de transporte (Programación)
%~ GOEDOC, SUB GOETTINGEN