| 基于粒子群优化和禁忌搜索的混合调度算法 |
| |
| 引用本文： | 管显笋,石伟铂,邓成玉,刘永山.基于粒子群优化和禁忌搜索的混合调度算法[J].计算机应用与软件,2011,28(5). |
| |
| 作者姓名： | 管显笋 石伟铂 邓成玉 刘永山 |
| |
| 作者单位： | 1. 燕山大学信息科学与工程学院,河北,秦皇岛,066004
2. 燕山大学图书馆,河北,秦皇岛,066004 |
| |
| 基金项目： | 工信部2008电子信息产业发展基金(工信部运[2008]97号) |
| |
| 摘 要： | 提出了用于解决作业车间调度问题的离散版粒子群优化算法。该算法采用基于先后表编码方案和新的位移更新模型,使具有连续本质的粒子群优化算法直接适用于车间调度问题。同时,利用粒子群优化算法的全局搜索能力和禁忌搜索算法的自适应优点,将粒子群优化算法和禁忌搜索结合起来,设计了广义粒子群优化算法和粒子群—禁忌搜索交替算法两种混合调度算法。实验结果表明,两种混合调度算法能够有效地、高质量地解决作业车间调度问题。
|
| 关 键 词： | 作业车间调度问题 粒子群优化 禁忌搜索 混合算法 |
HYBRID SCHEDULING HEURISTICS BASED ON PARTICLE SWARM OPTIMISATION AND TABU SEARCH |
| |
| Guan Xiansun,Shi Weibo,Deng Chengyu,Liu Yongshan.HYBRID SCHEDULING HEURISTICS BASED ON PARTICLE SWARM OPTIMISATION AND TABU SEARCH[J].Computer Applications and Software,2011,28(5). |
| |
| Authors: | Guan Xiansun Shi Weibo Deng Chengyu Liu Yongshan |
| |
| Affiliation: | Guan Xiansun1 Shi Weibo2 Deng Chengyu1 Liu Yongshan11(Institute of Information Science and Engineering,Yanshan University,Qinhuangdao 066004,Hebei,China)2(Library,China) |
| |
| Abstract: | A discrete particle swarm optimisation(PSO) algorithm is presented for Job Shop Scheduling problem.In the algorithm,a preference list-based representation code and update model for new positions are applied so as to make the PSO with incessant nature straight suitable for the Job Shop Scheduling problem.Based on excellent whole search ability of PSO and self-adaptive merit of Tabu Search(TS),two hybrid procedures,named GPSO and PTS,are put forward by combining PSO and TS.Experimental results demonstrate tha... |
| |
| Keywords: | Job shop scheduling problem Particle swarm optimisation Tabu search Hybrid heuristics |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
