Resumen del proyecto de investigación expuesto en la ALIO-INFORMS Joint International Meeting 2010, en Buenos Aires. James Tomalá Robles, docente de la Universidad Tecnológica Equinoccial, extensión Salinas, expuso la contribución “Route Planning Software and Hybrid Genetic Algorithm”, en el grupo “Transportation and Logistics II”; cuya sesión incluyó también la participación del profesor Tsutomu Suzuki de la Universidad de Tsukuba- Japón y Rudinei Luiz Bogo de la UFPR, Curitiba-Brazil.
Diseño de un DSS para resolver el problema de Ruteo
1. Instituto de Ciencias Matemáticas-ESPOL Route Planning Software and Hybrid Genetic Algorithm Design of a DSS to solve the routing problem in a Courier Service Ph. D. Walter Vaca Arellano (EPN) Ing. James Tomalá Robles (UTE Universidad Tecnológica Equinoccial) Ing. Johnny Pincay Villa (ESPOL) Ecuador ALIO-INFORMS meeting Buenos Aires 2010
2. Motivation In Ecuador, there are approximately 800 courier agencies, and all of them use empirical methods to plan their routes Problem: the absence of a decision support system applying heuristic procedures for the transport operations planning of a courier company It directly affects the two objectives of integrated logistics
3. Objectives Obtain a model for courier delivery problem. Design and developa Metaheuristicbasedongenetic algorithm. Propose a DSS design that uses the developed metaheuristic.
5. Mathematicformulation Cada ruta es realizada por un solo vehículo. La demanda no puede superar la capacidad del vehículo. Se respeta la atención más temprana del cliente y se permite atraso. Continuidad del tiempo y eliminación de subtours. Miller, Tucker y Zemlin [2]. Var. Binaria y positivos
6. GA for CVRPTW On a review of GA publications, we may be concluded that GA requires modification of the classic genetic operators such as: a) Redesign of the mutation and crossover operators.b) Inclusion of local search to improve solutions. c)And considerations of time constrains Thangiagh[16], Bonrostro, Zhu[17],Homberger y Gehring [23]
7. Themetaheuristic Half - insertionheuristic Half- Ramdomly improvingroutes unifiesroutes Replace if the child is better than one parent
8. chromosomerepresentation chromosome: It adopts the permutation representation of integers, where the routes separator is a number greater than n, where n is the number of clients
9. evaluation , Fitness, Selection cost of theroute: Penaltyfordelay: Cost of thesolution(Fitness): Selection: ordering the individuals in the population according to their fitness, that is, lowest to highest cost, and randomly selects among which are located belowfrom40th percentile.
11. combinationoperator The combination strategy selects the best routes from the parents and insert them to the child provided it’s not conflict. BasedonuniformCrossover (UC) ÁslaugSóleyBjarnadóttir [11]
13. Test results of solomon The developed strategy to solve the problem requires less computational effort when data is grouped by area, it was found that in these cases, the number of iterations needed to reach a good solution is less than 40. On the other hand, we must increase the number of iterations when customers are completely randomly distributed in a geographical region.
14. Results – Study Case According to company data, the average service level of the first quarter of 2009, was 69.35%, ie, 20 clients were not treated on time. The developed Metaheuristicincreases the level of service to 98.46%
15. Example prototype using the Google Maps API Theexampleprototype shows the solution of the case study. Each client has been located on the map according to their geographical location , additionally displays data such as order of visit, time of arrival and departure time. it was developed using javascript and dynamic language php. available: www.ecualogistic.com/ruteo.php
16. Muchas gracias por su atención James Tomalá jtomala@ecualogistic.com www.ecualogistic.com