International Conference in Distributed Computing and Internet Technology 2013 |
Foundation of Computer Science USA |
ICDCIT - Number 1 |
January 2013 |
Authors: Padmabati Chand, J. R. Mohanty |
145d58ff-a59f-41a6-a0ed-7d28b3c527bd |
Padmabati Chand, J. R. Mohanty . A Multi-objective Vehicle Routing Problem using Dominant Rank Method. International Conference in Distributed Computing and Internet Technology 2013. ICDCIT, 1 (January 2013), 29-34.
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. We propose new methods for genetic operators. The proposed method for crossover is Sub Route Mapped Crossover Method (SMCM) and for mutation is Sub Route Exchange Mutation Method (SEMM). This paper applies Dominant Rank method to get Pareto Optimal Set. The vehicle routing problem is solved with two objectives i. e. number of vehicles and total cost (distance). The proposed Dominant Rank Method finds optimum solutions effectively.