A novel chaotic particle swarm optimization algorithm for parking space guidance. (English) Zbl 1400.90092
Summary: An evolutionary approach of parking space guidance based upon a novel Chaotic Particle Swarm Optimization (CPSO) algorithm is proposed. In the newly proposed CPSO algorithm, the chaotic dynamics is combined into the position updating rules of Particle Swarm Optimization to improve the diversity of solutions and to avoid being trapped in the local optima. This novel approach, that combines the strengths of Particle Swarm Optimization and chaotic dynamics, is then applied into the route optimization (RO) problem of parking lots, which is an important issue in the management systems of large-scale parking lots. It is used to find out the optimized paths between any source and destination nodes in the route network. Route optimization problems based on real parking lots are introduced for analyzing and the effectiveness and practicability of this novel optimization algorithm for parking space guidance have been verified through the application results.
MSC:
| 90B20 | Traffic problems in operations research |
| 90C59 | Approximation methods and heuristics in mathematical programming |
References:
| [1] | Mei, Z. Y.; Tian, Y., Optimized combination model and algorithm of parking guidance information configuration, EURASIP Journal on Wireless Communications and Networking, 2011, article 104, (2011) · doi:10.1186/1687-1499-2011-104 |
| [2] | Thompson, R. G.; Takada, K.; Kobayakawa, S., Optimisation of parking guidance and information systems display configurations, Transportation Research Part C: Emerging Technologies, 9, 1, 69-85, (2001) · doi:10.1016/S0968-090X(00)00031-0 |
| [3] | Lee, C.-K.; Lin, C.-L.; Shiu, B.-M., Autonomous vehicle parking using hybrid artificial intelligent approach, Journal of Intelligent and Robotic Systems: Theory and Applications, 56, 3, 319-343, (2009) · Zbl 1203.68250 · doi:10.1007/s10846-009-9319-9 |
| [4] | Lawler, E. L., Combinatorial Optimization: Networks and Matroids, (1976), New York, NY, USA: Holt, Rinehart, and Winston, New York, NY, USA · Zbl 0413.90040 |
| [5] | Mohemmed, A. W.; Sahoo, N. C.; Geok, T. K., Solving shortest path problem using particle swarm optimization, Applied Soft Computing Journal, 8, 4, 1643-1653, (2008) · doi:10.1016/j.asoc.2008.01.002 |
| [6] | Song, Q.; Wang, X. F., Survey of speedup techniques for shortest path algorithms, Journal of University of Electronic Science and Technology of China, 41, 176-184, (2012) |
| [7] | Fu, L.; Sun, D.; Rilett, L. R., Heuristic shortest path algorithms for transportation applications: state of the art, Computers & Operations Research, 33, 11, 3324-3343, (2006) · Zbl 1113.90034 · doi:10.1016/j.cor.2005.03.027 |
| [8] | Cherkassky, B. V.; Goldberg, A. V.; Radzik, T., Shortest paths algorithms: theory and experimental evaluation, Mathematical Programming, 73, 2, 129-174, (1996) · Zbl 0853.90111 · doi:10.1016/0025-5610(95)00021-6 |
| [9] | Mehmet Ali, M. K.; Kamoun, F., Neural networks for shortest path computation and routing in computer networks, IEEE Transactions on Neural Networks, 4, 6, 941-954, (1993) · doi:10.1109/72.286889 |
| [10] | Araújo, F.; Ribeiro, B.; Rodrigues, L., A neural network for shortest path computation, IEEE Transactions on Neural Networks, 12, 5, 1067-1073, (2001) · doi:10.1109/72.950136 |
| [11] | Ahn, C.-W.; Ramakrishna, R. S., A genetic algorithm for shortest path routing problem and the sizing of populations, IEEE Transactions on Evolutionary Computation, 6, 6, 566-579, (2002) · doi:10.1109/TEVC.2002.804323 |
| [12] | Raidl, G. R.; Julstrom, B. A., A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem, Proceedings of the ACM Symposium on Applied Computing (SAC ’00) · doi:10.1145/335603.335888 |
| [13] | Fu, Z.; Kurnia, A.; Lim, A.; Rodrigues, B., Shortest path problem with cache dependent path lengths, Proceedings of the Congress on Evolutionary Computation |
| [14] | Kuri, J.; Puech, N.; Gagnaire, M.; Dotaro, E., Routing foreseeable light path demands using a tabu search meta-heuristic, Proceedings of the IEEE Global Telecommunication Conference (GLOBECOM ’02) · doi:10.1109/GLOCOM.2002.1189140 |
| [15] | Kennedy, J.; Eberhart, R., Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Network (ICNN ’93) |
| [16] | Sun, T.-H., Applying particle swarm optimization algorithm to roundness measurement, Expert Systems with Applications, 36, 2, 3428-3438, (2009) · doi:10.1016/j.eswa.2008.02.072 |
| [17] | Omran, M.; Engelbrecht, A. P.; Salman, A., Particle swarm optimization method for image clustering, International Journal of Pattern Recognition and Artificial Intelligence, 19, 3, 297-321, (2005) · doi:10.1142/S0218001405004083 |
| [18] | Angeline, P. J., Evolutionary optimization versus particle swarm optimization: philosophy and performance differences, Evolutionary Programming VII: 7th International Conference, EP98 San Diego, California, USA, March 25–27, 1998 Proceedings. Evolutionary Programming VII: 7th International Conference, EP98 San Diego, California, USA, March 25–27, 1998 Proceedings, Lecture Notes in Computer Science, 1447, 601-610, (1998), Berlin, Germany: Springer, Berlin, Germany · doi:10.1007/BFb0040811 |
| [19] | Wong, K.-W.; Kwok, B. S.-H.; Law, W.-S., A fast image encryption scheme based on chaotic standard map, Physics Letters A, 372, 15, 2645-2652, (2008) · Zbl 1220.94044 · doi:10.1016/j.physleta.2007.12.026 |
| [20] | Ou, C.-M., Design of block ciphers by simple chaotic functions, IEEE Computational Intelligence Magazine, 3, 2, 54-59, (2008) · doi:10.1109/MCI.2008.919074 |
| [21] | Li, B.; Jiang, W., Optimizing complex functions by chaos search, Cybernetics and Systems, 29, 4, 409-419, (1998) · Zbl 1012.90068 · doi:10.1080/019697298125678 |
| [22] | Koupaei, J. A.; Hosseini, S.; Ghaini, F. M., A new optimization algorithm based on chaotic maps and golden section search method, Engineering Applications of Artificial Intelligence, 50, 201-214, (2016) · doi:10.1016/j.engappai.2016.01.034 |
| [23] | Coelho, L. D. S., Reliability-redundancy optimization by means of a chaotic differential evolution approach, Chaos, Solitons and Fractals, 41, 2, 594-602, (2009) · Zbl 1198.90096 · doi:10.1016/j.chaos.2008.02.028 |
| [24] | Liu, B.; Wang, L.; Jin, Y.-H.; Tang, F.; Huang, D.-X., Improved particle swarm optimization combined with chaos, Chaos, Solitons and Fractals, 25, 5, 1261-1271, (2005) · Zbl 1074.90564 · doi:10.1016/j.chaos.2004.11.095 |
| [25] | Bucolo, M.; Caponetto, R.; Fortuna, L.; Frasca, M.; Rizzo, A., Does chaos work better than noise?, IEEE Circuits and Systems Magazine, 2, 3, 4-19, (2002) · doi:10.1109/MCAS.2002.1167624 |
| [26] | Xie, X.-F.; Zhang, W.-J.; Yang, Z.-L., A dissipative particle swarm optimization, Proceedings of the Congress on Evolutionary Computation (CEC ’02) · doi:10.1109/cec.2002.1004457 |
| [27] | Liu, B.; Wang, L.; Jin, Y.-H.; Tang, F.; Huang, D.-X., Improved particle swarm optimization combined with chaos, Chaos, Solitons & Fractals, 25, 5, 1261-1271, (2005) · Zbl 1074.90564 · doi:10.1016/j.chaos.2004.11.095 |
| [28] | Chauhan, P.; Pant, M.; Deep, K., Parameter optimization of multi-pass turning using chaotic PSO, International Journal of Machine Learning and Cybernetics, 6, 2, 319-337, (2015) · doi:10.1007/s13042-013-0221-1 |
| [29] | Zhang, H.; Shen, J.-H.; Zhang, T.-N.; Yang, L., An improved chaotic particle swarm optimization and its application in investment, Proceedings of the International Symposium on Computational Intelligence and Design (ISCID ’08) · doi:10.1109/iscid.2008.92 |
| [30] | Kennedy, J.; Eberhart, R. C., Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Networks |
| [31] | Li, X. D.; Engelbrecht, A.; Epitropakis, M. G., Benchmark functions for CEC’2013 special session and competition on niching methods for multimodal function optimization, (2013), Melbourne, Australia: Evolutionary Computation and Machine Learning Group, RMIT University, Melbourne, Australia |
| [32] | Stacey, A.; Jancic, M.; Grundy, I., Particle swarm optimization with mutation, Proceedings of the Congress on Evolutionary Computation (CEC ’03), IEEE · doi:10.1109/cec.2003.1299838 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
