Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Analysis Of Shanghai Aviation Hub Logistics Competitiveness, Tuo Chen
Analysis Of Shanghai Aviation Hub Logistics Competitiveness, Tuo Chen
World Maritime University Dissertations
No abstract provided.
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, …
Fundamental Tradeoffs In Estimation Of Finite-State Hidden Markov Models, Justin Le
Fundamental Tradeoffs In Estimation Of Finite-State Hidden Markov Models, Justin Le
UNLV Theses, Dissertations, Professional Papers, and Capstones
Hidden Markov models (HMMs) constitute a broad and flexible class of statistical models that are widely used in studying processes that evolve over time and are only observable through the collection of noisy data. Two problems are essential to the use of HMMs: state estimation and parameter estimation. In state estimation, an algorithm estimates the sequence of states of the process that most likely generated a certain sequence of observations in the data. In parameter estimation, an algorithm computes the probability distributions that govern the time-evolution of states and the sampling of data. Although algorithms for the two problems are …
Evaluating Flexibility Metrics On Simple Temporal Networks With Reinforcement Learning, Hamzah I. Khan
Evaluating Flexibility Metrics On Simple Temporal Networks With Reinforcement Learning, Hamzah I. Khan
HMC Senior Theses
Simple Temporal Networks (STNs) were introduced by Tsamardinos (2002) as a means of describing graphically the temporal constraints for scheduling problems. Since then, many variations on the concept have been used to develop and analyze algorithms for multi-agent robotic scheduling problems. Many of these algorithms for STNs utilize a flexibility metric, which measures the slack remaining in an STN under execution. Various metrics have been proposed by Hunsberger (2002); Wilson et al. (2014); Lloyd et al. (2018). This thesis explores how adequately these metrics convey the desired information by using them to build a reward function in a reinforcement learning …
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 …