Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
The Distributor’S Three-Dimensional Pallet-Packing Problem: A Mathematical Formulation And Heuristic Solution Approach, Brian P. Ballew
The Distributor’S Three-Dimensional Pallet-Packing Problem: A Mathematical Formulation And Heuristic Solution Approach, Brian P. Ballew
Theses and Dissertations
It is through practice and experience Air Force loadmasters are able to pack the Air Force standard HCU-6/E (463L) pallets efficiently. Although the loadmasters perform their jobs exceptionally well, the Air Force is in search of a model that will more efficiently pack the pallets. We have developed a mathematical formulation of the three-dimensional pallet-packing problem which minimizes the amount of unused space on a pallet. The formulation ensures each box is packed with the correct volume and dimensions, and ensures the volume of all the boxes packed is less than the available pallet volume. Additionally, the formulation ensures that …
Using Rsm, Doe, And Linear Regression To Develop A Metamodel To Predict Cargo Delivery Of A Time Phase Force Deployment Document, Kenneth S. Browne
Using Rsm, Doe, And Linear Regression To Develop A Metamodel To Predict Cargo Delivery Of A Time Phase Force Deployment Document, Kenneth S. Browne
Theses and Dissertations
Air Mobility Command (AMC) uses the Airlift Flow Model as their primary tool to estimate the amount of cargo delivered in a Time Phase Force Deployment Document (TPFDD). The primary objective of this research was an exploratory investigation in the development of a metamodel to predict the amount of cargo delivered from a TPFDD by AMC into a theater. In creating a valid metamodel the analyst would be able to quickly provide the decision-maker with accurate insights should input parameters change. This would save valuable time and replace the need to physically change the input parameters and re-run the simulation. …
A Greedy Multiple-Knapsack Heuristic For Solving Air Mobility Command’S Intratheater Airlift Problem, Nicholas J. Zeisler
A Greedy Multiple-Knapsack Heuristic For Solving Air Mobility Command’S Intratheater Airlift Problem, Nicholas J. Zeisler
Theses and Dissertations
This research develops a methodology using a greedy heuristic to solve Air Mobility Command's intratheater airlift scenario as a multiple knapsack problem. The objective is to maximize throughput in a theater given a vehicle mixture and assignment scheme. The model allows for a heterogeneous, user defined vehicle mix in a theater consisting of up to five bed down locations and up to seven forward operating locations. First, we preprocess routes, eliminating the large number of unattractive route choices in the problem. Then using a greedy heuristic, we select routes and assign them to aircraft located at any or all of …