• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.62-67
• /
• 2004

Many ships in voyage experience weight and buoyancy distribution change by various reasons such as change of sea water density and waves, weather condition, and consumption of fuel, provisions, etc . The weight and buoyancy distribution change can bring the ships out of allowable trim, heeling angle. In these case, the ships should adjust trim and heeling angle by shifting of liquid cargo or ballasting, deballasting of ballast tanks for recovery of initial state or for a stable voyage. But, if the adjustment is performed incorrectly, ship's safety such as longitudinal strength, intact stability, propeller immersion, wide visibility, minimum forward draft cannot be secured correctly. So it is required that the adjustment of trim and heeling angle should be planned not by human operators but by optimization computer algorithm. To make an optimized plan to adjust trim and heeling angle guaranteeing the ship's safety and quickness of process, Uk! combined mechanical analysis and optimization algorithm. The candidate algorithms for the study were heuristic algorithm, meta-heuristic algorithm and uninformed searching algorithm. These are widely used in various kinds of optimization problems. Among them, heuristic algorithm $A^\ast$ was chosen for its optimality. The $A^\ast$ algorithm is then applied for the study. Three core elements of $A^\ast$ Algorithm consists of node, operator, evaluation function were modified and redefined. And we analyzed the $A^\ast$ algorithm by considering cooperation with loading instrument installed in most ships. Finally, the algorithm has been applied to tanker ship's various conditions such as Normal Ballast Condition, Homo Design Condition, Alternate Loading Condition, Also the test results are compared and discussed to confirm the efficiency and the usefulness of the methodology developed the system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권10호
• /
• pp.4823-4843
• /
• 2017

In this paper, an improved utility-based cross-layer dynamic subcarrier allocation (DSA) algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system, which adopts adaptive service rate control (ASRC) to eliminate the service rate waste and improve the spectral efficiency in heterogeneous network including non-real-time traffic and real-time traffic. In this algorithm, furthermore, a first in first out (FIFO) queuing model with finite space is established on the cross-layer scheduling framework. Simulation results indicate that by taking the service rate constraint as the necessary condition for optimality, the ASRC algorithm can effectively eliminate the service rate waste without compromising the scheduling performance. Moreover, the ASRC algorithm is able to further improve the quality of service (QoS) performance and transmission throughput by contributing an attractive performance trade-off between real-time and non-real-time applications.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권1호
• /
• pp.59-64
• /
• 2011

In 2001, the notion of a fuzzy poset defined on a set X via a triplet (L, G, I) of functions with domain X ${\times}$ X and range [0, 1] satisfying a special condition L+G+I = 1 is introduced by J. Negger and Hee Sik Kim, where L is the 'less than' function, G is the 'greater than' function, and I is the 'incomparable to' function. Using this approach, we are able to define a special class of fuzzy posets, and define the 'skeleton' of a fuzzy poset in view of major relation. In this sense, we define the linear discrepancy of a fuzzy poset of size n as the minimum value of all maximum of I(x, y)${\mid}$f(x)-f(y)${\mid}$ for f ${\in}$ F and x, y ${\in}$ X with I(x, y) > $\frac{1}{2}$, where F is the set of all injective order-preserving maps from the fuzzy poset to the set of positive integers. We first show that the definition is well-defined. Then, it is shown that the optimality appears at the same injective order-preserving maps in both cases of a fuzzy poset and its skeleton if the linear discrepancy of a skeleton of a fuzzy poset is 1.

• 한국경영과학회지
• /
• 제30권3호
• /
• pp.81-93
• /
• 2005

This paper models supply chain uncertainties in the dynamic Newsboy Problem context. The system consists of one supplier and one retailer who place an order to the supplier every period. Demand uncertainty is modeled as stochastic period demand, and supply uncertainty as the uncertainty in quantities delivered by the supplier. The supplier delivers exactly the amount ordered by the retailer with probability of $\beta$ and the amount minus K with probability of $(1-\beta)$ We formulate the problem as a dynamic programming problem and derive the first-order optimality condition. Through a numerical study, we measure the extent to which the cost decrease due to the reduction in supply uncertainty depends on the level of demand uncertainty. One of the most important findings In this paper is that this cost decrease is relatively small if demand uncertainty is kept high, and vice versa. We also backup this numerical result by analyzing the distribution of ending Inventory under the supply and demand uncertainties.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.113-143
• /
• 1997

Most of the conflict problems between 2 persons can be represented as a bi-matrix game, because player's utilities, in general, are non-zero sum and change according to the progress of game. In the bi-matrix game the equilibrium point set which satisfies the Pareto optimality can be a good bargaining or coordination solution. Under the condition of incomplete information about the risk attitudes of the players, the bargaining or coordination solution depends on additional elements, namely, the players' methods of making inferences when they reach a node in the extensive form of the game that is off the equilibrium path. So the investigation about the players' inference type and its effects on the solution is essential. In addition to that, the effect of an individual's aversion to risk on various solutions in conflict problems, as expressed in his (her) utility function, must be considered. Those kinds of incomplete information make decision maker Bayesian, since it is often impossible to get correct information for building a decision making model. In Baysian point of view, this paper represents an analytic frame for guessing and learning opponent's attitude to risk for getting better reward. As an example for that analytic frame. 2 persons'bi-matrix game is considered. This example explains that a bi-matrix game can be transformed into a kind of matrix game through the players' implicitly cooperative attitude and the need of arbitration.

• Steel and Composite Structures
• /
• 제7권1호
• /
• pp.53-70
• /
• 2007

This paper presents a analysis of the problem of optimal design of the beams with two I-type cross section shapes. These types of beams are simply supported and subject to pure bending. The strength and stability conditions were formulated and analytically solved in the form of mathematical equations. Both global and selected types of local stability forms were taken into account. The optimization problem was defined as bicriteria. The cross section area of the beam is the first objective function, while the deflection of the beam is the second. The geometric parameters of cross section were selected as the design variables. The set of constraints includes global and local stability conditions, the strength condition, and technological and constructional requirements in the form of geometric relations. The optimization problem was formulated and solved with the help of the Pareto concept of optimality. During the numerical calculations a set of optimal compromise solutions was generated. The numerical procedures include discrete and continuous sets of the design variables. Results of numerical analysis are presented in the form of tables, cross section outlines and diagrams. Results are discussed at the end of the work. These results may be useful for designers in optimal designing of thin-walled beams, increasing information required in the decision-making procedure.

• 제어로봇시스템학회논문지
• /
• 제6권5호
• /
• pp.404-414
• /
• 2000

This paper addresses the development of a 3-fingered humanoid robot hand system and a real-time grasp synthesis of multifingered robot hands to find grasp configurations which satisfy the force closure condition of arbitrary shaped objects. We propose a fast and efficient grasp synthesis algorithm for planar polygonal objects, which yields the contact locations on a given polygonal object to obtain a force closure grasp by the multifingered robot hand. For an optimum grasp and real-time computation, we develop the preference and the hibernation process and assign physical constraints of the humanoid hand to the motion of each finger. The preferences consist of each sublayer reflecting the primitive preference similar to the conditional behaviors of humans for given objectives and their arrangements are adjusted by the heuristics inspired from human's grasping behaviors. The proposed method reduces the computational time significantly at the sacrifice of global optimality, and enables the grasp posture to be changable within two-finger and three-finger grasps. The performance of the presented algorithm is evaluated via simulation studies to obtain the force-closure grasps of polygonal objects with fingertip grasps. The architecture suggested is verified through experimental implementation to our robot hand system by solving the 2- or 3-finger grasp synthesis.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.621-639
• /
• 2011

The purpose of this paper is to introduce a general iterative process by viscosity approximation method with parallel method to ap-proximate a common element of the set of solutions of a mixed equilibrium problem and of the set of common fixed points of a finite family of $k_i$-strict pseudo-contractions in a Hilbert space. We obtain a strong convergence theorem of the proposed iterative method for a finite family of $k_i$-strict pseudo-contractions to the unique solution of variational inequality which is the optimality condition for a minimization problem under some mild conditions imposed on parameters. The results obtained in this paper improve and extend the corresponding results announced by Liu (2009), Plubtieng-Panpaeng (2007), Takahashi-Takahashi (2007), Peng et al. (2009) and some well-known results in the literature.

• 제어로봇시스템학회논문지
• /
• 제21권7호
• /
• pp.595-601
• /
• 2015

This paper presents an unified chassis control with electronic stability control (ESC) and active front steering (AFS) under lateral force constraint on AFS. When generating the control yaw moment, an optimization problem is formulated in order to determine the tire forces, generated by ESC and AFS. With Karush-Kuhn-Tucker optimality condition, the optimum tire forces can be algebraically calculated. On low friction road, the lateral force in front wheels is easily saturation. When saturated, AFS cannot generate the required control yaw moment. To cope with this problem, new constraint on the lateral tire force is added into the original optimization problem. To check the effectiveness of the propose method, simulation is performed on the vehicle simulation package, CarSim.

• 한국항공우주학회지
• /
• 제43권11호
• /
• pp.943-951
• /
• 2015

관성센서는 항법 시스템에서 매우 중요한 요소로서, 다수의 관성 센서를 특정한 기하학적 형상으로 배치하여 시스템의 성능과 신뢰도를 향상시킬 수 있다. 이 때 시스템 신뢰도 향상을 위한 고장검출 및 분리는 배치된 각 센서의 신호를 비교하여 이루어지며, 몇 가지 형태에 대한 최적 조건이 알려져 있다. 본 논문에서는 다중원추 배치형상을 제시하여 항법 최적성능을 위한 조건을 정리하고, 이러한 조건 하에서 기존에 정의된 성능지표를 사용하여 고장검출 및 분리 성능을 분석하였다. 성능지표 비교 결과, 다중 원추배치 형상이 이전에 제시된 다른 형상들보다 고장검출 및 분리 성능 측면에서 더 뛰어나다는 것을 확인하였다.