Memetic Computing using Simulated Annealing for Dynamic Vehicle Routing Protocol

Authors(1) :-Rincy N

This paper addresses the dynamic vehicle routing problem. The proposed work includes the optimization in path selection using simulated annealing and hybrid memetic-genetic algorithm. In this paper, first we apply simulated annealing approach to the input of VRP.We use standard SA method that includes various types of move including insertion move, swap move,2-opt move,3-opt move to solve VRP.Then the output of SA approach will be given as the input to hybrid memetic-genetic algorithm. In hybrid memetic-GA approach, there will be standard operation of GA and a local search method. The aim of the approach are to produce a better solution with a short time limit, to design an efficient and effective distribution network in order to deliver the produced goods to the customer with the lowest cost and in shortest possible time frame.

Authors and Affiliations

Rincy N
Computer Science Department, Marian Engineering College, Trivandrum, Kerala, India

Dynamic vehicle routing protocol, Simulated annealing, Genetic algorithm, Memetic optimization, local search, Annealing limit,Evolutionary Operator.

  1. Franklin T.Hanshar, Beatrice M.Ombuki-Berman,"Dynamic vehicle routing using genetic algorithms", Springer, Appl Intell (2007) 27:pp 89-99.
  2. N.Ghaffari Nasab, S.Ghazanfar Ahari, M.Ghazanfari, "A hybrid Simulated annealing based heuristic for solving the location-routing Problem with fuzzy demands", Scientia Iranica E (2013) 20(3), pp 919- 930.
  3. Xian shun Chen, Yew Soon Ong and Meng Hiot Lim,"Cooperating Memes for Vehicle Routing Problems", ICIC International 2011 ISSN 1349-4198 pp 1-10.
  4. Christofides, N., and Eilon, S, "An algorithm for vehicle dispatching Proble", operational research quarterly (1969), 20, 309318.
  5. Michal Okulewicz, Jacek Mandziuk, "A Particle swarm optimization for the dynamic vehicle routing problem", Artificial Intelligence and Soft Computing,springer(2013).
  6. Ombuki B, Ross BJ, Hanshar F,"Multi objective genetic algorithm for vehicle routing problem with time windows", Appl Intell (2006)24(1):pp17-30.
  7. MitchellM,"An introduction to genetic algorithms".MITPress (1996). Bertsimas, D.J., "A Vehicle Routing Problem with stochastic demand", Operations Research (1992), 40, 574585.
  8. A.S.Alfa, S.S.Heragu and M.Chen."3-opt based simulated annealing algorithm for vehicle routing problem", computers&Operations Research (1991), 21:pp635-639.
  9. N. Christofides, A.Mingozzi,and P.Toth,"The Vehicle Routing Problem"Combinatorial optimization, pp315-338(197).
  10. M.Gendreau,G.Laporte and J.Y.Potvn,"Local Search in combinatorial optimization",Princeton:Princeton University Press,c2003,2003.Reprint,Originally published: New York:Wiley,1997 12J. Schonberg. "Memetic Algorithm Vehicle Routing", pages 65-76. Springer Berlin Heidelberg, 2006.
  11. G. B. Dantzig and R. H. Ramser. "The Truck Dispatching Problem". Management science, 6:pp80-91, 1959.
  12. R. Montemanni, L. Gambardella, A. Rizzoli, and A. Donati. "A new Algorithm for a dynamic vehicle routing problem based on an ant Colony system", Journal of combinatorial optimization, 10:pp327-343, 2005.
  13. J. F. Bard and L. Huang." A branch and cut algorithm for the vrp with Satellite facilities", IEEE Transactions, 30(9):PP821-834, September 1998.

Publication Details

Published in : Volume 3 | Issue 3 | May-June 2017
Date of Publication : 2017-06-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 60-66
Manuscript Number : IJSRSET17337
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

Rincy N, " Memetic Computing using Simulated Annealing for Dynamic Vehicle Routing Protocol , International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 3, Issue 3, pp.60-66, May-June-2017.
Journal URL : http://ijsrset.com/IJSRSET17337

Article Preview

Follow Us

Contact Us