Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015 (2015), Article ID 483830, 8 pages
http://dx.doi.org/10.1155/2015/483830
Research Article

Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution

1School of Transportation, Southeast University, Nanjing 210096, China
2School of Automation, Southeast University, Nanjing 210096, China

Received 16 March 2015; Revised 15 July 2015; Accepted 26 July 2015

Academic Editor: Filippo Cacace

Copyright © 2015 Peiqing Li et al. 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.

Linked References

  1. O. Ahumada and J. R. Villalobos, “Application of planning models in the agri-food supply chain: a review,” European Journal of Operational Research, vol. 196, no. 1, pp. 1–20, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. D. I. LeBlanc, S. Villeneuve, L. Hashemi Beni et al., “A national produce supply chain database for food safety risk analysis,” Journal of Food Engineering, vol. 147, pp. 24–38, 2015. View at Publisher · View at Google Scholar
  3. H.-K. Chen, C.-F. Hsueh, and M.-S. Chang, “Production scheduling and vehicle routing with time windows for perishable food products,” Computers & Operations Research, vol. 36, no. 7, pp. 2311–2319, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. National Development and Reform Commission of China, Agricultural Cold Chain Logistics Development Plan, National Development and Reform Commission of China, 2010.
  5. J.-F. Cordeau, M. Gendreau, G. Laporte, J.-Y. Potvin, and F. Semet, “A guide to vehicle routing heuristics,” Journal of the Operational Research Society, vol. 53, no. 5, pp. 512–522, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. N. A. El-Sherbeny, “Vehicle routing with time windows: an overview of exact, heuristic and metaheuristic methods,” Journal of King Saud University—Science, vol. 22, no. 3, pp. 123–131, 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. H. I. Calvete, C. Galé, M.-J. Oliveros, and B. Sánchez-Valverde, “A goal programming approach to vehicle routing problems with soft time windows,” European Journal of Operational Research, vol. 177, no. 3, pp. 1720–1733, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. M. Solomon, “Algorithms for the vehicle routing and scheduling problems with time window constraints,” Operations Research, vol. 35, no. 2, pp. 254–265, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, “A tabu search heuristic for the vehicle routing problem with soft time windows,” Transportation Science, vol. 31, no. 2, pp. 170–186, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. G. Ioannou, M. Kritikos, and G. Prastacos, “A problem generator-solver heuristic for vehicle routing with soft time windows,” Omega, vol. 31, no. 1, pp. 41–53, 2003. View at Publisher · View at Google Scholar · View at Scopus
  11. W.-C. Chiang and R. A. Russell, “A metaheuristic for the vehicle-routeing problem with soft time windows,” Journal of the Operational Research Society, vol. 55, no. 12, pp. 1298–1310, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. M. A. Figliozzi, “An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows,” Transportation Research Part C: Emerging Technologies, vol. 18, no. 5, pp. 668–679, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. D. Taş, N. Dellaert, T. van Woensel, and T. de Kok, “The time-dependent vehicle routing problem with soft time windows and stochastic travel times,” Transportation Research Part C: Emerging Technologies, vol. 48, pp. 66–83, 2014. View at Publisher · View at Google Scholar · View at Scopus
  14. C.-I. Hsu, S.-F. Hung, and H.-C. Li, “Vehicle routing problem with time-windows for perishable food delivery,” Journal of Food Engineering, vol. 80, no. 2, pp. 465–475, 2007. View at Publisher · View at Google Scholar · View at Scopus
  15. A. Osvald and L. Z. Stirn, “A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food,” Journal of Food Engineering, vol. 85, no. 2, pp. 285–295, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Amorim and B. Almada-Lobo, “The impact of food perishability issues in the vehicle routing problem,” Computers & Industrial Engineering, vol. 67, no. 1, pp. 223–233, 2014. View at Publisher · View at Google Scholar · View at Scopus
  17. Ministry of Transport of the People's Republic of China, Technical Standard of Highway Engineering JTG B01-2003, Ministry of Transport of the People's Republic of China, Beijing, China, 2004.
  18. J.-H. Lin, “Variations in dynamic vehicle load on road pavement,” International Journal of Pavement Engineering, vol. 15, no. 6, pp. 558–563, 2014. View at Publisher · View at Google Scholar · View at Scopus
  19. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, University of Michigan Press, 1975.
  20. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, London, UK, 1989.
  21. Z. Michalewicz, Genetic Algorithms + Data Structure = Evolution Programs, Springer, New York, NY, USA, 3rd edition, 1999.
  22. J. Li and Y. H. Guo, Theories and Methods in Optimization of Logistics Distribution, China Material Press, 2010.
  23. M. R. Noraini and J. Geraghty, “Genetic algorithm performance with different selection strategies in solving TSP,” in Proceedings of the World Congress on Engineering, 2011.
  24. M.-X. Lang, “Study of the optimizing of physical distribution routing problem based on genetic algorithm,” China Journal of Highway and Transport, vol. 15, no. 3, pp. 76–79, 2002. View at Google Scholar · View at Scopus
  25. Y. Ding and Y. Z. Li, “Genetic algorithm for vehicle routing problem with capacity restriction,” Journal of Lanzhou Jiaotong University, vol. 24, no. 6, pp. 123–126, 2005. View at Google Scholar
  26. O. Alp, E. Erkut, and Z. Drezner, “An efficient genetic algorithm for the p-median problem,” Annals of Operations Research, vol. 122, no. 1–4, pp. 21–42, 2003. View at Publisher · View at Google Scholar · View at Scopus
  27. W. D. Yang and W. F. Wang, “Analyzing and modeling of multimodal transportation with time window,” Journal of Nanjing University of Aeronautics & Astronautics, vol. 41, no. 1, pp. 111–115, 2009. View at Google Scholar · View at Scopus
  28. P. Larrañaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, “Genetic algorithms for the travelling salesman problem: a review of representations and operators,” Artificial Intelligence Review, vol. 13, no. 2, pp. 129–170, 1999. View at Publisher · View at Google Scholar · View at Scopus