期刊
CYBERNETICS AND INFORMATION TECHNOLOGIES
卷 19, 期 4, 页码 26-44出版社
INST INFORMATION & COMMUNICATION TECHNOLOGIES-BULGARIAN ACAD SCIENCES
DOI: 10.2478/cait-2019-0034
关键词
Flexible Job Shop Scheduling Problem (FJSSP); Particle Swarm Optimization (PSO); Tabu Search (TS)
The paper presents a hybrid metaheuristic algorithm, including a Particle Swarm Optimization (PSO) procedure and elements of Tabu Search (TS) metaheuristic. The novel algorithm is designed to solve Flexible Job Shop Scheduling Problems (FJSSP). Twelve benchmark test examples from different reference sources are experimentaly tested to demonstrate the performance of the algorithm. The obtained mean error for the deviation from optimality is 0.044%. The obtained test results are compared to the results in the reference sources and to the results by a genetic algorithm. The comparison illustrates the good performance of the proposed algorithm. Investigations on the base of test examples with a larger dimension will be carried out with the aim of further improvement of the algorithm and the quality of the test results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据