Using Genetic Algorithm In Solving Capacitated Vehicle Routing Problem

The problem of vehicle routing is one of the many problems that have no perfect solutions yet. Many researchers over the last few decades have established numerous researches and used many methods with different techniques to handle it. But, for all researches, finding the lowest cost is very complex. However, they have managed to come up with approximate solutions that differ in efficiencies depending on the search space. This Book attempts to find the shortest route for vehicle routing problem to help UNITEN reduce student's transportation costs. Genetic Algorithm is used to solve this problem as it is capable of solving many complex problems. The Capacitated Vehicle Routing Problem (CVRP) model is implemented for optimizing UNITEN's shuttle bus services. The algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution.

Autorentext

Mazin Abed Mohammed B.Sc.Degree in Computer Science from College of Computer, University of Anbar,Iraq 2008.Master of Information Technology, College of IT, Universiti Tenaga Nasional ,Malaysia 2011.Working as a Teacher in Planning & Follow Up Dept in University of Anbar,Iraq.Published more than 15 papers in Artificial Intelligence,HCI and MSP.