Biofuel refinery location and supply chain planning under traffic congestion

Yun Bai, Taesung Hwang, Seungmo Kang, Yanfeng Ouyang

Research output: Contribution to journalArticle

106 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)162-175
Number of pages14
JournalTransportation Research Part B: Methodological
Volume45
Issue number1
DOIs
Publication statusPublished - 2011 Jan 1

Fingerprint

Traffic congestion
biofuel
traffic congestion
Biofuels
Supply chains
supply
Planning
Feedstocks
planning
Heuristic algorithms
costs
research focus
Linear programming
Costs
heuristics
programming
travel
experiment
Testing
Refinery

Keywords

  • Biofuel refinery location
  • Branch-and-bound
  • Lagrangian relaxation
  • Mixed-integer program
  • Supply chain planning
  • Traffic congestion

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Transportation

Cite this

Biofuel refinery location and supply chain planning under traffic congestion. / Bai, Yun; Hwang, Taesung; Kang, Seungmo; Ouyang, Yanfeng.

In: Transportation Research Part B: Methodological, Vol. 45, No. 1, 01.01.2011, p. 162-175.

Research output: Contribution to journalArticle

@article{0d910b506a7f4daab05cc27045b0962e,
title = "Biofuel refinery location and supply chain planning under traffic congestion",
abstract = "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.",
keywords = "Biofuel refinery location, Branch-and-bound, Lagrangian relaxation, Mixed-integer program, Supply chain planning, Traffic congestion",
author = "Yun Bai and Taesung Hwang and Seungmo Kang and Yanfeng Ouyang",
year = "2011",
month = "1",
day = "1",
doi = "10.1016/j.trb.2010.04.006",
language = "English",
volume = "45",
pages = "162--175",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",
number = "1",

}

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

PY - 2011/1/1

Y1 - 2011/1/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

VL - 45

SP - 162

EP - 175

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

IS - 1

ER -