Managing congestion in a multi-modal transportation network under biomass supply uncertainty

Sushil R. Poudel (), Md Abdul Quddus (), Mohammad Marufuzzaman (), Linkan Bian () and Reuben F. Burch V ()
Additional contact information
Sushil R. Poudel: Mississippi State University
Md Abdul Quddus: Mississippi State University
Mohammad Marufuzzaman: Mississippi State University
Linkan Bian: Mississippi State University
Reuben F. Burch V: Mississippi State University

Annals of Operations Research, 2019, vol. 273, issue 1, No 25, 739-781

Abstract: Abstract This research presents a two-stage stochastic programming model that is used to design and manage a biomass co-firing supply chain network under feedstock supply uncertainty. The model we propose extends current models by taking congestion effects into account. A non-linear cost term is added in the objective function representing the congestion factor which increases exponentially as flow of biomass approaches the capacity of multi-modal facility. We first linearize the model and then use a nested decomposition algorithm to obtain a feasible solution in a reasonable amount of time. The nested decomposition algorithm that we propose combine constraint Generation algorithm with a sample average approximation and Progressive Hedging (PH) algorithm. We apply some heuristics such as rolling horizon algorithm and variable fixing technique to enhance the performance of the PH algorithm. We develop a case study using data from the states of Mississippi and Alabama and use those regions to test and validate the performance of the proposed algorithm. Numerical experiments show that the proposed algorithm can solve large-scale problems with a larger number of scenarios and time periods to a near optimal solution in a reasonable amount of time. Results obtained from the experiments reveal that the delivery cost increases and less hubs with higher capacity are selected if we take congestion cost into account.

Keywords: Biomass supply chain network; Multi-modal facilities; Constraint-generation algorithm; Sample average approximation; Progressive Hedging algorithm; Rolling horizon heuristics (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2499-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:273:y:2019:i:1:d:10.1007_s10479-017-2499-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2499-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().