Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Efficient Numerical Optimization For Parallel Dynamic Optimal Power Flow Simulation Using Network Geometry, Rylee Sundermann
Efficient Numerical Optimization For Parallel Dynamic Optimal Power Flow Simulation Using Network Geometry, Rylee Sundermann
Electronic Theses and Dissertations
In this work, we present a parallel method for accelerating the multi-period dynamic optimal power flow (DOPF). Our approach involves a distributed-memory parallelization of DOPF time-steps, use of a newly developed parallel primal-dual interior point method, and an iterative Krylov subspace linear solver with a block-Jacobi preconditioning scheme. The parallel primal-dual interior point method has been implemented and distributed in the open-source PETSc library and is currently available. We present the formulation of the DOPF problem, the developed primal dual interior point method solver, the parallel implementation, and results on various multi-core machines. We demonstrate the effectiveness our proposed block-Jacobi …
High-Density Parking For Autonomous Vehicles., Parag J. Siddique
High-Density Parking For Autonomous Vehicles., Parag J. Siddique
Electronic Theses and Dissertations
In a common parking lot, much of the space is devoted to lanes. Lanes must not be blocked for one simple reason: a blocked car might need to leave before the car that blocks it. However, the advent of autonomous vehicles gives us an opportunity to overcome this constraint, and to achieve a higher storage capacity of cars. Taking advantage of self-parking and intelligent communication systems of autonomous vehicles, we propose puzzle-based parking, a high-density design for a parking lot. We introduce a novel method of vehicle parking, which leads to maximum parking density. We then propose a heuristic method …
Developing Optimization Techniques For Logistical Tendering Using Reverse Combinatorial Auctions, Jennifer Kiser
Developing Optimization Techniques For Logistical Tendering Using Reverse Combinatorial Auctions, Jennifer Kiser
Electronic Theses and Dissertations
In business-to-business logistical sourcing events, companies regularly use a bidding process known as tendering in the procurement of transportation services from third-party providers. Usually in the form of an auction involving a single buyer and one or more sellers, the buyer must make decisions regarding with which suppliers to partner and how to distribute the transportation lanes and volume among its suppliers; this is equivalent to solving the optimization problem commonly referred to as the Winner Determination Problem. In order to take into account the complexities inherent to the procurement problem, such as considering a supplier’s network, economies of scope, …
Location Optimization Of A Coal Power Plant To Balance Coal Supply And Electric Transmission Costs Against Plant’S Emission Exposure, Najam Khan
Electronic Theses and Dissertations
This research is focused on developing a location analysis methodology that can minimize the pollutant exposure to the public while ensuring that the combined costs of electric transmission losses and coal logistics are minimized. Coal power plants will provide a critical contribution towards meeting electricity demands for various nations in the foreseeable future. The site selection for a new coal power plant is extremely important from an investment point of view. The operational costs for running a coal power plant can be minimized by a combined emphasis on placing a coal power plant near coal mines as well as customers. …
Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher
Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher
Electronic Theses and Dissertations
Through-out military history, the need to safely and effectively allocate resources to various military operations was a task of extreme importance. Satisfying the needs of multiple consumers by optimally pairing with appropriate suppliers falls into the category of vehicle routing problems (VRP), which has been intensively studied over the years. In general, finding the optimal solution to VRP is known to be NP-hard. The proposed solutions rely on mathematical programming and the size of the problems that can be optimally solved is typically limited. In military settings, balancing the needs of multiple consumers with the current operational environment has always …