Decentralized multi-level uncapacitated lot-sizing by automated negotiation

被引:20
作者
Homberger, Joerg [1 ]
机构
[1] Stuttgart Univ Appl Sci, D-70174 Stuttgart, Germany
来源
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2010年 / 8卷 / 02期
关键词
Automated negotiation; Production coordination; Lot-sizing; Simulated annealing; SUPPLY CHAINS; COORDINATION; ALGORITHMS; COMPLEXITY;
D O I
10.1007/s10288-009-0104-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
An automated negotiation mechanism for decentralized production coordination is presented and evaluated. The coordination problem contains a set of self-interested software agents, representing the production facilities of a supply chain, searching for a mutually agreeable production plan, while taking private information into account. The negotiation mechanism is applied and evaluated using a multi-facility production coordination problem, which is a reformulation of the well-known multi-level uncapacitated lot-sizing problem (MLULSP). The basic element of the mechanism is a decentralized simulated annealing method, consisting of a transition rule carried out by a neutral mediator agent and a cooperative acceptance rule carried out by negotiating agents. We use 176 benchmark problems from relevant literature for the evaluation. Experimental results show that the proposed negotiation mechanism comes close to those results which are obtained by centralized planning. Furthermore, the developed simulated annealing method applied in a single, centralized planning task is competitive with the best known solution methods for the MLULSP. It was possible to compute new best solutions for 24 of the benchmark problems.
引用
收藏
页码:155 / 180
页数:26
相关论文
共 59 条
  • [41] Service rings -: A semantic overlay for service discovery in ad hoc networks
    Klein, M
    König-Ries, B
    Obreiter, P
    [J]. 14TH INTERNATIONAL WORKSHOP ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, : 180 - 185
  • [42] Klein M, 2002, LECT NOTES ARTIF INT, V2531, P194
  • [43] Protocols for negotiating complex contracts
    Klein, M
    Faratin, P
    Sayama, H
    Bar-Yam, Y
    [J]. IEEE INTELLIGENT SYSTEMS, 2003, 18 (06): : 32 - 38
  • [44] Negotiating complex contracts
    Klein, M
    Faratin, P
    Sayama, H
    Bar-Yam, Y
    [J]. GROUP DECISION AND NEGOTIATION, 2003, 12 (02) : 111 - 125
  • [45] MULTILEVEL LOT-SIZING PROBLEM - EVALUATION OF A SIMULATED-ANNEALING HEURISTIC
    KUIK, R
    SALOMON, M
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 45 (01) : 25 - 37
  • [46] Distributed project scheduling with information sharing in supply chains: part II - theoretical analysis and computational study
    Lau, JSK
    Huang, GQ
    Mak, KL
    Liang, L
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2005, 43 (23) : 4899 - 4927
  • [47] A classification scheme for negotiation in electronic commerce
    Lomuscio, AR
    Wooldridge, M
    Jennings, NR
    [J]. GROUP DECISION AND NEGOTIATION, 2003, 12 (01) : 31 - 56
  • [48] A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
    Pitakaso, Rapeepan
    Almeder, Christian
    Doerner, Karl F.
    Hartl, Richard F.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (09) : 2533 - 2552
  • [49] Salomon M., 1993, Annals of Operations Research, V41, P453, DOI 10.1007/BF02023005
  • [50] Sandholm T, 2003, LECT NOTES COMPUT SC, V2833, P19