Hybrid genetic algorithm with adaptive local search scheme for solving multistage-based supply chain problems |
| |
| Authors: | YoungSu Yun Chiung Moon Daeho Kim |
| |
| Affiliation: | 1. Division of Business Administration, Chosun University, 375 Seosuk-dong, Dong-gu, Gwangju 501-759, Republic of Korea;2. Department of Industrial Engineering, Yonsei University, 134 Sinchon-dong, Seodaemun-gu, Seoul, Republic of Korea;3. Department of Research, Air Force Safety Management Wing, P.O. Box 25, Pyeongtaek, Gyeonggi 450-600, Republic of Korea;1. School of Electrical Engineering, Qingdao University, Qingdao 266000, China;2. School of Mechanical Engineering & Automation, Beihang University, Beijing 100191, China;3. School of Materials Science and Engineering, Xi’an University of Science and Technology, Xi’an 710054, China;4. School of Information Engineering, Zhejiang University of Technology, Hangzhou 310023, China;5. Collaborative Innovation Center of Technology and Equipment for Biological Diagnosis and Therapy in Universities of Shandong, Institute for Advanced Interdisciplinary Research (iAIR), University of Jinan, Shandong, Jinan 250022, China;1. Key laboratory of Computer Integrated Manufacturing System. Guangdong University of Technology, Guangzhou, Guangdong, People''s Republic of China;2. Department of Computer Science and Technology, Guangdong University of Petrochemical Technology, Maoming, Guangdong, People''s Republic of China |
| |
| Abstract: | The optimal design of supply chain (SC) is a difficult task, if it is composed of the complicated multistage structures with component plants, assembly plants, distribution centers, retail stores and so on. It is mainly because that the multistage-based SC with complicated routes may not be solved using conventional optimization methods. In this study, we propose a genetic algorithm (GA) approach with adaptive local search scheme to effectively solve the multistage-based SC problems.The proposed algorithm has an adaptive local search scheme which automatically determines whether local search technique is used in GA loop or not. In numerical example, two multistage-based SC problems are suggested and tested using the proposed algorithm and other competing algorithms. The results obtained show that the proposed algorithm outperforms the other competing algorithms. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
