A benders-local branching algorithm for second-generation biodiesel supply chain network design under epistemic uncertainty
AffiliationUniv Arizona, Dept Syst & Ind Engn
MetadataShow full item record
PublisherPERGAMON-ELSEVIER SCIENCE LTD
CitationBabazadeh, R., Ghaderi, H., & Pishvaee, M. S. (2019). A benders-local branching algorithm for second-generation biodiesel supply chain network design under epistemic uncertainty. Computers & Chemical Engineering, 124, 364-380.
JournalCOMPUTERS & CHEMICAL ENGINEERING
Rights© 2019 Elsevier Ltd. All rights reserved.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractThis paper proposes a possibilistic programming model in order to design a second-generation biodiesel supply chain network under epistemic uncertainty of input data. The developed model minimizes the total cost of the supply chain from supply centers to the biodiesel and glycerin consumer centers. Waste cooking oil and Jatropha plants, as non-edible feedstocks, are considered for biodiesel production. To cope with the epistemic uncertainty of the parameters, a credibility-based possibilistic programming approach is employed to convert the original possibilistic programming model into a crisp counterpart. An accelerated benders decomposition algorithm using efficient acceleration mechanisms is devised to deal with the computational complexity of solving the proposed model in an efficient manner. The performance of the proposed possibilistic programming model and the efficiency of the developed accelerated benders decomposition algorithm are validated by performing a computational analysis using a real case study in Iran. (C) 2019 Elsevier Ltd. All rights reserved.
Note12 month embargo; published online: 24 January 2019
VersionFinal accepted manuscript
SponsorsIran National Science Foundation (INSF)