Search

Copyright of Psychological Science is the property of Psychological Science Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Ｔｈｅ ｃｏｒａｌ ｒｅｅｆ ａｌｇｏｒｉｔｈｍ ｈａｓ ｔｈｅ ｄｉｓａｄｖａｎｔａｇｅｓ ｏｆ ｂｅｉｎｇ ｅａｓｙ ｔｏ ｆａｌｌ ｉｎｔｏ ｌｏｃａｌ ｏｐｔｉｍｕｍ ａｎｄ ｌｏｗ ｐｒｅｃｉｓｉｏｎ. Ｉｎ ｖｉｅｗ ｏｆ ｔｈｅ ｓｈｏｒｔｃｏｍｉｎｇｓ ｏｆ ｃｏｒａｌ ｒｅｅｆ ａｌｇｏｒｉｔｈｍꎬ ｔｈｉｓ ｐａｐｅｒ ｐｒｏｐｏｓｅｓ ａｎ ｉｍｐｒｏｖｅｄ ｃｏｒａｌ ｒｅｅｆ ａｌｇｏｒｉｔｈｍ. Ｂｙ ｒｅｆｅｒｒｉｎｇ ｔｏ ｐａｒｔｉｃｌｅ ｓｗａｒｍ ｏｐｔｉｍｉｚａｔｉｏｎꎬ Ｇａｕｓｓｉａｎ ｍｕｔａｔｉｏｎ ａｎｄ ｓｉｍｕｌａｔｅｄ ａｎｎｅａｌｉｎｇ ａｌｇｏｒｉｔｈｍꎬ ｔｈｉｓ ａｌｇｏｒｉｔｈｍ ｉｍｐｒｏｖｅｓ ｔｈｅ ｂｒｏａｄｃａｓｔ ｓｐａｗｎｉｎｇꎬ ａｓｅｘｕａｌ ｒｅｐｒｏｄｕｃｔｉｏｎ ａｎｄ ｓｅｔｔｉｎｇ(ｒｅｐｌａｃｅｍｅｎｔ)ｍｅｃｈａｎｉｓｍｓ ｏｆ ｃｏｒａｌ ｒｅｅｆ ａｌｇｏｒｉｔｈｍꎬ ｗｈｉｃｈ ｇｒｅａｔｌｙ ｉｍｐｒｏｖｅｓ ｔｈｅ ｏｐｔｉｍｉｚａｔｉｏｎ ｐｒｅｃｉｓｉｏｎ ｏｆ ｔｈｅ ａｌｇｏｒｉｔｈｍ ａｎｄ ｃａｎ ｊｕｍｐ ｏｕｔ ｏｆ ｔｈｅ ｌｏｃａｌ ｏｐｔｉｍｕｍ. Ｉｎ ｔｈｅ ｓｉｍｕｌａｔｉｏｎ ｅｘｐｅｒｉｍｅｎｔꎬ ｔｈｅ ｉｍｐｒｏｖｅｄ ｃｏｒａｌ ｒｅｅｆ ａｌｇｏｒｉｔｈｍ ｉｓ ｒｅｓｐｅｃｔｉｖｅｌｙ ｃｏｍｐａｒｅｄ ｗｉｔｈ ｔｅｎ ａｌｇｏｒｉｔｈｍｓ ｓｕｃｈ ａｓ ｂａｓｉｃ ｃｏｒａｌ ｒｅｅｆ ａｌｇｏｒｉｔｈｍ ａｎｄ ｐａｒｔｉｃｌｅ ｓｗａｒｍ ａｌｇｏｒｉｔｈｍ ｉｎ ｈｉｇｈ￣ｄｉｍｅｎｓｉｏｎａｌ ａｎｄ ｌｏｗ￣ｄｉｍｅｎｓｉｏｎａｌ ｔｅｓｔ ｆｕｎｃｔｉｏｎｓ. Ｔｈｅ ｅｘｐｅｒｉｍｅｎｔａｌ ｒｅｓｕｌｔｓ ｓｈｏｗ ｔｈａｔ ｔｈｅ ｉｍｐｒｏｖｅｄ ｃｏｒａｌ ｒｅｅｆ ａｌｇｏｒｉｔｈｍ ｈａｓ ｂｅｔｔｅｒ ｃｏｎｖｅｒｇｅｎｃｅ ｒａｔｅ ａｎｄ ａｃｃｕｒａｃｙ ｔｈａｎ ｏｔｈｅｒ ａｌｇｏｒｉｔｈｍｓꎬ ｗｈｉｃｈ ｃａｎ ｓｔｉｌｌ ｂｅ ｍａｉｎｔａｉｎｅｄ ｉｎ ｔｈｅ ｈｉｇｈ￣ｄｉｍｅｎｓｉｏｎａｌ ｔｅｓｔ ｆｕｎｃｔｉｏｎｓ. [ABSTRACT FROM AUTHOR]