EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem

• Main Authors: Prabu U, Ravisasthiri P, Sriram R, Malarvizhi N, Amudhavel J
• Format: Article
• Language: English
• Published: European Alliance for Innovation (EAI) 2019-06-01
• Series: EAI Endorsed Transactions on Scalable Information Systems
• Subjects: Multi-Depot Vehicle Routing Problem (MDVRP); Ordered Distance Vector (ODV); Genetic Algorithm (GA)
• Online Access: https://eudl.eu/pdf/10.4108/eai.10-6-2019.159099

Multi-Depot Vehicle Routing Problem (MDVRP) is a familiar combinative optimization problem that simultaneously determines the direction for different vehicles from over one depot to a collection of consumers. Researchers have suggested variety of meta-heuristic and heuristic algorithms to elucidate MDVRP, but none of the existing technique hasimproved the fitness of the solution at the time of initial population generation. This motivates to propose an enhanced ODV based population initialization for Genetic Algorithm (GA) to solve MDVRP effectively. The Ordered Distance Vector (ODV) based population seeding method is a current and effective population initialization method for Genetic Algorithm to produce an early population with quality, individual diversity and randomness. In the proposed model, the customers are first grouped based on distance to their nearest depots and then routes are scheduled and optimized usingenhanced ODV based GA. The experiments are performed based on different types of instances of Cordeau. From the experimental results, it is very clear that the proposed technique outperforms the existing techniques in terms of convergence rate, error rate and convergence diversity.