Referenced Items are not available for this document.
The dynamic tugboat scheduling problem is a special kind of Job Scheduling Problem. Here we propose an improved particle swarm optimization (PSO) algorithm in which an entropy function and an elite set is used for better performance. When the entropy of the swarm keeps under some value in a certain period, some of the particles will be replaced randomly by those from the elite set. This may help the swarm to get rid of local optima, and to have a faster convergence. The proposed algorithm is successfully used in the tugboats scheduling problem, and demonstrated its advantages of faster convergence and better result than the standard PSO.
Published in:
Power Electronics and Intelligent Transportation System (PEITS), 2009 2nd International Conference on
(Volume:1
)
Date of Conference: 19-20 Dec. 2009
- Page(s):
- 433 - 437
- Print ISBN:
- 978-1-4244-4544-8
- INSPEC Accession Number:
- 11107019
- Conference Location :
- Shenzhen
- Digital Object Identifier :
- 10.1109/PEITS.2009.5406976
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
