{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/92104"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/92104","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Design of tool for the optimization of deck area assignments with integration into existing naval ship design programs","abstract":"Many 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.","abstract_html":"Many 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.","abstract_has_math":false,"creators":["Oslebo, Damian G"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Chryssostomos Chryssostomidis and Fredo Durand."],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-07-22T22:21:44Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/92104","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Chryssostomos Chryssostomidis and Fredo Durand."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Oslebo, Damian G"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-12-08T18:49:13Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-12-08T18:49:13Z"]},{"key":"dc:date.issued","label":"Date","values":["2014"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/92104"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.","Cataloged from PDF version of thesis.","Includes bibliographical references (page 55)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Many 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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Design of tool for the optimization of deck area assignments with integration into existing naval ship design programs"]}]}],"canonical_facts":{"dc:contributor.advisor":["Chryssostomos Chryssostomidis and Fredo Durand."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Oslebo, Damian G"],"dc:date.accessioned":["2014-12-08T18:49:13Z"],"dc:date.available":["2014-12-08T18:49:13Z"],"dc:date.issued":["2014"],"dc:description":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.","Cataloged from PDF version of thesis.","Includes bibliographical references (page 55)."],"dc:description.abstract":["Many 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."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/92104"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Design of tool for the optimization of deck area assignments with integration into existing naval ship design programs"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:44Z"}