A Job-shop Scheduling Method Based on Multi-Agent Immune Algorithm
Integrating multi-agent system and the immunity information processing mechanism of immune system in biotic science, a new approach of multi-agent immune algorithm was proposed to solve job-shop scheduling problem. In term of the characteristic of job-shop scheduling problem, an agent representing a feasible solution is given. It denotes an antibody in immune algorithm. All agents live in a lattice-like environment, with each agent fixed on a lattice-point. In the method, agents compete with their neighbors, and they also use study. In addition, they can make self-adjustment of the immune responses along with the evolution of agents and they are inoculated bacteria picked up. Furthermore, it can gradually enhance the system recovery ability, and find the optimal solution with more efficiency. Simulation results show that it is an effective and efficient approach.
Job-Shop Scheduling Problem Immune Algorithm Multi-Agent System
XU Xinli HAO Ping WANG Wanliang
College of Information Engineering, Zhejiang University of Technology, Hangzhou 310014 Software College, Zhejiang University of Technology, Hangzhou 310023, China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
2527-2532
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）