Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
Articles 1 - 3 of 3
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Optimal Aircraft Maneuvering Models For Cruise Missile Engagement: A Modeling And Computational Study, Izaiah G. Laduke
Optimal Aircraft Maneuvering Models For Cruise Missile Engagement: A Modeling And Computational Study, Izaiah G. Laduke
Theses and Dissertations
Given the increased threat and proliferation of adversary military capabilities, this research seeks to develop reasonably accurate and computationally tractable models to optimally maneuver aircraft to intercept cruise missile attacks. The research leveraged mathematical programming to model the problem, informed by constraints representing a system of (temporal) difference equations. The research began by comparing six models having alternative representations of velocity and acceleration constraints while analyzing situations with stationary targets. The Multiple Aircraft, Multiple Stationary Target Engagement Problem with Box Constraint Bounds (MAMSTEP-BC) Model yielded superior overall performance and was further analyzed through alternative mathematical programming model enhancements to create …
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 …
A Case Study Of Two-Echelon Multi-Depot Vehicle Routing Problem, Tianqi Yu
A Case Study Of Two-Echelon Multi-Depot Vehicle Routing Problem, Tianqi Yu
Open Access Theses
The Vehicle Routing Problem (VRP) is a classic combinatorial optimization problem and a topic still studied for practical applications. Current research focuses on single echelon distribution systems such as distribution centers serving customers. However, in typical distribution, goods flows among regional distribution centers, local warehouses and customers, defined as a two-echelon network. The two-echelon multiple depot VRP problem is documented and applied to two stages illustrated by a small scale computational example. In the first stage, the simulated annealing algorithm is employed to determine the routes between local warehouses and final customers. For the second stage, trial-and-error is applied to …