CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Multi-objective Vehicle Routing Problem using Dominant Rank Method

Published on January 2013 by Padmabati Chand, J. R. Mohanty
journal_cover_thumbnail

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.

@article{
author = { Padmabati Chand, J. R. Mohanty },
title = { A Multi-objective Vehicle Routing Problem using Dominant Rank Method },
journal = { International Conference in Distributed Computing and Internet Technology 2013 },
issue_date = { January 2013 },
volume = { ICDCIT },
number = { 1 },
month = { January },
year = { 2013 },
issn = 0975-8887,
pages = { 29-34 },
numpages = 6,
url = { /proceedings/icdcit/number1/10239-1006/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference in Distributed Computing and Internet Technology 2013
%A Padmabati Chand
%A J. R. Mohanty
%T A Multi-objective Vehicle Routing Problem using Dominant Rank Method
%J International Conference in Distributed Computing and Internet Technology 2013
%@ 0975-8887
%V ICDCIT
%N 1
%P 29-34
%D 2013
%I International Journal of Computer Applications
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. 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.

References
  1. Fisher, M. 1995 Vehicle routing. Handbooks of Operations Research and Management Science, vol. 8. Elsevier , pp. 1-33.
  2. Ombuki, B. , Ross, J. , Hanshar, F. 2006. Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows. Journal of Applied Intelligence, Springer Science, Vol. 24, pp. 17-30.
  3. Haupt, R. L. , Haupt, H. S. 2004 Practical Genetic Algorithms. 2nd Edition, A John Wiley & Sons, Inc. , Publication.
  4. Deb, K. 2001 Multi- Objective Optimization Using Evolutionary Algorithm. John Wiley & Sons, Ltd.
  5. Goldberg, D. E. , Deb, K. 1991 A comparative analysis of selection schemes used in genetic algorithm. In G. J. E. Raslins(Ed. ), Foundations of genetic algorithms, pp. 69-93.
  6. Goldberg, D. E. 1998 Genetic Algorithm in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Massachusetts.
  7. Tan. K. C. , Chew. Y. H. 2006. A Hybrid Multi objective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows. Computational Optimization and Applications, Springer Science, Vol. 34, pp. 115–151.
  8. Chand, P. , Mohanty, J. R. 2011. Multi Objective Genetic Approach for Solving Vehicle Routing Problem with Time Window. In proceeding of trends in Computer Science, Engineering and Information Technology, LNCCIS (CCSEIT), Vol. 204, pp. 336-343.
  9. Chand, P. , Mohanty, J. R. 2011. Multi Objective Genetic Approach for Solving Vehicle Routing Problem. In Proceeding 4th International Conference on Computer Science and Information Technology (ICCSIT), in press.
  10. Mohammed, M. A. , Ahmad, M. S. , Mostafa, S. A. 2012. Using Genetic Algorithm in implementing Capacitated Vehicle Routing Problem. In Proceeding of International Conference On Computer & Information Science(ICCIS),Vol. 1, pp. 257-262.
  11. Zongyan, X. , Haihua, L. ,Wang, Y. 2011. An Improved Genetic Algorithm for Vehicle Routing Problem. In Proceeding of International Conference on Computational and Information Sciences (ICCIS), pp. 1132-1125.
  12. Jiajiao, Q. ,Yong, Z. , Jianlin, M. , Lixia, F. 2011. A new coding method for genetic algorithm in vehicle routing problem. In Proceeding International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER), pp. 201-204.
Index Terms

Computer Science
Information Sciences

Keywords

Vehicle Routing Problem Genetic Algorithm Multi-objective Optimization Dominant Rank Method Sub Route Mapped Cross Over Method (smcm) Sub Route Exchange Mutation Method (semm)