Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016 (2016), Article ID 5126808, 14 pages
http://dx.doi.org/10.1155/2016/5126808
Research Article

A Novel Chaotic Particle Swarm Optimization Algorithm for Parking Space Guidance

1School of Electrical Engineering and Automation, Tianjin University, Tianjin 300072, China
2Key Laboratory of Advanced Process Control for Light Industry of the Ministry of Education, School of Internet of Things Engineering, Jiangnan University, Wuxi 214122, China

Received 5 March 2016; Revised 21 July 2016; Accepted 26 July 2016

Academic Editor: George S. Dulikravich

Copyright © 2016 Na Dong 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. Z. Y. Mei and Y. Tian, “Optimized combination model and algorithm of parking guidance information configuration,” EURASIP Journal on Wireless Communications and Networking, vol. 2011, article 104, 2011. View at Publisher · View at Google Scholar
  2. R. G. Thompson, K. Takada, and S. Kobayakawa, “Optimisation of parking guidance and information systems display configurations,” Transportation Research Part C: Emerging Technologies, vol. 9, no. 1, pp. 69–85, 2001. View at Publisher · View at Google Scholar · View at Scopus
  3. C.-K. Lee, C.-L. Lin, and B.-M. Shiu, “Autonomous vehicle parking using hybrid artificial intelligent approach,” Journal of Intelligent and Robotic Systems: Theory and Applications, vol. 56, no. 3, pp. 319–343, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York, NY, USA, 1976.
  5. A. W. Mohemmed, N. C. Sahoo, and T. K. Geok, “Solving shortest path problem using particle swarm optimization,” Applied Soft Computing Journal, vol. 8, no. 4, pp. 1643–1653, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. Q. Song and X. F. Wang, “Survey of speedup techniques for shortest path algorithms,” Journal of University of Electronic Science and Technology of China, vol. 41, pp. 176–184, 2012. View at Google Scholar
  7. L. Fu, D. Sun, and L. R. Rilett, “Heuristic shortest path algorithms for transportation applications: state of the art,” Computers & Operations Research, vol. 33, no. 11, pp. 3324–3343, 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. B. V. Cherkassky, A. V. Goldberg, and T. Radzik, “Shortest paths algorithms: theory and experimental evaluation,” Mathematical Programming, vol. 73, no. 2, pp. 129–174, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. M. K. Mehmet Ali and F. Kamoun, “Neural networks for shortest path computation and routing in computer networks,” IEEE Transactions on Neural Networks, vol. 4, no. 6, pp. 941–954, 1993. View at Publisher · View at Google Scholar · View at Scopus
  10. F. Araújo, B. Ribeiro, and L. Rodrigues, “A neural network for shortest path computation,” IEEE Transactions on Neural Networks, vol. 12, no. 5, pp. 1067–1073, 2001. View at Publisher · View at Google Scholar · View at Scopus
  11. C.-W. Ahn and R. S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 6, pp. 566–579, 2002. View at Publisher · View at Google Scholar · View at Scopus
  12. G. R. Raidl and B. A. Julstrom, “A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem,” in Proceedings of the ACM Symposium on Applied Computing (SAC '00), pp. 440–445, March 2000. View at Publisher · View at Google Scholar · View at Scopus
  13. Z. Fu, A. Kurnia, A. Lim, and B. Rodrigues, “Shortest path problem with cache dependent path lengths,” in Proceedings of the Congress on Evolutionary Computation, pp. 2756–2761, Canberra, Australia, 2003.
  14. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, “Routing foreseeable light path demands using a tabu search meta-heuristic,” in Proceedings of the IEEE Global Telecommunication Conference (GLOBECOM '02), pp. 2803–2807, Taipei, Taiwan, March 2003. View at Publisher · View at Google Scholar
  15. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Network (ICNN '93), pp. 1942–1948, Perth, Australia, 1995.
  16. T.-H. Sun, “Applying particle swarm optimization algorithm to roundness measurement,” Expert Systems with Applications, vol. 36, no. 2, pp. 3428–3438, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. M. Omran, A. P. Engelbrecht, and A. Salman, “Particle swarm optimization method for image clustering,” International Journal of Pattern Recognition and Artificial Intelligence, vol. 19, no. 3, pp. 297–321, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. P. J. Angeline, “Evolutionary optimization versus particle swarm optimization: philosophy and performance differences,” in Evolutionary Programming VII: 7th International Conference, EP98 San Diego, California, USA, March 25–27, 1998 Proceedings, vol. 1447 of Lecture Notes in Computer Science, pp. 601–610, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  19. K.-W. Wong, B. S.-H. Kwok, and W.-S. Law, “A fast image encryption scheme based on chaotic standard map,” Physics Letters A, vol. 372, no. 15, pp. 2645–2652, 2008. View at Publisher · View at Google Scholar · View at Scopus
  20. C.-M. Ou, “Design of block ciphers by simple chaotic functions,” IEEE Computational Intelligence Magazine, vol. 3, no. 2, pp. 54–59, 2008. View at Publisher · View at Google Scholar · View at Scopus
  21. B. Li and W. Jiang, “Optimizing complex functions by chaos search,” Cybernetics and Systems, vol. 29, no. 4, pp. 409–419, 1998. View at Publisher · View at Google Scholar · View at Scopus
  22. J. A. Koupaei, S. Hosseini, and F. M. Ghaini, “A new optimization algorithm based on chaotic maps and golden section search method,” Engineering Applications of Artificial Intelligence, vol. 50, pp. 201–214, 2016. View at Publisher · View at Google Scholar
  23. L. D. S. Coelho, “Reliability-redundancy optimization by means of a chaotic differential evolution approach,” Chaos, Solitons and Fractals, vol. 41, no. 2, pp. 594–602, 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. B. Liu, L. Wang, Y.-H. Jin, F. Tang, and D.-X. Huang, “Improved particle swarm optimization combined with chaos,” Chaos, Solitons and Fractals, vol. 25, no. 5, pp. 1261–1271, 2005. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Bucolo, R. Caponetto, L. Fortuna, M. Frasca, and A. Rizzo, “Does chaos work better than noise?” IEEE Circuits and Systems Magazine, vol. 2, no. 3, pp. 4–19, 2002. View at Publisher · View at Google Scholar · View at Scopus
  26. X.-F. Xie, W.-J. Zhang, and Z.-L. Yang, “A dissipative particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), pp. 1456–1461, May 2002. View at Publisher · View at Google Scholar · View at Scopus
  27. B. Liu, L. Wang, Y.-H. Jin, F. Tang, and D.-X. Huang, “Improved particle swarm optimization combined with chaos,” Chaos, Solitons & Fractals, vol. 25, no. 5, pp. 1261–1271, 2005. View at Publisher · View at Google Scholar · View at Scopus
  28. P. Chauhan, M. Pant, and K. Deep, “Parameter optimization of multi-pass turning using chaotic PSO,” International Journal of Machine Learning and Cybernetics, vol. 6, no. 2, pp. 319–337, 2015. View at Publisher · View at Google Scholar · View at Scopus
  29. H. Zhang, J.-H. Shen, T.-N. Zhang, and L. Yang, “An improved chaotic particle swarm optimization and its application in investment,” in Proceedings of the International Symposium on Computational Intelligence and Design (ISCID '08), pp. 124–128, Wuhan, China, October 2008. View at Publisher · View at Google Scholar · View at Scopus
  30. J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, Perth, Western Australia, 1995.
  31. X. D. Li, A. Engelbrecht, and M. G. Epitropakis, “Benchmark functions for CEC'2013 special session and competition on niching methods for multimodal function optimization,” Tech. Rep., Evolutionary Computation and Machine Learning Group, RMIT University, Melbourne, Australia, 2013. View at Google Scholar
  32. A. Stacey, M. Jancic, and I. Grundy, “Particle swarm optimization with mutation,” in Proceedings of the Congress on Evolutionary Computation (CEC '03), vol. 2, pp. 1425–1430, IEEE, December 2003. View at Publisher · View at Google Scholar · View at Scopus