國立虎尾科技大學 |

Overlap Packing Optimization for Spacecraft Layout Design.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Overlap Packing Optimization for Spacecraft Layout Design./
Author:	Alaimo, Richard Arthur.
Description:	1 online resource (92 pages)
Notes:	Source: Masters Abstracts International, Volume: 57-06.
Contained By:	Masters Abstracts International57-06(E).
Subject:	Operations research. -
Online resource:	click for full text (PQDT)
ISBN:	9780438010604

Overlap Packing Optimization for Spacecraft Layout Design.
Alaimo, Richard Arthur.

Overlap Packing Optimization for Spacecraft Layout Design. - 1 online resource (92 pages)

Source: Masters Abstracts International, Volume: 57-06.

Thesis (M.S.)--The University of North Carolina at Charlotte, 2018.

Includes bibliographical references

Packing optimization is a common problem that is encountered on a day-to-day basis and has led to an extensive study over the years. One variant of the packing problem that is beginning to emerge is the overlap cuboid packing problem (OCPP), which allows for items that need to be packed to share space in order to further minimize the dimensions of the container. The objective of this study is to investigate a mathematical model, specifically a mixed-integer linear program (MILP), that can effectively provide an overlap packing solution in the context of designing the layout for a spacecraft module. For this particular layout design problem, the items that need to be packed are represented as task volumes, known as gradient cuboids, where astronauts perform various tasks and the container is the spacecraft module. A bi-objective function was proposed to allow the dimensions of the module to be minimized, as well as enforcing specific adjacency requirements that might exist between gradient cuboids.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780438010604Subjects--Topical Terms:

573517
Operations research.
Index Terms--Genre/Form:

554714
Electronic books.

Overlap Packing Optimization for Spacecraft Layout Design.
LDR:04336ntm a2200373Ki 4500 001 919036
005 20181106103646.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438010604
035 $a (MiAaPQ)AAI10814574
035 $a (MiAaPQ)uncc:11736
035 $a AAI10814574
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Alaimo, Richard Arthur. $3 1193512
245 1 0 $a Overlap Packing Optimization for Spacecraft Layout Design.
264 0 $c 2018
300 $a 1 online resource (92 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 57-06.
500 $a Adviser: Churlzu Lim.
502 $a Thesis (M.S.)--The University of North Carolina at Charlotte, 2018.
504 $a Includes bibliographical references
520 $a Packing optimization is a common problem that is encountered on a day-to-day basis and has led to an extensive study over the years. One variant of the packing problem that is beginning to emerge is the overlap cuboid packing problem (OCPP), which allows for items that need to be packed to share space in order to further minimize the dimensions of the container. The objective of this study is to investigate a mathematical model, specifically a mixed-integer linear program (MILP), that can effectively provide an overlap packing solution in the context of designing the layout for a spacecraft module. For this particular layout design problem, the items that need to be packed are represented as task volumes, known as gradient cuboids, where astronauts perform various tasks and the container is the spacecraft module. A bi-objective function was proposed to allow the dimensions of the module to be minimized, as well as enforcing specific adjacency requirements that might exist between gradient cuboids.
520 $a Following the formulation of the model, the efficacy of the model is evaluated on test problems that consist of 20 randomly generated small-scale instances with seven cuboids and one full-scale instance with 24 cuboids. In this numerical study, each of the test instances were solved under 10 different design scenarios, which varied depending on the enforced vertical overlap and restrictions on the dimensions of the container. To obtain solutions of the MILPs, a commercial solver, Gurobi, was called from Matlab. The visualization of results demonstrates how the proposed model effectively generates layout designs. We also observed how the proposed model can accommodate prioritization between two criteria: size of the container and enforcement of adjacency requirements.
520 $a Noting that OCPP is a generalization of the NP-hard packing problem, it is unlikely to efficiently find an optimal solution as the problem size increases. It consumed 81.02 seconds on average to solve small-scale instances. However, the solution of the full-scale problem had to be terminated after a 4-hour run, when the optimality gap was 62.53% on average for 10 layout designs. Observing the large optimality gap, we turned our attention to further enhance the model to help reduce the computational burden when finding a solution. As a result, seven additional sets of constraints were proposed.
520 $a An additional numerical study was performed where each constraint was added to the base model individually using the test problem in order to determine which constraints provide the most benefit to solving the model across a set of scenarios. Following this, combinations of constraints were created for different layout designs on the randomly generated problems to determine if further improvement was possible. It was observed that there was an average improvement of 65.12% in solution time when applied to small-scale instances. These combinations were applied to the full-scale problem, where it was observed that there was an average improvement of 14.92% in optimality gap after 4-hours.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Operations research. $3 573517
650 4 $a Industrial engineering. $3 679492
655 7 $a Electronic books. $2 local $3 554714
690 $a 0796
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a The University of North Carolina at Charlotte. $b Engineering Management. $3 1193513
773 0 $t Masters Abstracts International $g 57-06(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10814574 $z click for full text (PQDT)