Matching Items (1,606)
Filtering by
- Creators: School of Life Sciences
Description
Project portfolio selection (PPS) is a significant problem faced by most organizations. How to best select the many innovative ideas that a company has developed to deploy in a proper and sustained manner with a balanced allocation of its resources over multiple time periods is one of vital importance to a company's goals. This dissertation details the steps involved in deploying a more intuitive portfolio selection framework that facilitates bringing analysts and management to a consensus on ongoing company efforts and buy into final decisions. A binary integer programming selection model that constructs an efficient frontier allows the evaluation of portfolios on many different criteria and allows decision makers (DM) to bring their experience and insight to the table when making a decision is discussed. A binary fractional integer program provides additional choices by optimizing portfolios on cost-benefit ratios over multiple time periods is also presented. By combining this framework with an `elimination by aspects' model of decision making, DMs evaluate portfolios on various objectives and ensure the selection of a portfolio most in line with their goals. By presenting a modeling framework to easily model a large number of project inter-dependencies and an evolutionary algorithm that is intelligently guided in the search for attractive portfolios by a beam search heuristic, practitioners are given a ready recipe to solve big problem instances to generate attractive project portfolios for their organizations. Finally, this dissertation attempts to address the problem of risk and uncertainty in project portfolio selection. After exploring the selection of portfolios based on trade-offs between a primary benefit and a primary cost, the third important dimension of uncertainty of outcome and the risk a decision maker is willing to take on in their quest to select the best portfolio for their organization is examined.
ContributorsSampath, Siddhartha (Author) / Gel, Esma (Thesis advisor) / Fowler, Jown W (Thesis advisor) / Kempf, Karl G. (Committee member) / Pan, Rong (Committee member) / Sefair, Jorge (Committee member) / Arizona State University (Publisher)
Created2018
Description
This research develops heuristics to manage both mandatory and optional network capacity reductions to better serve the network flows. The main application discussed relates to transportation networks, and flow cost relates to travel cost of users of the network. Temporary mandatory capacity reductions are required by maintenance activities. The objective of managing maintenance activities and the attendant temporary network capacity reductions is to schedule the required segment closures so that all maintenance work can be completed on time, and the total flow cost over the maintenance period is minimized for different types of flows. The goal of optional network capacity reduction is to selectively reduce the capacity of some links to improve the overall efficiency of user-optimized flows, where each traveler takes the route that minimizes the traveler’s trip cost. In this dissertation, both managing mandatory and optional network capacity reductions are addressed with the consideration of network-wide flow diversions due to changed link capacities.
This research first investigates the maintenance scheduling in transportation networks with service vehicles (e.g., truck fleets and passenger transport fleets), where these vehicles are assumed to take the system-optimized routes that minimize the total travel cost of the fleet. This problem is solved with the randomized fixed-and-optimize heuristic developed. This research also investigates the maintenance scheduling in networks with multi-modal traffic that consists of (1) regular human-driven cars with user-optimized routing and (2) self-driving vehicles with system-optimized routing. An iterative mixed flow assignment algorithm is developed to obtain the multi-modal traffic assignment resulting from a maintenance schedule. The genetic algorithm with multi-point crossover is applied to obtain a good schedule.
Based on the Braess’ paradox that removing some links may alleviate the congestion of user-optimized flows, this research generalizes the Braess’ paradox to reduce the capacity of selected links to improve the efficiency of the resultant user-optimized flows. A heuristic is developed to identify links to reduce capacity, and the corresponding capacity reduction amounts, to get more efficient total flows. Experiments on real networks demonstrate the generalized Braess’ paradox exists in reality, and the heuristic developed solves real-world test cases even when commercial solvers fail.
This research first investigates the maintenance scheduling in transportation networks with service vehicles (e.g., truck fleets and passenger transport fleets), where these vehicles are assumed to take the system-optimized routes that minimize the total travel cost of the fleet. This problem is solved with the randomized fixed-and-optimize heuristic developed. This research also investigates the maintenance scheduling in networks with multi-modal traffic that consists of (1) regular human-driven cars with user-optimized routing and (2) self-driving vehicles with system-optimized routing. An iterative mixed flow assignment algorithm is developed to obtain the multi-modal traffic assignment resulting from a maintenance schedule. The genetic algorithm with multi-point crossover is applied to obtain a good schedule.
Based on the Braess’ paradox that removing some links may alleviate the congestion of user-optimized flows, this research generalizes the Braess’ paradox to reduce the capacity of selected links to improve the efficiency of the resultant user-optimized flows. A heuristic is developed to identify links to reduce capacity, and the corresponding capacity reduction amounts, to get more efficient total flows. Experiments on real networks demonstrate the generalized Braess’ paradox exists in reality, and the heuristic developed solves real-world test cases even when commercial solvers fail.
ContributorsPeng, Dening (Author) / Mirchandani, Pitu B. (Thesis advisor) / Sefair, Jorge (Committee member) / Wu, Teresa (Committee member) / Zhou, Xuesong (Committee member) / Arizona State University (Publisher)
Created2017
Description
Researchers and practitioners have widely studied road network traffic data in different areas such as urban planning, traffic prediction and spatial-temporal databases. For instance, researchers use such data to evaluate the impact of road network changes. Unfortunately, collecting large-scale high-quality urban traffic data requires tremendous efforts because participating vehicles must install Global Positioning System(GPS) receivers and administrators must continuously monitor these devices. There have been some urban traffic simulators trying to generate such data with different features. However, they suffer from two critical issues (1) Scalability: most of them only offer single-machine solution which is not adequate to produce large-scale data. Some simulators can generate traffic in parallel but do not well balance the load among machines in a cluster. (2) Granularity: many simulators do not consider microscopic traffic situations including traffic lights, lane changing, car following. This paper proposed GeoSparkSim, a scalable traffic simulator which extends Apache Spark to generate large-scale road network traffic datasets with microscopic traffic simulation. The proposed system seamlessly integrates with a Spark-based spatial data management system, GeoSpark, to deliver a holistic approach that allows data scientists to simulate, analyze and visualize large-scale urban traffic data. To implement microscopic traffic models, GeoSparkSim employs a simulation-aware vehicle partitioning method to partition vehicles among different machines such that each machine has a balanced workload. The experimental analysis shows that GeoSparkSim can simulate the movements of 200 thousand cars over an extensive road network (250 thousand road junctions and 300 thousand road segments).
ContributorsFu, Zishan (Author) / Sarwat, Mohamed (Thesis advisor) / Pedrielli, Giulia (Committee member) / Sefair, Jorge (Committee member) / Arizona State University (Publisher)
Created2019
Description
The shift in focus of manufacturing systems to high-mix and low-volume production poses a challenge to both efficient scheduling of manufacturing operations and effective assessment of production capacity. This thesis considers the problem of scheduling a set of jobs that require machine and worker resources to complete their manufacturing operations. Although planners in manufacturing contexts typically focus solely on machines, schedules that only consider machining requirements may be problematic during implementation because machines need skilled workers and cannot run unsupervised. The model used in this research will be beneficial to these environments as planners would be able to determine more realistic assignments and operation sequences to minimize the total time required to complete all jobs. This thesis presents a mathematical formulation for concurrent scheduling of machines and workers that can optimally schedule a set of jobs while accounting for changeover times between operations. The mathematical formulation is based on disjunctive constraints that capture the conflict between operations when trying to schedule them to be performed by the same machine or worker. An additional formulation extends the previous one to consider how cross-training may impact the production capacity and, for a given budget, provide training recommendations for specific workers and operations to reduce the makespan. If training a worker is advantageous to increase production capacity, the model recommends the best time window to complete it such that overlaps with work assignments are avoided. It is assumed that workers can perform tasks involving the recently acquired skills as soon as training is complete. As an alternative to the mixed-integer programming formulations, this thesis provides a math-heuristic approach that fixes the order of some operations based on Largest Processing Time (LPT) and Shortest Processing Time (SPT) procedures, while allowing the exact formulation to find the optimal schedule for the remaining operations. Computational experiments include the use of the solution for the no-training problem as a starting feasible solution to the training problem. Although the models provided are general, the manufacturing of Printed Circuit Boards are used as a case study.
ContributorsAdams, Katherine Bahia (Author) / Sefair, Jorge (Thesis advisor) / Askin, Ronald (Thesis advisor) / Webster, Scott (Committee member) / Arizona State University (Publisher)
Created2019
Description
I study the problem of locating Relay nodes (RN) to improve the connectivity of a set
of already deployed sensor nodes (SN) in a Wireless Sensor Network (WSN). This is
known as the Relay Node Placement Problem (RNPP). In this problem, one or more
nodes called Base Stations (BS) serve as the collection point of all the information
captured by SNs. SNs have limited transmission range and hence signals are transmitted
from the SNs to the BS through multi-hop routing. As a result, the WSN
is said to be connected if there exists a path for from each SN to the BS through
which signals can be hopped. The communication range of each node is modeled
with a disk of known radius such that two nodes are said to communicate if their
communication disks overlap. The goal is to locate a given number of RNs anywhere
in the continuous space of the WSN to maximize the number of SNs connected (i.e.,
maximize the network connectivity). To solve this problem, I propose an integer
programming based approach that iteratively approximates the Euclidean distance
needed to enforce sensor communication. This is achieved through a cutting-plane
approach with a polynomial-time separation algorithm that identies distance violations.
I illustrate the use of my algorithm on large-scale instances of up to 75 nodes
which can be solved in less than 60 minutes. The proposed method shows solutions
times many times faster than an alternative nonlinear formulation.
of already deployed sensor nodes (SN) in a Wireless Sensor Network (WSN). This is
known as the Relay Node Placement Problem (RNPP). In this problem, one or more
nodes called Base Stations (BS) serve as the collection point of all the information
captured by SNs. SNs have limited transmission range and hence signals are transmitted
from the SNs to the BS through multi-hop routing. As a result, the WSN
is said to be connected if there exists a path for from each SN to the BS through
which signals can be hopped. The communication range of each node is modeled
with a disk of known radius such that two nodes are said to communicate if their
communication disks overlap. The goal is to locate a given number of RNs anywhere
in the continuous space of the WSN to maximize the number of SNs connected (i.e.,
maximize the network connectivity). To solve this problem, I propose an integer
programming based approach that iteratively approximates the Euclidean distance
needed to enforce sensor communication. This is achieved through a cutting-plane
approach with a polynomial-time separation algorithm that identies distance violations.
I illustrate the use of my algorithm on large-scale instances of up to 75 nodes
which can be solved in less than 60 minutes. The proposed method shows solutions
times many times faster than an alternative nonlinear formulation.
ContributorsSurendran, Vishal Sairam Jaitra (Author) / Sefair, Jorge (Thesis advisor) / Mirchandani, Pitu (Committee member) / Grubesic, Anthony (Committee member) / Arizona State University (Publisher)
Created2019
Description
The inherent risk in testing drugs has been hotly debated since the government first started regulating the drug industry in the early 1900s. Who can assume the risks associated with trying new pharmaceuticals is unclear when looked at through society's lens. In the mid twentieth century, the US Food and Drug Administration (FDA) published several guidance documents encouraging researchers to exclude women from early clinical drug research. The motivation to publish those documents and the subsequent guidance documents in which the FDA and other regulatory offices established their standpoints on women in drug research may have been connected to current events at the time. The problem of whether women should be involved in drug research is a question of who can assume risk and who is responsible for disseminating what specific kinds of information. The problem tends to be framed as one that juxtaposes the health of women and fetuses and sets their health as in opposition. That opposition, coupled with the inherent uncertainty in testing drugs, provides for a complex set of issues surrounding consent and access to information.
ContributorsMeek, Caroline Jane (Author) / Maienschein, Jane (Thesis director) / Brian, Jennifer (Committee member) / School of Life Sciences (Contributor) / Sanford School of Social and Family Dynamics (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
Social-emotional learning (SEL) methods are beginning to receive global attention in primary school education, yet the dominant emphasis on implementing these curricula is in high-income, urbanized areas. Consequently, the unique features of developing and integrating such methods in middle- or low-income rural areas are unclear. Past studies suggest that students exposed to SEL programs show an increase in academic performance, improved ability to cope with stress, and better attitudes about themselves, others, and school, but these curricula are designed with an urban focus. The purpose of this study was to conduct a needs-based analysis to investigate components specific to a SEL curriculum contextualized to rural primary schools. A promising organization committed to rural educational development is Barefoot College, located in Tilonia, Rajasthan, India. In partnership with Barefoot, we designed an ethnographic study to identify and describe what teachers and school leaders consider the highest needs related to their students' social and emotional education. To do so, we interviewed 14 teachers and school leaders individually or in a focus group to explore their present understanding of “social-emotional learning” and the perception of their students’ social and emotional intelligence. Analysis of this data uncovered common themes among classroom behaviors and prevalent opportunities to address social and emotional well-being among students. These themes translated into the three overarching topics and eight sub-topics explored throughout the curriculum, and these opportunities guided the creation of the 21 modules within it. Through a design-based research methodology, we developed a 40-hour curriculum by implementing its various modules within seven Barefoot classrooms alongside continuous reiteration based on teacher feedback and participant observation. Through this process, we found that student engagement increased during contextualized SEL lessons as opposed to traditional methods. In addition, we found that teachers and students preferred and performed better with an activities-based approach. These findings suggest that rural educators must employ particular teaching strategies when addressing SEL, including localized content and an experiential-learning approach. Teachers reported that as their approach to SEL shifted, they began to unlock the potential to build self-aware, globally-minded students. This study concludes that social and emotional education cannot be treated in a generalized manner, as curriculum development is central to the teaching-learning process.
ContributorsBucker, Delaney Sue (Author) / Carrese, Susan (Thesis director) / Barab, Sasha (Committee member) / School of Life Sciences (Contributor, Contributor) / School of Civic & Economic Thought and Leadership (Contributor) / School of International Letters and Cultures (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
Description
As of 2019, 30 US states have adopted abortion-specific informed consent laws that require state health departments to develop and disseminate written informational materials to patients seeking an abortion. Abortion is the only medical procedure for which states dictate the content of informed consent counseling. State abortion counseling materials have been criticized for containing inaccurate and misleading information, but overall, informed consent laws for abortion do not often receive national attention. The objective of this project was to determine the importance of informed consent laws to achieving the larger goal of dismantling the right to abortion. I found that informed consent counseling materials in most states contain a full timeline of fetal development, along with information about the risks of abortion, the risks of childbirth, and alternatives to abortion. In addition, informed consent laws for abortion are based on model legislation called the “Women’s Right to Know Act” developed by Americans United for Life (AUL). AUL calls itself the legal architect of the pro-life movement and works to pass laws at the state level that incrementally restrict abortion access so that it gradually becomes more difficult to exercise the right to abortion established by Roe v. Wade. The “Women’s Right to Know Act” is part of a larger package of model legislation called the “Women’s Protection Project,” a cluster of laws that place restrictions on abortion providers, purportedly to protect women, but actually to decrease abortion access. “Women’s Right to Know” counseling laws do not directly deny access to abortion, but they do reinforce key ideas important to the anti-abortion movement, like the concept of fetal personhood, distrust in medical professionals, the belief that pregnant people cannot be fully autonomous individuals, and the belief that abortion is not an ordinary medical procedure and requires special government oversight. “Women’s Right to Know” laws use the language of informed consent and the purported goal of protecting women to legitimize those ideas, and in doing so, they significantly undermine the right to abortion. The threat to abortion rights posed by laws like the “Women’s Right to Know” laws indicates the need to reevaluate and strengthen our ethical defense of the right to abortion.
ContributorsVenkatraman, Richa (Author) / Maienschein, Jane (Thesis director) / Brian, Jennifer (Thesis director) / Abboud, Carolina (Committee member) / Historical, Philosophical & Religious Studies (Contributor) / School of Life Sciences (Contributor, Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
Description
Turbidity is a known problem for UV water treatment systems as suspended particles can shield contaminants from the UV radiation. UV systems that utilize a reflective radiation chamber may be able to decrease the impact of turbidity on the efficacy of the system. The purpose of this study was to determine how kaolin clay and gram flour turbidity affects inactivation of Escherichia coli (E. coli) when using a UV system with a reflective chamber. Both sources of turbidity were shown to reduce the inactivation of E. coli with increasing concentrations. Overall, it was shown that increasing kaolin clay turbidity had a consistent effect on reducing UV inactivation across UV doses. Log inactivation was reduced by 1.48 log for the low UV dose and it was reduced by at least 1.31 log for the low UV dose. Gram flour had a similar effect to the clay at the lower UV dose, reducing log inactivation by 1.58 log. At the high UV dose, there was no change in UV inactivation with an increase in turbidity. In conclusion, turbidity has a significant impact on the efficacy of UV disinfection. Therefore, removing turbidity from water is an essential process to enhance UV efficiency for the disinfection of microbial pathogens.
ContributorsMalladi, Rohith (Author) / Abbaszadegan, Morteza (Thesis director) / Alum, Absar (Committee member) / Fox, Peter (Committee member) / School of Human Evolution & Social Change (Contributor) / School of Life Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
Description
Aquatic macroinvertebrates are important for many ecological processes within river ecosystems and, as a result, their abundance and diversity are considered indicators of water quality and ecosystem health. Macroinvertebrates can be classified into functional feeding groups (FFG) based on morphological-behavioral adaptations. FFG ratios can shift due to changes in normal disturbance patterns, such as changes in precipitation, and from human impact. Due to their increased sensitivity to environmental changes, it has become more important to protect and monitor aquatic and riparian communities in arid regions as climate change continues to intensify. Therefore, the diversity and richness of macroinvertebrate FFGs before and after monsoon and winter storm seasons were analyzed to determine the effect of flow-related disturbances. Ecosystem size was also considered, as watershed area has been shown to affect macroinvertebrate diversity. There was no strong support for flow-related disturbance or ecosystem size on macroinvertebrate diversity and richness. This may indicate a need to explore other parameters of macroinvertebrate community assembly. Establishing how disturbance affects aquatic macroinvertebrate communities will provide a key understanding as to what the stream communities will look like in the future, as anthropogenic impacts continue to affect more vulnerable ecosystems.
ContributorsSainz, Ruby (Author) / Sabo, John (Thesis director) / Grimm, Nancy (Committee member) / Lupoli, Christina (Committee member) / School of Life Sciences (Contributor, Contributor) / Barrett, The Honors College (Contributor)
Created2020-05