数学优化
计算机科学
随机规划
设施选址问题
随机建模
随机过程
随机优化
时间范围
马尔可夫决策过程
计算
布线(电子设计自动化)
决策问题
集合(抽象数据类型)
运筹学
期望值
最优决策
线性规划
总成本
无线
数学
作者
Mengru Wang,Jie Zhang,Yunxiang Lv,Yu Yang,Zhiguo Shao
标识
DOI:10.1142/s021759592650003x
摘要
This research presents a multi-period, two-stage stochastic mobile facility (MF) location problem (2S-SMFLP) related to fresh food harvesting. The objective is to determine the optimal locations for MFs and allocate personnel prior to the delivery of fresh food to designated facilities. This comprehensive methodology encompasses two levels: the design level, which addresses the location of MFs, staffing, and mobile routing decisions, and the operational level, which focuses on transportation and penalties for non-compliance. We calibrate decisions to minimize expected costs associated with the location and transportation scheme within the harvesting system, accounting for uncertain yields. This study considers a planning horizon characterized by fluctuating yields of fresh produce across multiple periods. As a result, the 2S-SMFLP under stochastic yield presents a complex multistage decision problem. We employ a two-stage stochastic harvesting approach with linear recourse, which is suitable given the strategic nature of the problem. The size of the stochastic set is adjusted using the sample average approximation (SAA) method. The Benders Decomposition (BD) technique is utilized to efficiently decompose and solve the two-stage stochastic model. Computational experiments are conducted based on various distributions to validate the model. We compare the deterministic harvesting model with the stochastic harvesting model for fresh food. The results of the computations demonstrate that this method holds practical value for the harvesting of fresh food.
科研通智能强力驱动
Strongly Powered by AbleSci AI