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

Particle Swarm and Ant Colony Algorithms Hybridized for Multi-Mode Resource-constrained Project Scheduling Problem with Minimum Time Lag

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

3 Author(s)
Shan Miyuan ; Sch. of Bus. Adm., Hunan Univ., Changsha ; Wu Juan ; Peng Danni

MMRCPSP/MIN has been proved to be a NP-hard problem. Based on the introduction of model of project scheduling problem with minimum time lag developed by Roland Heilmann, the paper analyzed two swarm intelligence algorithms which have good performance in solving combinatorial optimization problem-ACO and PSO algorithms. Based on analysis of these algorithms' defects, the paper proposed that the defects of ACO algorithm such as hard to converge, performance significantly affected by parameters, high requirement for parameters and so on, can be made up by the high convergence of PSO algorithm. The parameters of ACO algorithm were set in terms of the solution of PSO algorithm. Through particle swarm iteration and making convergence effect and better objective solution of ACO algorithm as fitness value in order to lead the optimization of particle swarm, we can obtain the optimal solution as well as better convergence speed and effect. Finally, the model and problem solving process were programmed in the C++ language. Intensive computational experiments were done on cases in PSPLIB. The result shows that with the iteration of PSO algorithm, both the performance and convergence of ACO algorithm are improved.

Published in:

Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Date of Conference:

21-25 Sept. 2007

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.