EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem
DOI:
https://doi.org/10.4108/eai.10-6-2019.159099Keywords:
Multi-Depot Vehicle Routing Problem (MDVRP), Ordered Distance Vector (ODV), Genetic Algorithm (GA)Abstract
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 has improved 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 using enhanced 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.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 EAI Endorsed Transactions on Scalable Information Systems
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.