Matching Items (997)
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
With the new independence of adulthood, college students are a group susceptible to adopting unsupported, if not harmful, health practices. A survey of Arizona State University undergraduate students (N=200) was conducted to evaluate supplement use, trust in information sources, and beliefs about supplement regulation. Of those who reported using supplements, college students most frequently received information from friends and family. STEM majors in fields unrelated to health who were taking a supplement were found to be less likely to receive information about the supplement from a medical practitioner than those in health fields or those in non-STEM majors (-26.9%, p=0.018). STEM majors in health-related fields were 15.0% more likely to treat colds and/or cold symptoms with research-supported methods identified from reliable sources, while non-health STEM and non-STEM majors were more likely to take unsupported cold treatments (p=0.010). Surveyed students, regardless of major, also stated they would trust a medical practitioner for supplement advice above other sources (88.0%), and the majority expressed a belief that dietary supplements are approved/regulated by the government (59.8%).
ContributorsPerez, Jacob Tanner (Author) / Hendrickson, Kirstin (Thesis director) / Lefler, Scott (Committee member) / College of Liberal Arts and Sciences (Contributor) / School of Molecular Sciences (Contributor) / Department of Physics (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
ContributorsChandler, N. Kayla (Author) / Neisewander, Janet (Thesis director) / Sanabria, Federico (Committee member) / Olive, M. Foster (Committee member) / Barrett, The Honors College (Contributor) / College of Liberal Arts and Sciences (Contributor)
Created2013-05
Description
I propose that norms regulate behaviors that negatively impact an individual's survival and reproduction. But because monitoring and enforcing of norms can be costly, individuals should be selective about which norms they police and under what circumstances they should do so. Two studies tested this idea by experimentally activating fitness-relevant motives and having participants answer questions about the policing of norms. The first study examined a norm prescribing respect for status and another proscribing sexual coercion. Results from Study 1 failed to support the hypotheses; activating a status-seeking motive did not have the predicted effects on policing of the respect-status norm nor did activating a mating motive have the predicted effects on policing of the respect-status norm or anti-coercion norm. Study 2 examined two new norms, one prescribing that people stay home when sick and the other proscribing people from having sex with another person's partners. Study 2 also manipulated whether self or others were the target of the policing. Study 2 failed to provide support; a disease avoidance motive failed to have effects on policing of the stay home when sick norm. Individuals in a relationship under a mating motive wanted less policing of others for violation of the mate poaching norm than those in a baseline condition, opposite of the predicted effects.
ContributorsSmith, M. Kristopher (Author) / Neuberg, L. Steven (Thesis director) / Presson, Clark (Committee member) / Hruschka, J. Daniel (Committee member) / Barrett, The Honors College (Contributor) / College of Liberal Arts and Sciences (Contributor)
Created2013-05
Description
Literature in public administration emphasizes a growing dissatisfaction with government on the part of residents. Where there tends to be a lack in the literature is in terms of solutions to this problem. We would like to argue that the engagement process itself has the power to foster a profound attitudinal shift on the part of both residents and government. This paper explores the structural and cultural barriers to satisfactory public engagement both from literature and a combination of policy analysis, semi-structured interviews and participatory observation within the City of Tempe. We then provide recommendations to the City of Tempe on how to overcome these barriers and effect authentic public engagement practices. With these new suggested practices and mindsets, we provide a way that people can have the power to create their own community.
ContributorsRiffle, Morgan (Co-author) / Tchida, Celina (Co-author) / Ingram-Waters, Mary (Thesis director) / Grzanka, Patrick (Committee member) / King, Cheryl (Committee member) / Barrett, The Honors College (Contributor) / College of Liberal Arts and Sciences (Contributor)
Created2013-05
Description
This thesis examines the relationship between unofficial, official, and parallel Islam in Uzbekistan following the end of the Soviet Union. Key touchstone moments in Uzbekistan during the twentieth-century show the history between unofficial and official Islam and the resulting precedents set for Muslims gathering against the government. This historical analysis shows how President Karimov and the Uzbek government view and approach Islam in the country following independence.
ContributorsTieslink, Evan (Author) / Batalden, Stephen (Thesis director) / Kefeli, Agnes (Committee member) / Saikia, Yasmin (Committee member) / Barrett, The Honors College (Contributor) / College of Liberal Arts and Sciences (Contributor) / School of Politics and Global Studies (Contributor) / School of Historical, Philosophical and Religious Studies (Contributor)
Created2013-05