The MIT Libraries is completing a major upgrade to DSpace@MIT. Starting May 5 2026, DSpace will remain functional, viewable, searchable, and downloadable, however, you will not be able to edit existing collections or add new material. We are aiming to have full functionality restored by May 18, 2026, but intermittent service interruptions may occur. Please email dspace-lib@mit.edu with any questions. Thank you for your patience as we implement this important upgrade.

Show simple item record

dc.contributor.advisorChryssostomos Chryssostomidis and Fredo Durand.en_US
dc.contributor.authorOslebo, Damian Gen_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2014-12-08T18:49:13Z
dc.date.available2014-12-08T18:49:13Z
dc.date.copyright2014en_US
dc.date.issued2014en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/92104
dc.descriptionThesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (page 55).en_US
dc.description.abstractMany tasks in the early stages of ship design are manual and repetitive processes. One such task is in the realm of deck area arrangements. The allocation and assignment of areas in early stage ship design involves tracking the difference of total ship area envelope and all required areas to be placed for habitability, mission support, and propulsion capability among many. The problem becomes more complex with the addition of constraints involving required separation zones between other areas, affinities for certain areas or deck levels, and compartment subdivision. The Leading Edge Architecture for Prototyping Systems (LEAPS) database structure output from the Advanced Ship and Submarine Evaluation Tool (ASSET) provides a ship envelope and a list of areas requiring assignment. However, with over a hundred different area categories to place in a subdivided ship hull of a large number of compartments each with their own preferences and constraints, this problem is categorized as Nondeterministic Polynomial-time hard (NP-hard). A complete solution to an NP-hard problem cannot be found in polynomial time, meaning that finding the optimal solution in the design space is not realistically feasible as the problem scales upwards in size. Fortunately this type of problem, known as Bin Packing, is well understood in computer science. Metaheuristic methods of obtaining near-optimal solutions in a finite timeframe exist that are reasonable enough for use. This thesis presents a ship design tool that pairs two of these meta-heuristic methods with naval ship architecture and LEAPS based projects. The approach is divided into three major steps: a ship volume balance, a ship area balance, and an area layout of the ship footprint. The output of the tool is the general arrangements drawings in a universal CAD format that would be the starting point for more detailed arrangements.en_US
dc.description.statementofresponsibilityby Damian G. Oslebo.en_US
dc.format.extent87, 6 unnumbered pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleDesign of tool for the optimization of deck area assignments with integration into existing naval ship design programsen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc895839307en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record