Type of Document	Master's Thesis
Author	Ganesan, Vikram
Author's Email Address	gvikram@vt.edu
URN	etd-072499-223037
Title	A Model for Multidisciplinary Optimization for Containerships
Degree	Master of Science
Department	Aerospace and Ocean Engineering
Advisory Committee	Advisor Name Title Dr. Owen Hughes Committee Chair Dr. Wayne Neu Committee Member Dr. William Mason Committee Member
Keywords	Optimization Containerships Multidisciplinary
Date of Defense	1999-06-15
Availability	unrestricted
Abstract This thesis describes a multidisciplinary design optimization approach to containership design. The method employs widely accepted regression equations for computing resistance, weights, building costs and operating costs. The current regulations governing freeboard and the Coast Guard wind heel criterion are included. The measures of merit used are the required freight rate and the return on investment. The system is flexible enough to allow changes in trade routes, shipyard and port parameters, and fuel costs. The weight-displacement balance is maintained by including draft as a design variable and imposing an equality constraint on weight and displacement rather than introducing an internal loop to calculate draft at each iteration. This speeds up the optimization process. The process takes into account the discrete container stowage issue. The carrying capacity (number of containers) is expressed as a continuous function of the principal dimensions by using a linear response surface fit that in turn makes the objective function continuous. Speed is a design variable. The optimum speed takes into account the compromise required between higher speeds that imply higher revenue and lower speeds that imply lower fuel costs. The optimizer used is the Design Optimization Tools (DOT) program from Vanderplaats Research and Development, Inc. Results employing the three different techniques provided in DOT have been obtained and compared. The optimum ship tends to be the largest ship in terms of length and beam. An optimum speed is identified. The three techniques provided in DOT give fairly consistent results, but once a good optimum point is identified in the design space, the sequential linear programming algorithm is found to be the most consistent method to converge to a local optimum. The objective function is found to be flat in the vicinity of the optimum that indicates that the designer is not confined to a severely restricted design space and has some freedom in designing the optimum ship.
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access    Chapter1.pdf 16.99 Kb 00:00:04 00:00:02 00:00:02 00:00:01 < 00:00:01   Chapter2page9.pdf 8.72 Kb 00:00:02 00:00:01 00:00:01 < 00:00:01 < 00:00:01   Chapter2pages10thru20.pdf 40.00 Kb 00:00:11 00:00:05 00:00:05 00:00:02 < 00:00:01   Chapter2pages5thru8.pdf 16.50 Kb 00:00:04 00:00:02 00:00:02 00:00:01 < 00:00:01   Chapter3page24.pdf 7.73 Kb 00:00:02 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01   Chapter3pages21thru23.pdf 15.89 Kb 00:00:04 00:00:02 00:00:01 < 00:00:01 < 00:00:01   Chapter3pages25thru32.pdf 26.64 Kb 00:00:07 00:00:03 00:00:03 00:00:01 < 00:00:01   Chapter4.pdf 40.35 Kb 00:00:11 00:00:05 00:00:05 00:00:02 < 00:00:01   Chapter5.pdf 45.56 Kb 00:00:12 00:00:06 00:00:05 00:00:02 < 00:00:01   Chapter6.pdf 33.30 Kb 00:00:09 00:00:04 00:00:04 00:00:02 < 00:00:01   Chapter7.pdf 31.38 Kb 00:00:08 00:00:04 00:00:03 00:00:01 < 00:00:01   Chapter8.pdf 20.73 Kb 00:00:05 00:00:02 00:00:02 00:00:01 < 00:00:01   Chapter9.pdf 9.35 Kb 00:00:02 00:00:01 00:00:01 < 00:00:01 < 00:00:01   Contents.pdf 5.81 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01   ListofFigures.pdf 5.79 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01   ListofSymbols.pdf 13.22 Kb 00:00:03 00:00:01 00:00:01 < 00:00:01 < 00:00:01   ListofTables.pdf 5.82 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01   References.pdf 10.85 Kb 00:00:03 00:00:01 00:00:01 < 00:00:01 < 00:00:01   TitleAbstractAcknowledgements.pdf 9.96 Kb 00:00:02 00:00:01 00:00:01 < 00:00:01 < 00:00:01   vita.pdf 4.18 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01

If you have questions or technical problems, please Contact DLA.