Diseño y desarrollo de una aplicación para la planeación de rutas con condiciones de flota capacitada y ventanas de tiempo por medio de algoritmos heurísticos y metaheurísticos

Abstract

The following document presents the design and development of a general purpose application in the route planning through heuristic and metaheuristic algorithms with conditions of capacitated vehicles with homogeneous load and the capacity to have time windows for customers and the company; in addition, this application was programmed in Visual Basic for Applications language in the Microsoft® Excel application. This application was developed in 5 phases; the first phase is the input information where the user can register the information concerning to the vehicles and the needs (demand) of customers. Once you have entered the previous information, you are in the geo referencing phase, through Google Maps you can set the location of all the clients that you want to have in route planning extracting real distances and times. The next stage seeks to relax the creation of routes through a client’s clustering phase using the K-means algorithm and move to the initial solution generation phase with the Nearest Neighbor's Algorithm and the Savings Algorithm. Finally, it improves the initial solution with an iterative improvement phase with the help of Tabu Search Algorithm and exchange/insertion neighborhoods movements.