A parallel membrane inspired harmony search for optimization problems: A case study based on a flexible job shop scheduling problem |
| |
| Affiliation: | 1. Center for Software Technology and Management, Faculty of Information Science and Technology, National University of Malaysia, 43600 Bangi, Selangor, Malaysia;2. Department of Computer Engineering and IT, University of Torbat Heydarieh, Torbat Heydarieh, Khorasan Razavi, Iran;1. Department of Electrical Engineering and Computer Science, Case Western Reserve University,10900 Euclid Ave., Cleveland, OH 44106, USA;2. Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Ave., 15875-4413 Tehran, Iran;1. School of Mechanical Engineering, Hubei University of Technology, Wuhan 430068, China;2. Hubei Digital Manufacturing Key Laboratory, School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan 430070, China;1. College of Management Science & Engineering, Dongbei University of Finance and Economics (DUFE), Dalian, Shahekou, 116025, China;2. Dept of Systems Engineering, Northeastern University (NEU), Shenyang, 110004, China;1. Department of Mechanical Engineering, AUCE, Visakha Patnam, AP, India;2. Department of Production Engineering, Birla Institute of Technology, Ranchi, India;3. Department of Production and Systems, School of Engineering, University of Minho, Portugal;4. School of Mechanical Engineering, VIT University, Vellore, Tamil Nadu, India;1. School of Computer Science, Wuhan University of Science and Technology, Wuhan 420081, China;2. Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System, Wuhan 430081, China;3. The Logistics Research Center, Nankai University, Tianjin 300071, China;4. Key Laboratory of Image Processing and Intelligent Control, School of Automation, Huazhong University of Science and Technology, Wuhan 430074, China;5. Faculty of Engineering, Computing and Science, Swinburne University of Technology, Sarawak Campus, Kuching 93350, Malaysia |
| |
| Abstract: | Harmony search is an emerging meta-heuristic optimization algorithm that is inspired by musical improvisation processes, and it can solve various optimization problems. Membrane computing is a distributed and parallel model for solving hard optimization problems. First, we employed some previously proposed approaches to improve standard harmony search by allowing its parameters to be adaptive during the processing steps. Information from the best solutions was used to improve the speed of convergence while preventing premature convergence to a local minimum. Second, we introduced a parallel framework based on membrane computing to improve the harmony search. Our approach utilized the parallel membrane computing model to execute parallelized harmony search efficiently on different cores, where the membrane computing communication characteristics were used to exchange information between the solutions on different cores, thereby increasing the diversity of harmony search and improving the performance of harmony search. Our simulation results showed that the application of the proposed approach to different variants of harmony search yielded better performance than previous approaches. Furthermore, we applied the parallel membrane inspired harmony search to the flexible job shop scheduling problem. Experiments using well-known benchmark instances showed the effectiveness of the algorithm. |
| |
| Keywords: | Harmony search Membrane computing Parallel membrane inspired harmony search Evolutionary algorithms Flexible job shop scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
