TY - JOUR
T1 - Biofuel refinery location and supply chain planning under traffic congestion
AU - Bai, Yun
AU - Hwang, Taesung
AU - Kang, Seungmo
AU - Ouyang, Yanfeng
N1 - Funding Information:
This research was supported in part by the US National Science Foundation through Grants EFRI-RESIN #0835982 and CMMI #0748067 . The third author was financially supported by the Energy Biosciences Institute while working as a post-doctoral research associate in the Department of Civil and Environmental Engineering at the University of Illinois, Urbana–Champaign.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2011/1
Y1 - 2011/1
N2 - This research focuses on planning biofuel refinery locations where the total system cost for refinery investment, feedstock and product transportation and public travel is minimized. Shipment routing of both feedstock and product in the biofuel supply chain and the resulting traffic congestion impact are incorporated into the model to decide optimal locations of biofuel refineries. A Lagrangian relaxation based heuristic algorithm is introduced to obtain near-optimum feasible solutions efficiently. To further improve optimality, a branch-and-bound framework (with linear programming relaxation and Lagrangian relaxation bounding procedures) is developed. Numerical experiments with several testing examples demonstrate that the proposed algorithms solve the problem effectively. An empirical Illinois case study and a series of sensitivity analyses are conducted to show the effects of highway congestion on refinery location design and total system costs.
AB - This research focuses on planning biofuel refinery locations where the total system cost for refinery investment, feedstock and product transportation and public travel is minimized. Shipment routing of both feedstock and product in the biofuel supply chain and the resulting traffic congestion impact are incorporated into the model to decide optimal locations of biofuel refineries. A Lagrangian relaxation based heuristic algorithm is introduced to obtain near-optimum feasible solutions efficiently. To further improve optimality, a branch-and-bound framework (with linear programming relaxation and Lagrangian relaxation bounding procedures) is developed. Numerical experiments with several testing examples demonstrate that the proposed algorithms solve the problem effectively. An empirical Illinois case study and a series of sensitivity analyses are conducted to show the effects of highway congestion on refinery location design and total system costs.
KW - Biofuel refinery location
KW - Branch-and-bound
KW - Lagrangian relaxation
KW - Mixed-integer program
KW - Supply chain planning
KW - Traffic congestion
UR - http://www.scopus.com/inward/record.url?scp=78149500409&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78149500409&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2010.04.006
DO - 10.1016/j.trb.2010.04.006
M3 - Article
AN - SCOPUS:78149500409
SN - 0191-2615
VL - 45
SP - 162
EP - 175
JO - Transportation Research, Series B: Methodological
JF - Transportation Research, Series B: Methodological
IS - 1
ER -
