A Novel Chaotic Particle Swarm Optimization Algorithm for Parking Space Guidance

27Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Dong, N., Fang, X., & Wu, A. G. (2016). A Novel Chaotic Particle Swarm Optimization Algorithm for Parking Space Guidance. Mathematical Problems in Engineering, 2016. https://doi.org/10.1155/2016/5126808

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free