Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Li, Jiaa | Xue, Shuaihaoa | Li, Minghuia; c; d | Shi, Xiaoqiua; b; e; *
Affiliations: [a] School of Manufacturing Science and Engineering, Southwest University of Science and Technology, Mianyang, China | [b] State Key Laboratory of Intelligent Manufacturing Equipment and Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan, China | [c] Low Speed Aerodynamics Institute, China Aerodynamics Research and Development Center, Mianyang Sichuan, China | [d] Key Laboratory of Icing and Anti/De-icing, China Aerodynamics Research and Development Center, Mianyang Sichuan, China | [e] Mianyang Science and Technology City Intelligent Manufacturing Industry Technology Innovation Institute, Mianyang Sichuan, China
Correspondence: [*] Corresponding author. Xiaoqiu Shi, Southwest University of Science and Technology, Mianyang 621000, China. E-mail: xiaoqiu_shi@swust.edu.cn.
Abstract: Combining the harmony search algorithm (HS) with the local search algorithm (LS) can prevent the HS from falling into a local optimum. However, how LS affects the performance of HS has not yet been studied systematically. Therefore, in this paper, it is first proposed to combine four frequently used LS with HS to obtain several search algorithms (HSLSs). Then, by taking the flexible job-shop scheduling problem (FJSP) as an example and considering decoding times, study how the parameters of HSLSs affect their performance, where the performance is evaluated by the difference rate based on the decoding times. The simulation results mainly show that (I) as the harmony memory size (HMS) gradually increases, the performance of HSLSs first increases rapidly and then tends to remain unchanged, and HMS is not the larger the better; (II) as harmony memory considering rate increases, the performance continues to improve, while the performance of pitch adjusting rate on HSLSs goes to the opposite; Finally, more benchmark instances are also used to verify the effectiveness of the proposed algorithms. The results of this paper have a certain guiding significance on how to choose LS and other parameters to improve HS for solving FJSP.
Keywords: Algorithm analysis, local search, harmony search, flexible job-shop scheduling problem
DOI: 10.3233/JIFS-239142
Journal: Journal of Intelligent & Fuzzy Systems, vol. Pre-press, no. Pre-press, pp. 1-14, 2024
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl