Table of Contents Author Guidelines Submit a Manuscript
Journal of Sensors
Volume 2015, Article ID 189832, 14 pages
http://dx.doi.org/10.1155/2015/189832
Research Article

Multiobjective Dynamic Vehicle Routing Problem and Time Seed Based Solution Using Particle Swarm Optimization

1School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi 110067, India
2Faculty of Computing, Universiti Teknologi Malaysia (UTM), 81310 Skudai, Johor, Malaysia

Received 22 August 2014; Accepted 15 December 2014

Academic Editor: Tao Zhu

Copyright © 2015 Omprakash Kaiwartya 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. B. Golden, S. Raghavan, and E. Wasil, The vehicle routing problem: latest advances and new challenges, vol. 43 of Operations Research/Computer Science Interfaces, Springer, New York, NY, USA, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. C. Lin, K. L. Choy, G. T. S. Ho, S. H. Chung, and H. Y. Lam, “Survey of green vehicle routing problem: past and future trends,” Expert Systems with Applications, vol. 41, no. 4, pp. 1118–1138, 2014. View at Publisher · View at Google Scholar · View at Scopus
  3. V. Pillac, M. Gendreau, C. Guéret, and A. L. Medaglia, “A review of dynamic vehicle routing problems,” European Journal of Operational Research, vol. 225, no. 1, pp. 1–11, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. M. W. Savelsbergh, “Local search in routing problems with time windows,” Annals of Operations Research, vol. 4, no. 1, pp. 285–305, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. H. C. W. Lau, T. M. Chan, W. T. Tsui, and W. K. Pang, “Application of genetic algorithms to solve the multidepot vehicle routing problem,” IEEE Transactions on Automation Science and Engineering, vol. 7, no. 2, pp. 383–392, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. L.-N. Xing, P. Rohlfshagen, Y.-W. Chen, and X. Yao, “A hybrid ant colony optimization algorithm for the extended capacitated arc routing problem,” IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, vol. 41, no. 4, pp. 1110–1123, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. F. P. Goksal, I. Karaoglan, and F. Altiparmak, “A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery,” Computers and Industrial Engineering, vol. 65, no. 1, pp. 39–53, 2013. View at Publisher · View at Google Scholar · View at Scopus
  8. O. Kaiwartya and S. Kumar, “GeoPSO: geocasting in vehicular adhoc networks using particle swarm optimization,” in Proceedings of the Conference on Information Systems and Design of Communication (ISDOC '14), pp. 62–66, ACM, Lisboan, Portugal, May 2014. View at Publisher · View at Google Scholar
  9. P. K. Tiwari and D. P. Vidyarthi, “Observing the effect of interprocess communication in auto controlled ant colony optimization-based scheduling on computational grid,” Concurrency Computation: Practice and Experience, vol. 26, no. 1, pp. 241–270, 2014. View at Publisher · View at Google Scholar · View at Scopus
  10. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science. Journal of the Institute of Management Science. Application and Theory Series, vol. 6, pp. 80–91, 1959. View at Google Scholar · View at MathSciNet
  11. H. Lei, G. Laporte, and B. Guo, “The capacitated vehicle routing problem with stochastic demands and time windows,” Computers & Operations Research, vol. 38, no. 12, pp. 1775–1783, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. X. Li, P. Tian, and S. C. H. Leung, “Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm,” International Journal of Production Economics, vol. 125, no. 1, pp. 137–145, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. S. F. Ghannadpour, S. Noori, and R. Tavakkoli-Moghaddam, “Multiobjective dynamic vehicle routing problem with fuzzy travel times and customers' satisfaction in supply chain management,” IEEE Transactions on Engineering Management, vol. 60, no. 4, pp. 777–790, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. Y.-J. Gong, J. Zhang, O. Liu, R.-Z. Huang, H. S.-H. Chung, and Y.-H. Shi, “Optimizing the vehicle routing problem with time windows: a discrete particle swarm optimization approach,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 42, no. 2, pp. 254–267, 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. H.-K. Chen, H.-W. Chou, C.-F. Hsueh, and T.-Y. Ho, “The linehaul-feeder vehicle routing problem with virtual depots,” IEEE Transactions on Automation Science and Engineering, vol. 8, no. 4, pp. 694–704, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. D. A. Steil, J. R. Pate, N. A. Kraft et al., “Patrol routing expression, execution, evaluation, and engagement,” IEEE Transactions on Intelligent Transportation Systems, vol. 12, no. 1, pp. 58–72, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. L. Xing, P. Rohlfshagen, Y. Chen, and X. Yao, “An evolutionary approach to the multidepot capacitated Arc routing problem,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 3, pp. 356–374, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. P. P. Repoussis, C. D. Tarantilis, and G. Ioannou, “Arc-guided evolutionary algorithm for the vehicle routing problem with time windows,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 3, pp. 624–647, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. J. Zhang, W. Wang, Y. Zhao, and C. Cattani, “Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction,” Mathematical Problems in Engineering, vol. 2012, Article ID 879614, 19 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  20. P. K. Tiwari and A. K. Srivastava, “Zadeh extension principle: a note,” Annals of Fuzzy Mathematics and Informatics, vol. 9, no. 1, pp. 37–41, 2014. View at Google Scholar
  21. S. F. Ghannadpour, S. Noori, R. Tavakkoli-Moghaddam, and K. Ghoseiri, “A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application,” Applied Soft Computing Journal, vol. 14, no. 1, pp. 504–527, 2014. View at Publisher · View at Google Scholar · View at Scopus
  22. R. S. Rao, S. K. Soni, N. Singh, and O. Kaiwartya, “A probabilistic analysis of path duration using routing protocol in VANETs,” International Journal of Vehicular Technology, vol. 2014, Article ID 495036, 10 pages, 2014. View at Publisher · View at Google Scholar
  23. R. Kumar, S. Kumar, D. Shukla, R. S. Raw, and O. Kaiwartya, “Geometrical localization algorithm for three dimensional wireless sensor networks,” Wireless Personal Communications, vol. 79, no. 1, pp. 249–264, 2014. View at Google Scholar
  24. O. Kaiwartya and S. Kumar, “Cache agent based geocasting (CAG) in VANETs,” International Journal of Information and Communication Technology. In press.
  25. K. Gupta, K. Gupta, and O. Kaiwartya, “Dynamic ad hoc transport protocol (D-ATP) for mobile ad hoc networks,” in Proceedings of the 5th International Conference- Confluence-The Next Generation Information Technology Summit, pp. 411–415, Noida, India, September 2014. View at Publisher · View at Google Scholar
  26. O. Kaiwartya and S. Kumar, “Geocast routing: recent advances and future challenges in vehicular adhoc networks,” in Proceedings of the International Conference on Signal Processing and Integrated Networks (SPIN '14), pp. 291–296, IEEE, Noida, India, Feburary 2014. View at Publisher · View at Google Scholar
  27. O. Kaiwartya, S. Kumar, and R. Kasana, “Traffic light based time stable geocast (T-TSG) routing for urban VANETs,” in Proceedings of the 6th International Conference on Contemporary Computing (IC3 '13), pp. 113–117, Noida, India, August 2013. View at Publisher · View at Google Scholar · View at Scopus
  28. O. Kaiwartya and S. Kumar, “Enhanced caching for geocast routing in vehicular Ad-Hoc networks (ECGR),” in Proceedings of the International Conference on Advanced Computing Networking and Informatics (ICACNI '13), vol. 243, pp. 213–220, Raipur, India, June 2013.
  29. O. Kaiwartya, S. Kumar, D. K. Lobiyal, A. H. Abdullah, and A. N. Hassan, “Performance improvement in geographic routing for vehicular ad hoc networks,” Sensors, vol. 14, no. 12, pp. 22342–22371, 2014. View at Publisher · View at Google Scholar
  30. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Perth, Australia, December 1995. View at Publisher · View at Google Scholar · View at Scopus
  31. W. N. Chen, J. Zhang, H. S. H. Chung, W. L. Zhong, W. G. Wu, and Y. H. Shi, “A novel set-based particle swarm optimization method for discrete optimization problems,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 2, pp. 278–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. F. K. Karnadi, Z. H. Mo, and K.-C. Lan, “Rapid generation of realistic mobility models for VANET,” in Proceedings of the Wireless Communications and Networking Conference (WCNC '07), pp. 2508–2513, IEEE, Kowloon, China, March 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. D. Krajzewicz, J. Erdmann, M. Behrisch, and L. Bieker, “Recent development and applications of sumo—simulation of urban mobility,” International Journal On Advances in Systems and Measurement, vol. 5, no. 3-4, pp. 128–138, 2012. View at Google Scholar
  34. “The California Vehicle Activity Database (CalVAD),” http://calvad.ctmlabs.net/.
  35. The US Department of transportation, https://www.fhwa.dot.gov/policyinformation/index.cfm.
  36. http://www.kaiwartya.com/publications.
  37. M. I. Hosny and C. L. Mumford, “Constructing initial solutions for the multiple vehicle pickup and delivery problem with time windows,” Journal of King Saud University, Computer and Information Sciences, vol. 24, no. 1, pp. 59–69, 2012. View at Publisher · View at Google Scholar
  38. Y. Zhou, J. Xie, and H. Zheng, “A hybrid bat algorithm with path relinking for capacitated vehicle routing problem,” Mathematical Problems in Engineering, vol. 2013, Article ID 392789, 10 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  39. P. H. V. Penna, A. Subramanian, and L. S. Ochi, “An iterated local search heuristic for the heterogeneous fleet vehicle routing problem,” Journal of Heuristics, vol. 19, no. 2, pp. 201–232, 2013. View at Publisher · View at Google Scholar · View at Scopus
  40. X. Gao, L. Andrew, Q. Hu, and Z. Wenbin, “Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach,” in Modern Approaches in Applied Intelligence, vol. 6704 of Lecture Notes in Computer Science, pp. 193–202, Springer, 2011. View at Google Scholar
  41. Y. J. Gong, J. Zhang, O. Liu, R. Z. Huang, H. S. H. Chung, and Y.-H. Shi, “Optimizing the vehicle routing problem with time windows: a discrete particle swarm optimization approach,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 42, no. 2, pp. 254–267, 2012. View at Publisher · View at Google Scholar · View at Scopus
  42. E. Cao, M. Lai, and H. Yang, “Open vehicle routing problem with demand uncertainty and its robust strategies,” Expert Systems with Applications, vol. 41, no. 7, pp. 3569–3575, 2014. View at Publisher · View at Google Scholar · View at Scopus
  43. M. Romero, S. Leonid, and S. Angel, “A genetic algorithm for the pickup and delivery problem: an application to the helicopter offshore transportation,” in Theoretical Advances and Applications of Fuzzy Logic and Soft Computing, vol. 42, pp. 435–444, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  44. E. Melachrinoudis, A. B. Ilhan, and H. Min, “A dial-a-ride problem for client transportation in a health-care organization,” Computers & Operations Research, vol. 34, no. 3, pp. 742–759, 2007. View at Publisher · View at Google Scholar · View at Scopus
  45. D. Cattaruzza, N. Absi, D. Feillet, and T. Vidal, “A memetic algorithm for the multi trip vehicle routing problem,” European Journal of Operational Research, vol. 236, no. 3, pp. 833–848, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus