LOCATION OF ALTERNATIVE-FUEL REFUELING STATIONS ON TRANSPORTATION NETWORKS CONSIDERING VEHICLE DEVIATIONS AND GREENHOUSE GAS EMISSIONS
Open Access
- Author:
- Kweon, Sang Jin
- Graduate Program:
- Industrial Engineering
- Degree:
- Doctor of Philosophy
- Document Type:
- Dissertation
- Date of Defense:
- May 08, 2017
- Committee Members:
- Jose A. Ventura, Dissertation Advisor/Co-Advisor
Jose A. Ventura, Committee Chair/Co-Chair
Vittaldas V. Prabhu, Committee Member
Uday V. Shanbhag, Committee Member
Venky N. Shankar, Outside Member - Keywords:
- Alternative-fuel vehicles
bi-criteria optimization
GHG emission reduction
Facility location
Refueling station
Tree network
Deviation-flow
Polynomial-time algorithm - Abstract:
- Burning conventional fossil fuels including gasoline and diesel mainly results in over 90% of greenhouse gas emissions from transportation. To reduce these emissions from the ground transportation sector, the use of alternative-fuel vehicles is being spotlighted. As a result, refueling station location problems for alternative-fuel vehicles have received attention as well. These refueling station location problems can be classified into two types depending on the set of candidate sites: when a preliminary (finite) set of candidate sites is given, this problem is called discrete; when the stations can be located anywhere along the network, the problem is called continuous. This dissertation considers one discrete and two continuous location problems for alternative-fuel refueling stations on transportation networks. First, the discrete location problem is addressed with two conflicting objectives of maximizing the total vehicle-miles traveled per time unit covered by the stations and minimizing the capital cost for constructing the refueling infrastructure. Two versions of bi-criteria binary linear programming models are proposed and validated with an application to the Pennsylvania Turnpike System regarding the location of liquefied natural gas refueling stations on existing service plazas. Next, assuming that a vehicle cannot deviate from the preplanned path, the continuous location problem for a single refueling station is addressed on a tree network with the objective of maximizing the traffic flow (in round trips per time unit) covered by the station. Two reduction properties regarding the problem size and some optimality conditions are derived. Then, an exact polynomial algorithm is developed to determine the set of optimal locations for the refueling station. Lastly, the continuous location problem introduced above is extended to a version where a given portion of drivers are willing to deviate to be able to refuel if the station is not located along their preplanned routes. Optimality properties and exact polynomial algorithms are suggested to determine the deviation options and find the set of optimal station locations that maximizes the traffic flow (in round trips per time unit) covered by the station.