Resource allocation and route planning under the collection price uncertainty for the biomass supply chain

被引:4
作者
Wang, Xiang Ting [1 ]
Cao, Jin Xin [2 ,3 ]
Lv, Ying [1 ]
机构
[1] Beijing Jiaotong Univ, Sch Syst Sci, Beijing 100044, Peoples R China
[2] Inner Mongolia Acad Sci & Technol, Hohhot 010010, Peoples R China
[3] Inner Mongolia Univ, Inst Transportat Engn, Hohhot 010070, Peoples R China
基金
中国国家自然科学基金;
关键词
Stochastic programming; Mixed integer programming model; Hybrid simulated annealing algorithm; Sample average approximation; PROGRAMMING APPROACH; OPTIMIZATION; DESIGN; BIOENERGY; DEMAND; ISSUES;
D O I
10.1016/j.biosystemseng.2024.03.011
中图分类号
S2 [农业工程];
学科分类号
0828 ;
摘要
The escalating severity of global warming has drawn worldwide attention to ecological problems. Nevertheless, with the introduction of environmental policies, biomass resources have been effectively developed as a renewable energy source. This paper investigates an advanced biomass supply chain design wherein biomass resources are initially converted into bio-oil through widely distributed fast pyrolysis facilities, and are subsequently transported to a centralised biorefinery for further refining into biofuels. This novel biomass supply chain addressed three key issues: (1) The number of fast pyrolysis facilities, (2) The allocation of resources, and (3) The routes of resources transport. In respect of these problems, a two-stage stochastic mixed integer programming model is established to minimise the total cost of the biomass supply chain considering the uncertainty collection price of fast pyrolysis facilities. A hybrid simulated annealing algorithm which incorporates the sample average approximation method is proposed to solve the stochastic model and is effectiveness for large-scale examples. Finally, a sensitivity analysis is performed using the proposed algorithm and the results show that the proposed stochastic model outperforms the deterministic model under uncertain collection price. The model allows optimising the biomass supply chain economic performances and minimise financial risk on investment by determining the fast pyrolysis facility locations, reasonable resource allocation and optimal transport routes under uncertain collection price.
引用
收藏
页码:68 / 82
页数:15
相关论文
共 52 条
[1]   Optimization of vehicle routing with inventory allocation problems in Cold Supply Chain Logistics [J].
Al Theeb, Nader ;
Smadi, Hazem J. ;
Al-Hawari, Tarek H. ;
Aljarrah, Manar H. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 142
[2]   Modeling and solving a capacitated stochastic location-allocation problem using sub-sources [J].
Alizadeh, Morteza ;
Mahdavi-Amiri, Nezam ;
Shiripour, Saber .
SOFT COMPUTING, 2016, 20 (06) :2261-2280
[3]   A capacitated location-allocation problem with stochastic demands using sub-sources: An empirical study [J].
Alizadeh, Morteza ;
Mahdavi, Iraj ;
Mahdavi-Amiri, Nezam ;
Shiripour, Saber .
APPLIED SOFT COMPUTING, 2015, 34 :551-571
[4]   The multi-sourcing location inventory problem with stochastic demand [J].
Amiri-Aref, Mehdi ;
Klibi, Walid ;
Babai, M. Zied .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 266 (01) :72-87
[5]  
[Anonymous], 1997, Introduction to Stochastic Programming
[6]  
[Anonymous], 2023, World Energy Outlook 2023
[7]   Stochastic production planning for a biofuel supply chain under demand and price uncertainties [J].
Awudu, Iddrisu ;
Zhang, Jun .
APPLIED ENERGY, 2013, 103 :189-196
[8]   A stochastic programming approach towards optimization of biofuel supply chain [J].
Azadeh, Ali ;
Arani, Hamed Vafa ;
Dashti, Hossein .
ENERGY, 2014, 76 :513-525
[9]   Use of mobile fast pyrolysis plants to densify biomass and reduce biomass handling costs - A preliminary assessment [J].
Badger, PC ;
Fransham, P .
BIOMASS & BIOENERGY, 2006, 30 (04) :321-325
[10]   Multiobjective Robust Possibilistic Programming Approach to Sustainable Bioethanol Supply Chain Design under Multiple Uncertainties [J].
Bairamzadeh, Samira ;
Pishvaee, Mir Saman ;
Saidi-Mehrabad, Mohammad .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2016, 55 (01) :237-256