International Journal of Computer Theory and Engineering

Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJCTE 2013 Vol.5(6): 846-849
doi: 10.7763/IJCTE.2013.V5.809

Multi Objective Genetic Approach for Solving Vehicle Routing Problem

Padmabati Chand , J. R. Mohanty

  • School of Computer Application, KIIT University, Bhubaneswar, India.

Abstract

Vehicle Routing Problem (VRP) is a NP Complete and a multi-objective problem. The problem involves optimizing a fleet of vehicles that are to serve a number of customers from a central depot. Each vehicle has limited capacity and each customer has a certain demand. Genetic Algorithm (GA) maintains a population of solutions by means of a crossover and mutation operators. For crossover and mutation best cost route crossover techniques and swap mutation procedure is used respectively. In this paper, we focus on two objectives of VRP i.e. number of vehicles and total cost (distance). The proposed Multi Objective Genetic Algorithm (MOGA) finds optimum solutions effectively.

Keywords

  • Vehicle routing problem
  • genetic algorithm
  • multi-objective optimization
  • pare to ranking procedure
  • best cost route crossover (BCRC)
809-A282

How to Cite

Copied

Padmabati Chand and J. R. Mohanty, "Multi Objective Genetic Approach for Solving Vehicle Routing Problem," International Journal of Computer Theory and Engineering, vol. 5, no. 6, pp. 846-849, 2013. https://doi.org/10.7763/IJCTE.2013.V5.809

Copyright & License

Copyright © 2013 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu