A fast discrete small-world optimization algorithm

DOI

10.2991/iccsae-15.2016.103How to use a DOI?

Keywords

Small-world network; discrete small-world optimization; permutation flowshop scheduling problem.

Abstract

The application of complex networks in optimization field has received increasing attention recently. This paper proposes a discrete small-world optimization algorithm (DSWOA) based on the small-world network theory and Six Degrees of Separation principle in sociology. The DSWOA model is composed of a lot of short-range contacts and few long-range contacts. In this algorithm, the short-range contacts achieve the fast searching and the long-range contacts can accelerate the convergence rate. Next, extensive computational experiments are conducted to compare the DSWOA with other algorithms for the permutation flowshop scheduling problems (PFSP) by using the Taillard instances [1]. In the makespan tests, the results show that DSWOA has a stronger ability of quick searching, especially in the small-size problems. From the analysis results, the DSWOA has higher search efficiency than other algorithms.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhipeng Tian
AU  - Haiping Zhu
AU  - Xinyu Shao
PY  - 2016/02
DA  - 2016/02
TI  - A fast discrete small-world optimization algorithm
BT  - Proceedings of the 2015 5th International Conference on Computer Sciences and Automation Engineering
PB  - Atlantis Press
SP  - 560
EP  - 564
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccsae-15.2016.103
DO  - 10.2991/iccsae-15.2016.103
ID  - Tian2016/02
ER  -