• International Journal of Naval Architecture and Ocean Engineering
• /
• v.2 no.2
• /
• pp.96-103
• /
• 2010

A concept of preliminary design for mid-size superyachts is explored. First, the profile of a superyacht is interactively designed with the help of freeform curve functionality and graphical user interface (GUI) based interaction. The hull form is then constructed using major characteristic curves such as design waterline, deck sideline, and sections in addition to the predefined profile curve. After exterior hull modeling is done, the arrangement of significant interior spaces of all decks is carried out. A genetic algorithm is exploited to find a space arrangement by considering space fitness values, space proximity, and stairs connectivity of relevant spaces. A goal of the paper is to offer a step-by-step procedure for superyacht design from scratch or when initial information is not sufficient for complete design. For this purpose, a GUI based superyacht design system is developed. This design approach is expected to help users interactively design mid-size superyachts.

• Journal of Ocean Engineering and Technology
• /
• v.30 no.1
• /
• pp.10-17
• /
• 2016

This paper reports a simulation-based design method for the optimized arrangement design of buoyancy modules in a marine riser system. A buoyancy module is used for the safe operation and structural stability of the riser. Engineers design buoyancy modules based on experience and experimental data. However, they are difficult to design because of the difficulty of conducting real sea experiments and quantifying the data. Therefore, a simulation-based design method is needed to tackle this problem. In this study, we developed a simulation-based design algorithm using a multi-body dynamic simulation and genetic algorithm to perform optimization arrangement design of a buoyancy module. The design results are discussed in this paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.286-289
• /
• 2001

This paper deals with the procedures of effective mid-term Operation Planning establishment for painting shop in shipbuilding. and develop prototype system. In general, the block painting process consists of two stages such as blasting operation for surface preparation and painting operation for paint application for blocks. Weather condition is a potent Influence on those operations. The procedures consists of four steps, Load analysis, Generate alternative simulation plan. Implementation of Allocation automation module and Compare result of each simulation plan. Explain of each step. as follows, 1.step, Load analysis measure amount of assigned workload and manhour. 2.step, simulation scheme include alterable control variable such as overtime, weather. Auto allocating module carry out feasibility of simulation plan. 3.step, Allocation automation module are composed of three algorithms, as followings: - the block allocation algorithm that determines the number of blocks to be processed each day, - the team allocation algorithm that allocates blocks to worker groups. - the block arrangement algorithm that arrange blocks in blasting and painting cells. Since the block arrangement algorithm is conducted simultaneously with the team allocation algorithm, the total structure of the operating algorithms is considered to have two phases: first, daily load balancing with capacity limit and second, team allocation considering arrangement each day 4 step, Comparing result of each simulation plan. and select best simulation plan.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1149-1157
• /
• 2017

The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.

• Journal of Navigation and Port Research
• /
• v.27 no.4
• /
• pp.397-402
• /
• 2003

Generally, container arrangement has been carried out based on the Classification guidelines. However, guidelines provide only container securing forces for the given container arrangement and Classification requirements of the forces. In order to design container arrangement additional information is needed such as container securing forces and arrangement that accounts for lashing bridges, vertical lashing, vertical center of gravity (VCG), and maximum stack weight. Trial and error method using the existing guidelines requires excessive amount of calculation time and cannot provide accurate results of the calculations. In order to fulfill this need, a new container securing system has been established based on the equilibrium conditions that include lashing bridges and vertical lashing. An optimization algorithm has been developed for the new system since current optimization methods such as genetic algorithms and evolution strategies are unsuitable for the container securing problems, which involve equality constraint. Design variables are container weights of tier and objective function is either total container weight or VCG of a stack. The newly developed system provides optimum arrangement of containers for both maximum stack weight and maximum VCG. It also greatly reduces time for designing container arrangement.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.4
• /
• pp.262-273
• /
• 2012

We present a novel GPU algorithm to compute outer cell boundaries of 3D arrangement subdivided by a given set of triangles. An outer cell boundary is defined as a 2-manifold surface consisting of subdivided polygons facing outward. Many geometric problems, such as Minkowski sum, sweep volume, lower/upper envelop, Bool operations, can be reduced to finding outer cell boundaries with specific properties. Computing outer cell boundaries, however, is a very time-consuming job and also is susceptible to numerical errors. To address these problems, we develop an algorithm based on GPU with a robust scheme combining interval arithmetic and multi-level precisions. The proposed algorithm is tested on Minkowski sum of several polygonal models, and shows 5-20 times speedup over an existing algorithm running on CPU.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1821-1826
• /
• 2003

In this study, we discuss CIP method, which can treat compressible/incompressible problem and multi-phase problem. We can apply this method to the general equations by using CCUP. In this paper, non-staggered grid arrangement and predictor-corrector method are used to enhance later development and the solution accuracy and convergence performance. To validate the numerical algorithm proposed in this paper, the two-dimensional unsteady flow in the driven cavity is simulated. The numerical results of this subject using the present algorithm are compared with other numerical results. As a result, it is prived that the present scheme gives stable and improved solutions, and the results even coarse grid are in good agreement with other result using a fine grid arrangement.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.548-554
• /
• 1996

A new method to locate modular fixtures using an optimization technique is proposed. The optimal fixture arrangement is derived to minimize the elastic deformation of a workpiece. That is, a fixture arrangement is regarded better if it minimized the elastic deformation of the workpiece while fixing a workpart of course. In this approach, the workpiece is projected into two dimensional domain to simplify the 3-dimensional fixture arrangement problem into 2-dimensional one. Thus the problem is reduced to find the optimal positions of one horizontal clamp and three locators which minimize the total deformation of the workpiece and the design variables are the location of the contact points between the boundary of the workpiece and the 4-fixels. The Genetic Algorithm is used for the optimization by mapping each design variables to a gene of a chromosome. The fitness value is the total strain energy of the workpiece calculated by the fin element analysis.

• IE interfaces
• /
• v.13 no.2
• /
• pp.266-272
• /
• 2000

This paper deals with a computer-aided product arrangement system in the plant industry. The arrangement schedule may be performed manually. But this is inadaptable to change and difficult to store the results, which eventually requires time consuming and ineffective works. Using computerbased scheduling system, problems mentioned above can be resolved. In the system, the products can be arranged in a workarea with an automatic algorithm as well as manual operation using mouse dragging. In the automatic scheduling algorithm, the position of a product is determined by considering the existing products and material handling costs. Then the scheduled results are stored in DB and can be manipulated at any time.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.483-484
• /
• 2013