Biorefinery supply chain network design under competitive feedstock markets: An agent-based simulation and optimization approach. Singh, A., Chu, Y., & You, F. Industrial and Engineering Chemistry Research, 2014.
abstract   bibtex   
? 2014 American Chemical Society.We address the problem of biorefinery supply chain network design under competitive corn markets. Unlike existing methods, the purchase prices of corn are considered to vary not only across time but also across competing biorefineries in a given region for all time periods in the design horizon. As the feedstock cost for purchasing corn is the largest cost component for producing ethanol, it is critical to consider the formation of corn prices in real-world markets involving competition and interactions among biorefineries, among farmers, and between biorefineries and the food market. However, these competitive markets are difficult to formulate in a mathematical program. To simulate the corn markets, an agent-based model is developed. In each market, the dynamic corn prices are determined by a double-auction process participated in by biorefinery agents, farmer agents, and a food market agent. The determined corn prices are then returned to the supply chain design problem, which is a mixed-integer nonlinear program (MINLP) with black-box functions. However, such a problem cannot be solved directly by a MINLP solver. Thus, we use a genetic algorithm to solve the optimization problem and determine the location and capacity of each biorefinery in the network. The proposed method is demonstrated by a case study on a corn-based biorefinery supply chain network design in Illinois in which the optimal net present value of a network of 10 biorefineries increased by 10.7% compared to that of the initial supply chain network.
@article{
 title = {Biorefinery supply chain network design under competitive feedstock markets: An agent-based simulation and optimization approach},
 type = {article},
 year = {2014},
 identifiers = {[object Object]},
 volume = {53},
 id = {fe1fa9a7-bfdc-37eb-a02d-af750a37d2f4},
 created = {2016-08-19T13:20:33.000Z},
 file_attached = {false},
 profile_id = {f27171f8-b200-3870-9028-dcb6a084733d},
 last_modified = {2017-03-25T02:01:24.507Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {? 2014 American Chemical Society.We address the problem of biorefinery supply chain network design under competitive corn markets. Unlike existing methods, the purchase prices of corn are considered to vary not only across time but also across competing biorefineries in a given region for all time periods in the design horizon. As the feedstock cost for purchasing corn is the largest cost component for producing ethanol, it is critical to consider the formation of corn prices in real-world markets involving competition and interactions among biorefineries, among farmers, and between biorefineries and the food market. However, these competitive markets are difficult to formulate in a mathematical program. To simulate the corn markets, an agent-based model is developed. In each market, the dynamic corn prices are determined by a double-auction process participated in by biorefinery agents, farmer agents, and a food market agent. The determined corn prices are then returned to the supply chain design problem, which is a mixed-integer nonlinear program (MINLP) with black-box functions. However, such a problem cannot be solved directly by a MINLP solver. Thus, we use a genetic algorithm to solve the optimization problem and determine the location and capacity of each biorefinery in the network. The proposed method is demonstrated by a case study on a corn-based biorefinery supply chain network design in Illinois in which the optimal net present value of a network of 10 biorefineries increased by 10.7% compared to that of the initial supply chain network.},
 bibtype = {article},
 author = {Singh, A. and Chu, Y. and You, F.},
 journal = {Industrial and Engineering Chemistry Research},
 number = {39}
}

Downloads: 0