Skip to main content
SpringerLink
Log in
Book cover

German Conference on Multiagent System Technologies

MATES 2013: Multiagent System Technologies pp 166–179Cite as

Agent-Negotiation of Lot-Sizing Contracts by Simulated Annealing with Part-Way Resets

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8076))

Abstract

The distributed multi-level uncapacitated lot-sizing problem is a group decision problem which has to be solved by a set of self-interested and autonomous agents. The agents represent independent companies which have to agree on a joint production plan in a supply chain context. In order to solve the problem we extend a negotiation-based simulated annealing approach introduced by Homberger by a part-way reset procedure. The part-way reset procedure allows a negotiation based search which reaches a deadlock to continue with a different contract proposal and thereby offers a possibility of overcoming disagreements between agents more easily. A benchmark study shows that the approach is competitive on set of 80 medium sized instances from the literature in terms of solution quality, in particular 47 new best-known solutions were computed.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Klein, M., Faratin, P., Sayama, H., Bar-Yam, Y.: Negotiating complex contracts. Group Decision and Negotiation 12(2), 111–125 (2003)

    Article  Google Scholar 

  2. Frayret, J.M.: A multidisciplinary review of collaborative supply chain planning. In: IEEE Int. Conf. on Systems, Man and Cybernetics, 2009, pp. 4414–4421 (2009)

    Google Scholar 

  3. Stadtler, H.: A framework for collaborative planning and state-of-the-art. OR Spectrum 31(1), 5–30 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Pankratz, G.: Analyse kombinatorischer Auktionen für ein Multi-Agentensystem zur Lösung des Groupage-Problems kooperierender Speditionen. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds.) Operations Research Proceedings 1999, pp. 443–448. Springer, Berlin (2000)

    Chapter  Google Scholar 

  5. Berger, S., Bierwirth, C.: Solutions to the request reassignment problem in collaborative carrier networks. Transportation Research Part E: Logistics and Transportation Review 46(5), 627–638 (2010)

    Article  Google Scholar 

  6. Buer, T., Kopfer, H.: Shipper decision support for the acceptance of bids during the procurement of transport services. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds.) ICCL 2011. LNCS, vol. 6971, pp. 18–28. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Buer, T., Kopfer, H.: A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction. Computers & Operations Research (in press, 2013), doi: 10.1016/j.cor.2013.04.004

    Google Scholar 

  8. Lang, F., Fink, A.: Negotiating in dynamic environments: time-efficient automated negotiations by means of combinatorial auctions. Evolving Systems 3(3), 189–201 (2012)

    Article  Google Scholar 

  9. Homberger, J.: A (μ, λ)-coordination mechanism for agent-based multi-project scheduling. OR Spectrum 34(1), 107–132 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fink, A., Homberger, J.: An ant-based coordination mechanism for resource-constrained project scheduling with multiple agents and cash flow objectives. Flexible Services and Manufacturing Journal 25(1-2), 94–121 (2013)

    Article  Google Scholar 

  11. Lang, F., Fink, A.: Collaborative single and parallel machine scheduling by autonomous agents. In: Int. Conf. on Collaboration Technologies and Systems (CTS), pp. 76–83 (2012)

    Google Scholar 

  12. Ertogral, K., Wu, S.: Auction-theoretic coordination of production planning in the supply chain. IIE Transactions 32(10), 931–940 (2000)

    Google Scholar 

  13. Fink, A.: Supply chain coordination by means of automated negotiation between autonomous agents. In: Multiagent-based supply chain management, pp. 351–372. Springer, Berlin (2006)

    Chapter  Google Scholar 

  14. Dudek, G., Stadtler, H.: Negotiation-based collaborative planning between supply chains partners. European Journal of Operational Research 163(3), 668–687 (2005)

    Article  MATH  Google Scholar 

  15. Dudek, G., Stadtler, H.: Negotiation-based collaborative planning in divergent two-tier supply chains. International Journal of Production Research 45(2), 465–484 (2007)

    Article  MATH  Google Scholar 

  16. Drechsel, J., Kimms, A.: Cooperative lot sizing with transshipments and scarce capacities: solutions and fair cost allocations. International Journal of Production Research 49(9), 2643–2668 (2011)

    Article  Google Scholar 

  17. Homberger, J.: Decentralized multi-level uncapacitated lot-sizing by automated negotiation. 4OR: A Quarterly Journal of Operations Research 8, 155–180 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  18. Yelle, L.: Materials requirements lot sizing: A multilevel approach. International Journal of Production Research 17(3), 223–232 (1979)

    Article  Google Scholar 

  19. Arkin, E., Joneja, D., Roundy, R.: Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters 8(2), 61–66 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  20. Homberger, J.: A generic coordination mechanism for lot-sizing in supply chains. Electronic Commerce Research 11(2), 123–149 (2011)

    Article  Google Scholar 

  21. Homberger, J., Gehring, H.: A pheromone-based negotiation mechanism for lot-sizing in supply chains. In: Proceedings of the 44nd Hawaii International Conference on System Sciences, pp. 1–10. IEEE Computer Society, Washington, DC (2010)

    Google Scholar 

  22. Buer, T., Homberger, J., Gehring, H.: A collaborative ant colony metaheuristic for distributed multi-level uncapacitated lot-sizing. International Journal of Production Research (in press, 2013), doi: 10.1080/00207543.2013.802822

    Google Scholar 

  23. Steinberg, E., Napier, H.: Optimal multi-level lot sizing for requirements planning systems. Management Science 26(12), 1258–1271 (1980)

    Article  MATH  Google Scholar 

  24. Dellaert, N., Jeunet, J.: Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm. International Journal of Production Research 38(5), 1083–1099 (2000)

    Article  MATH  Google Scholar 

  25. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  26. Homberger, J.: A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem. INFORMS Journal on Computing 20(1), 124–132 (2008)

    Article  MATH  Google Scholar 

  27. Resende, M.G., Ribeiro, C.C.: Greedy randomized adaptive search procedures: Advances and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, 2nd edn., pp. 281–317. Springer, Berlin (2010)

    Google Scholar 

  28. Afentakis, P., Gavish, B.: Optimal lot-sizing algorithms for complex product structures. Operations Research 34(2), 237–249 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  29. Pitakaso, R., Almeder, C., Doerner, K., Hartl, R.: A max-min ant system for unconstrained multi-level lot-sizing problems. Computers & Operations Research 34(9), 2533–2552 (2007)

    Article  MATH  Google Scholar 

  30. Xiao, Y., Kaku, I., Zhao, Q., Zhang, R.: A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems. European Journal of Operational Research 214(2), 223–231 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Business Studies & Economics, Chair of Logistics, University of Bremen, Bremen, Germany

    Mario Ziebuhr, Tobias Buer & Herbert Kopfer

Authors
  1. Mario Ziebuhr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tobias Buer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Herbert Kopfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deutsches Forschungszentrum für Künstiliche Intelligenz (DFKI GmbH) Forschungsbereich Agenten und Simulierte Realität, Campus Gebäude D 3 2, D-66123, Saarbrücken, Germany

    Matthias Klusch

  2. WeST – Institute for Web Science and Technologies, University of Koblenz-Landau, 56070, Koblenz, Germany

    Matthias Thimm

  3. Systems Research Institute Polish Academy of Sciences, Warsaw, Poland

    Marcin Paprzycki

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ziebuhr, M., Buer, T., Kopfer, H. (2013). Agent-Negotiation of Lot-Sizing Contracts by Simulated Annealing with Part-Way Resets. In: Klusch, M., Thimm, M., Paprzycki, M. (eds) Multiagent System Technologies. MATES 2013. Lecture Notes in Computer Science(), vol 8076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40776-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40776-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40775-8

  • Online ISBN: 978-3-642-40776-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation