Teams of autonomous agents for job-shop scheduling problems: An experimental study

被引:29
作者
Aydin, ME [1 ]
Fogarty, TC [1 ]
机构
[1] S Bank Univ, Sch Comp Informat Syst & Math, London SE1 0AA, England
关键词
multi-agent systems; distributed and parallel computing; simulated annealing; taboo search;
D O I
10.1023/B:JIMS.0000034108.66105.59
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
ATeams-teams of autonomous agents co-operating by sharing solutions through a common-memory have been proposed as a means of solving combinatorial optimization problems. In this paper, the ATeam architecture is tested on the job-shop scheduling problem. The results show that the method can work, but that it depends on the portfolio of agents and on the way in which the memory is managed.
引用
收藏
页码:455 / 462
页数:8
相关论文
共 12 条
[1]  
ANKE K, 1997, WS9705 WS CONSTR AG, P142
[2]  
[Anonymous], 1996, 185996 EDRC CARN MEL
[3]  
Baker KR., 1974, Introduction to Sequencing and Scheduling
[5]  
BEASLEY JE, 1990, OR LIB
[6]  
BURKE P, 1994, INTELLIGENT SCHEDULI, P309
[7]   Agent-oriented supply-chain management [J].
Fox, MS ;
Barbuceanu, M ;
Teigen, R .
INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, 2000, 12 (2-3) :165-188
[8]  
Glover F., 1990, ORSA Journal on Computing, V2, P4, DOI [10.1287/ijoc.1.3.190, 10.1287/ijoc.2.1.4]
[9]  
KIRKPATRICK S, 1983, SCIENCE, V220, P4598
[10]  
TALUKDAR S, 1993, P 4 INT S EXP SYST A