Cart (Loading....) | Create Account
Close category search window

Parallel Ant Colony Optimization Algorithm

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Hong Liu ; National Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou ; Ping Li ; Yu Wen

Ant colony optimization algorithm is a good way to solve complex multi-stage decision problems. But the construction graph and computation steps for an ant to construct a solution in the construction graph will be exponentially increased, if the stage number and decision variable dimension of complex multi-stage decision problem are increasing. It will cause the ant colony optimization algorithm can not be computed by a single PC. Therefore, a parallel ant colony optimization algorithm based on the construction graph decomposition is presented to solve this problem. The parallel ant colony optimization algorithm decomposes the construction graph into some parts and each part is placed on different PC. The whole computation task is accomplished by mutual cooperation in the PCs which join in the computation. Experiment has verified that it can solve this problem and improve the computation efficiency

Published in:

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on  (Volume:1 )

Date of Conference:

0-0 0

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.