Matching Items (3)
Filtering by

Clear all filters

152456-Thumbnail Image.png
Description
Vehicles powered by electricity and alternative-fuels are becoming a more popular form of transportation since they have less of an environmental impact than standard gasoline vehicles. Unfortunately, their success is currently inhibited by the sparseness of locations where the vehicles can refuel as well as the fact that many of

Vehicles powered by electricity and alternative-fuels are becoming a more popular form of transportation since they have less of an environmental impact than standard gasoline vehicles. Unfortunately, their success is currently inhibited by the sparseness of locations where the vehicles can refuel as well as the fact that many of the vehicles have a range that is less than those powered by gasoline. These factors together create a "range anxiety" in drivers, which causes the drivers to worry about the utility of alternative-fuel and electric vehicles and makes them less likely to purchase these vehicles. For the new vehicle technologies to thrive it is critical that range anxiety is minimized and performance is increased as much as possible through proper routing and scheduling. In the case of long distance trips taken by individual vehicles, the routes must be chosen such that the vehicles take the shortest routes while not running out of fuel on the trip. When many vehicles are to be routed during the day, if the refueling stations have limited capacity then care must be taken to avoid having too many vehicles arrive at the stations at any time. If the vehicles that will need to be routed in the future are unknown then this problem is stochastic. For fleets of vehicles serving scheduled operations, switching to alternative-fuels requires ensuring the schedules do not cause the vehicles to run out of fuel. This is especially problematic since the locations where the vehicles may refuel are limited due to the technology being new. This dissertation covers three related optimization problems: routing a single electric or alternative-fuel vehicle on a long distance trip, routing many electric vehicles in a network where the stations have limited capacity and the arrivals into the system are stochastic, and scheduling fleets of electric or alternative-fuel vehicles with limited locations to refuel. Different algorithms are proposed to solve each of the three problems, of which some are exact and some are heuristic. The algorithms are tested on both random data and data relating to the State of Arizona.
ContributorsAdler, Jonathan D (Author) / Mirchandani, Pitu B. (Thesis advisor) / Askin, Ronald (Committee member) / Gel, Esma (Committee member) / Xue, Guoliang (Committee member) / Zhang, Muhong (Committee member) / Arizona State University (Publisher)
Created2014
147516-Thumbnail Image.png
Description

Lithium ion batteries are quintessential components of modern life. They are used to power smart devices — phones, tablets, laptops, and are rapidly becoming major elements in the automotive industry. Demand projections for lithium are skyrocketing with production struggling to keep up pace. This drive is due mostly to the

Lithium ion batteries are quintessential components of modern life. They are used to power smart devices — phones, tablets, laptops, and are rapidly becoming major elements in the automotive industry. Demand projections for lithium are skyrocketing with production struggling to keep up pace. This drive is due mostly to the rapid adoption of electric vehicles; sales of electric vehicles in 2020 are more than double what they were only a year prior. With such staggering growth it is important to understand how lithium is sourced and what that means for the environment. Will production even be capable of meeting the demand as more industries make use of this valuable element? How will the environmental impact of lithium affect growth? This thesis attempts to answer these questions as the world looks to a decade of rapid growth for lithium ion batteries.

ContributorsMelton, John (Author) / Brian, Jennifer (Thesis director) / Karwat, Darshawn (Committee member) / Chemical Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
158263-Thumbnail Image.png
Description
Due to environmental and geopolitical reasons, many countries are embracing electric vehicles (EVs) as an alternative to gasoline powered automobiles. Other alternative-fuel vehicles (AFVs) powered by compressed gas, hydrogen or biodiesel have also been tested for replacing gasoline powered vehicles. However, since the associated refueling infrastructure of AFVs is sparse

Due to environmental and geopolitical reasons, many countries are embracing electric vehicles (EVs) as an alternative to gasoline powered automobiles. Other alternative-fuel vehicles (AFVs) powered by compressed gas, hydrogen or biodiesel have also been tested for replacing gasoline powered vehicles. However, since the associated refueling infrastructure of AFVs is sparse and is gradually being built, the distance between recharging points (RPs) becomes a crucial prohibitive attribute in attracting drivers to use such vehicles. Optimally locating RPs will both increase demand and help in developing the refueling infrastructure.

The major emphasis in this dissertation is the development of theories and associated algorithms for a new set of location problems defined on continuous network space related to siting multiple RPs for range limited vehicles.

This dissertation covers three optimization problems: locating multiple RPs on a line network, locating multiple RPs on a comb tree network, and locating multiple RPs on a general tree network. For each of the three problems, finding the minimum number of RPs needed to refuel all Origin-Destination (O-D) flows is considered as the first objective. For this minimum number, the location objective is to locate this number of RPs to minimize weighted sum of the travelling distance for all O-D flows. Different exact algorithms are proposed to solve each of the three algorithms.

In the first part of this dissertation, the simplest case of locating RPs on a line network is addressed. Scenarios include single one-way O-D pair, multiple one-way O-D pairs, round trips, etc. A mixed integer program with linear constraints and quartic objective function is formulated. A finite dominating set (FDS) is identified, and based on the existence of FDS, the problem is formulated as a shortest path problem. In the second part, the problem is extended to comb tree networks. Finally, the problem is extended to general tree networks. The extension to a probabilistic version of the location problem is also addressed.
ContributorsSong, Yazhu (Author) / Mirchandani, Pitu B. (Thesis advisor) / Wu, Teresa (Committee member) / Sefair, Jorge A (Committee member) / Sen, Arunabha (Committee member) / Arizona State University (Publisher)
Created2020