Profit Maximization of Ethanol Distribution on Manifold Surfaces: A Stochastic Nonlinear Programming Approach

Background. Ethanol distribution in the energy supply chain can be maximized by solving a Location Routing Problem (LRP). Manifold LRP (MLRP) expands on the classic domain assumptions of LRP to manifold surfaces, and it can be applied to profit maximization in ethanol supply chains. Methods. In this work, a hybrid MLRP (H-MLRP) is introduced as a new mixed integer nonlinear programming NP-hard problem assuming discrete facility allocation that requires a mix of truck and train transportation for ethanol distribution from the facility to its customers. Ethanol supply chain profit can be maximized by solving a stochastic nonlinear integer programming problem (SNLP) using ethanol raw materials, production quantity, logistics, railcar shipments, and transit times as the decision variables. H-MLRP and SNLP are combined as a two-stage optimization methodology to design a biofuel energy distribution system for making optimal decisions to maximize ethanol profit. Results. A case study demonstrated the effectiveness of the proposed method on the relocation of an ethanol producer that is currently located in North Dakota (ND) to Oklahoma (OK). In this case study, customer demand destinations and suppliers of raw materials are located in different regions of the United States. Conclusions. The results indicate a good use of the new model for decision-making.

Authors

Institutions

Publication Details

Journal
Logistics
Published
2026-05-01
DOI
https://doi.org/10.3390/logistics10050101
Primary Topic
Forest Biomass Utilization and Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Profit Maximization of Ethanol Distribution on Manifold Surfaces: A Stochastic Nonlinear Programming Approach

Emre Tokgöz, Theodore Trafalis, Iddrisu Awudu
Logistics
Forest Biomass Utilization and Management
article

Profit Maximization of Ethanol Distribution on Manifold Surfaces: A Stochastic Nonlinear Programming Approach

Emre Tokgöz, Theodore Trafalis, Iddrisu Awudu
article en

Abstract

Background. Ethanol distribution in the energy supply chain can be maximized by solving a Location Routing Problem (LRP). Manifold LRP (MLRP) expands on the classic domain assumptions of LRP to manifold surfaces, and it can be applied to profit maximization in ethanol supply chains. Methods. In this work, a hybrid MLRP (H-MLRP) is introduced as a new mixed integer nonlinear programming NP-hard problem assuming discrete facility allocation that requires a mix of truck and train transportation for ethanol distribution from the facility to its customers. Ethanol supply chain profit can be maximized by solving a stochastic nonlinear integer programming problem (SNLP) using ethanol raw materials, production quantity, logistics, railcar shipments, and transit times as the decision variables. H-MLRP and SNLP are combined as a two-stage optimization methodology to design a biofuel energy distribution system for making optimal decisions to maximize ethanol profit. Results. A case study demonstrated the effectiveness of the proposed method on the relocation of an ethanol producer that is currently located in North Dakota (ND) to Oklahoma (OK). In this case study, customer demand destinations and suppliers of raw materials are located in different regions of the United States. Conclusions. The results indicate a good use of the new model for decision-making.

LogisticsVol. 10(5)
Farmingdale State College (US), Quinnipiac University (US), University of Oklahoma (US)
Affordable and clean energy
Openalex Percentile: Top 10%
Forest Biomass Utilization and Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.