Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming

被引:3
|
作者
Albornoz, Victor M. [1 ]
Vera, Patricio, I [1 ]
机构
[1] Univ Tecn Federico Santa Maria, Dept Ind, Campus Santiago Vitacura,Av Santa Maria 6400, Santiago 7660251, Chile
关键词
harvest planning problem; agricultural supply chains; OR in agriculture; bilevel programming; stochastic bilevel programming; management zones; precision agriculture; MANAGEMENT ZONES; MODEL;
D O I
10.1111/itor.13190
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses a selective harvest planning problem in the context of a hierarchical agricultural supply chain, which integrates the definition of management zones for harvest planning, and the coordination between the producer and the wholesaler. The problem is represented through a stochastic bilevel program that allows the representation of the hierarchy between the producer (leader) and a wholesaler (follower). The producer decides planning and scheduling of the selective harvest for each homogeneous management zone into the resulting partition, and the wholesaler decides the amount to be acquired to satisfy demand requirements. At each decision level, a stochastic optimization model is proposed for representing the uncertainty in future crop yields, prices, and demands, using a finite set of scenarios. A reformulation of the bilevel model into a mixed-integer linear program is provided using Karush-Kuhn-Tucker conditions and replacing the nonlinear complementary constraints allowing for the introduction of auxiliary binary variables and a big-M term. This model was applied in a case study for selective harvesting of grapes with data collected from a farm located in the south central zone of Chile. Our research shows valuable results of the proposed methodology from a set of instances representing the behavior of both decision makers under uncertainty.
引用
收藏
页码:1819 / 1842
页数:24
相关论文
共 50 条
  • [1] A stochastic programming model for supply chain planning
    Kuettner, R.
    [J]. PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE OF DAAAM BALTIC INDUSTRIAL ENGINEERING, PTS 1 AND 2, 2008, : 333 - 338
  • [2] Stochastic programming for flexible global supply chain planning
    Yingjie Fan
    Frank Schwartz
    Stefan Voß
    David L. Woodruff
    [J]. Flexible Services and Manufacturing Journal, 2017, 29 : 601 - 633
  • [3] Stochastic programming for flexible global supply chain planning
    Fan, Yingjie
    Schwartz, Frank
    Voss, Stefan
    Woodruff, David L.
    [J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2017, 29 (3-4) : 601 - 633
  • [4] Bilevel mixed-integer nonlinear programming for integrated scheduling in a supply chain network
    Jianchao Yang
    Feng Guo
    Li Luo
    Xiaoming Ye
    [J]. Cluster Computing, 2019, 22 : 15517 - 15532
  • [5] Bilevel mixed-integer nonlinear programming for integrated scheduling in a supply chain network
    Yang, Jianchao
    Guo, Feng
    Luo, Li
    Ye, Xiaoming
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 6): : 15517 - 15532
  • [6] Advances in stochastic programming and robust optimization for supply chain planning
    Govindan, Kannan
    Cheng, T. C. E.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 262 - 269
  • [7] Coordinating the supply chain in the agricultural seed industry
    Burer, Samuel
    Jones, Philip C.
    Lowe, Timothy J.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 185 (01) : 354 - 377
  • [8] Supply chain management through the stochastic goal programming model
    Azimian, Alireza
    Aouni, Belaid
    [J]. ANNALS OF OPERATIONS RESEARCH, 2017, 251 (1-2) : 351 - 365
  • [9] Supply chain management through the stochastic goal programming model
    Alireza Azimian
    Belaid Aouni
    [J]. Annals of Operations Research, 2017, 251 : 351 - 365
  • [10] Supply chain planning using multi-stage stochastic programming
    Nagar, Lokesh
    Jain, Karuna
    [J]. SUPPLY CHAIN MANAGEMENT-AN INTERNATIONAL JOURNAL, 2008, 13 (03) : 251 - 256