IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v57y2025i5p573-589.html
   My bibliography  Save this article

Data-driven contract design for supply chain coordination with algorithm sharing and algorithm competition

Author

Listed:
  • Zhen-Yu Chen
  • Minghe Sun

Abstract

Supply chain members can intelligently learn their decisions based on historical data by using Machine-Learning (ML) algorithms. To coordinate the supply chain, the data-driven contract design problems for three contracts—buyback, quantity flexibility, and combined quantity flexibility and rebate—were investigated for a supply chain with one manufacturer and multiple retailers under algorithm sharing and algorithm competition. The problems were formulated as bi-level optimization models by introducing nonlinear mapping from historical demand data to ordering decisions and using ML algorithms to learn the mapping parameters. The bi-level optimization models were transformed into semi-infinite programming models and solved using the (nested) cutting plane methods. Empirical studies using data from two databases showed that algorithm sharing or algorithm competition, the type of contract used, and learning algorithms were the three factors influencing the performance of supply chain coordination when using a data-driven contract design. Algorithm sharing was found to be more beneficial to the supply chain members than algorithm competition in promoting supply chain coordination. An effective incentive mechanism, such as an individualized buyback ratio and a rebate from the manufacturer to the retailers with a good forecast performance, can encourage the retailers to participate in algorithm sharing and improvement.

Suggested Citation

  • Zhen-Yu Chen & Minghe Sun, 2025. "Data-driven contract design for supply chain coordination with algorithm sharing and algorithm competition," IISE Transactions, Taylor & Francis Journals, vol. 57(5), pages 573-589, May.
  • Handle: RePEc:taf:uiiexx:v:57:y:2025:i:5:p:573-589
    DOI: 10.1080/24725854.2024.2361460
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2024.2361460
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2024.2361460?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:57:y:2025:i:5:p:573-589. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.