Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Chaotic particle swarm optimization algorithm based on tent mapping for dynamic origin-destination matrix estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jinfeng Zhao ; Sch. of Civil Eng. & Transp., South China Univ. of Technol., Guangzhou, China

Due to the disadvantage of slow convergence and local best of particle swarm optimization (PSO), based on the ergodicity, randomicity and disciplinarian of chaos as well as the advantages of Tent mapping, Tent mapping was used as a chaotic optimization searching and introduced into PSO to avoid PSO getting into local best and appearing premature convergence. This modified and novel PSO was called chaotic particle swarm optimization algorithm (CPSO). This algorithm is applied to solve the maximum entropy model, estimating OD matrix from traffic link flows. Through a test on a specific road intersection, the results show that CPSO is feasible and effective for OD matrix estimation, and has much higher capacity of optimization than basic particle swarm algorithm.

Published in:

Electric Information and Control Engineering (ICEICE), 2011 International Conference on

Date of Conference:

15-17 April 2011