<紀要論文>
A Hybrid Particle Swarm Optimization Algorithm HPTS for the Flow-Shop Scheduling Problem

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
JaLC DOI
関連DOI
関連URI
関連情報
概要 This paper proposes a hybrid particle swarm optimization algorithm for solving Flow-Shop Scheduling Problems (FSSP) to minimize the maximum makespan. A new hybrid heuristic, based on Particle Swarm Op...timization (PSO), Tabu Search (TS) and Simulated Annealing (SA), is presented. PSO combines local search (by self-experience) with global search (by neighboring experience), achieving a high search efficiency. TS uses a memory function to avoid being trapped at a local minimum, and has emerged as an effective algorithmic approach for the FSSP. This method can also be referred to as calculation of the horizontal direction. SA employs certain probability to avoid becoming trapped in a local optimum and the search process can be controlled by the cooling schedule (also known as calculation of vertical direction). By reasonably combining these three different search algorithms, we develop a robust, fast and simply implemented hybrid optimization algorithm HPTS (Hybrid of Particle swarm optimization, Tabu search and Simulated annealing). This hybrid algorithm is applied to the standard benchmark sets and compared with other approaches. The experimental results show that the proposed algorithm could obtain the high-quality solutions within relatively short computation time. For 7 of 30 instances, new upper bounds among the unsolved problems are found in a short time in HPTS.続きを見る

本文ファイル

pdf paper1 pdf 451 KB 261  

詳細

PISSN
EISSN
NCID
レコードID
査読有無
主題
タイプ
登録日 2011.10.07
更新日 2020.11.17

この資料を見た人はこんな資料も見ています