供应链
数学优化
供应链网络
帕累托原理
计算机科学
随机规划
帕累托最优
利润(经济学)
约束(计算机辅助设计)
运筹学
功能(生物学)
生产(经济)
供应链管理
集合(抽象数据类型)
方案(数学)
多目标优化
数学
经济
微观经济学
业务
几何学
程序设计语言
营销
数学分析
生物
进化生物学
作者
Amir Azaron,Uday Venkatadri,Alireza Farhang Doost
标识
DOI:10.1080/00207543.2020.1785036
摘要
In this paper, we develop a multi-objective two-stage stochastic programming model, which takes into account the selection of warehouse and retailer sites and the decision about production levels, inventory levels, and shipping quantities among the entities of the supply chain network. The first objective function is to maximise the chain’s total profit over multiple periods, and the second objective function is to minimise the total travel times for unsatisfied customers, whose demands must be met by retailers which have been established in other markets, to maximise the chain’s responsiveness. Demands, selling prices and productions times at manufacturing sites are all considered as uncertain parameters. The two objective functions are in conflict with each other, and we use ϵ-constraint method to generate a set of Pareto optimal solutions for the proposed multi-objective problem. We then generalise the case and assume the uncertain parameters are continuously distributed random variables and use a simulation approach called sample average approximation (SAA) scheme to compute near optimal solutions to the stochastic model with potentially infinite number of scenarios. A computational study involving hypothetical networks of different sizes and a real supply chain network are presented to highlight the efficiency of the proposed solution methodology.
科研通智能强力驱动
Strongly Powered by AbleSci AI