Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering & Science》 2010-01
Add to Favorite Get Latest Update

A Hybrid Adaptive Mutation Particle Swarm Optimization Algorithm for Job-Shop Scheduling

DENG Ci-yun1,CHEN Huan-wen1,2,LIU Ze-wen2,WAN Jie1(1.School of Computer and Communications,Changsha University of Science and Technology,Changsha 410076;2.Hunan College of Information,Changsha 410200,China)  
A Hybrid Adaptive Mutation Particle Swarm Optimization algorithm is proposed for the Job Shop scheduling problem. In the process of running,the mutation probability for the current best particle is determined by two factors:the variance of the population's fitness and the current optimal solution. Through combining genetic algorithms and simulated annealing algorithms with the Adaptive Mutation PSO algorithm,numerical simulation demonstrates that within the framework of the newly designed hybrid algorithm,the NP-hard classic job shop scheduling problem can be solved efficiently.
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved