• 한국항해항만학회지
• /
• 제33권2호
• /
• pp.127-134
• /
• 2009

If the research on double cycle is revitalized, crane productivity will be rapidly improved bemuse double cycle is an operational technique that can maximize equipments efficiency (Quay crane, RMG/RTG, Yard tractor). Unfortunately, it is very difficult for terminal operators to find out the starting point of double cycle bemuse the loading & unloading pattern and conditions are various. Therefore, terminal operators are apt to fail to find out the optimal starting point of double cycle to maximize its frequency. Experiencing the same mistakes in the process we made efforts to find out the optimal starting point, finally we found out the formula for it. And we verified its precision is perfect through a lot of testing. This paper on double cycling focused on making the formula to find out optimal starting point of double cycle to maximize its frequency. And it can be applied to various ships' stowages in common.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권10호
• /
• pp.582-590
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits(CNC) is proposed. The analog circuits based optimal path planning is very useful since most of the optimal path planning problems require real time computation. There has already been a previous study to implement the dynamic programming with analog circuits. However, it could not be applied for the practically large size of problems since the algorithm employs the mechanism of reducing its input current/voltage by the amount of cost, which causes outputs of distant cells to become zero. In this study, a subgoal-based dynamic programming algorithm to compute the optimal path is proposed. In the algorithm, the optimal paths are computed regardless of the distance between the starting and the goal points. It finds subgoals starting from the starting point when the output of the starting cell is raised from its initial value. The subgoal is set as the next initial position to find the next subgoal until the final goal is reached. The global optimality of the proposed algorithm is discussed and two different kinds of simulations have been done for the proposed algorithm.

• 한국정밀공학회지
• /
• 제12권6호
• /
• pp.128-136
• /
• 1995

The problem addressed in this paper is that of the on-line computational burden of time-optimal control laws for quick, strongly nonlinear systems like revolute robots. It will be demonstrated that a large amount of off-line computation can be substituted for most of the on-line burden in cases of time optimization with constrained inputs if differential point-to- point specifications can be relaxed to cell-to-cell transitions. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. The cell boundaries approximate stream surfaces of the phase fluid and surfaces of equal transit times. Once the cells have been designed, the bang- bang schedules for the inputs are determined for all likely starting cells and terminating cells. The scheduling process is completed by treating all cells into which the trajectories might unex- pectedly stray as additional starting cells. Then an efficient-to-compute control law can be based on the resulting table of optimal strategies.

• 산업경영시스템학회지
• /
• 제33권3호
• /
• pp.30-39
• /
• 2010

This paper considers a problem of optimizing torch paths to cut stock plates nested with open contours. For each contour, one of the two ending points is to be selected as a starting point of cutting with the other being the exit point. A torch path is composed of a single depot and a series of starting and ending points of contours to be cut. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem. To solve the problem, a hybrid genetic algorithm with the local search of torch paths is proposed. The genetic algorithm is tested for hypothetical problems whose optimal solutions are known in advance due to the special structure of them. The computational results show that the algorithm generates very near optimal solutions for most cases of the test problems, which verifies the validity of the algorithms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.342-344
• /
• 2002

This paper presents a new strategy to find starting points for placing optimally Phasor Measurement Units(PMUs). The performance of the starting point, initial placement set of PMUs, affect critically the computational burden and/or time, because the Optimal PMU Placement (OPP) problem is formulated the combinatorial optimization. By analyzing the properties of OPP solutions on IEEE sample systems in detail, a new strategy for initial PMU placement, in this paper, is proposed. To verify the performance of the suggested strategy, the comparison with the existing strategy and the new one, on IEEE sample systems. is performed. By using the new strategy, the numbers of search spaces to solve the OPP problem is drastically decreased.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 춘계학술대회
• /
• pp.171-173
• /
• 2022

4차 산업혁명 기술은 국민들의 생활을 효율적인 방향으로 발전시키고 있다. 인터넷 상에서 제공되는 GIS는 국민이 원하는 목적지에 빠르게 도달할 수 있도록 교통안내, 시간안내 등의 서비스를 제공한다. 국토지리정보원과 지방자치단체들은 생활 SOC 접근성을 조사하여 최적지점 분석에 활용하기 위한 기초 자료를 제작하고 있으며, 본 연구는 최단거리 구성을 위하여 출발점에서 도착점까지의 접근성을 분석하였다. Dijkstra알고리즘을 활용하여 도로망도와 출발지점, 도착점을 통해 최단거리를 계산하고 이를 활용하여 최적의 접근성을 계산하였다. 연구 결과 다수의 도착점에 대한 분석을 수행한 경우 약 0.1% 이상의 오류가 나타났으며, 최적지점을 위한 위치 분석을 위하여 3번 이상의 분석이 필요하였다. 다대다(M × N) 계산을 처리할 경우 더 많은 시간이 소요되었으며, 본 분석을 위해 32G이상의 메모리 사양이 요구되었다. 범용적인 최적 접근성 분석 서비스의 제공은 기업의 창업 및 생활 시설의 위치 선정에 효과적으로 이용될 수 있으며, 국민 누구나 시설 및 주거지 선정 시 서비스를 활용할 수 있다. 본 연구를 기반으로 효율적이고 편한 푸시 서비스를 국민과 정부기관에 제공한다면 국가와 사회의 발전에 이바지 될 것이다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.176-179
• /
• 2007

In this paper, we develop the path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1].

• 한국정밀공학회지
• /
• 제29권4호
• /
• pp.469-478
• /
• 2012

This study aims to discover the optimal pipe layout for a ship, which generally needs a lot of time, efforts and experiences. Genetic algorithm was utilized to search for the optimum. Here the optimum stands for the minimum pipe length between two given points. Genetic algorithm is applied to planar pipe layout problems to confirm plausible and efficiency. Sub-programs are written to find optimal layout for the problems. Obstacles are laid in between the starting point and the terminal point. Pipe is supposed to bypass those obstacles. Optimal layout between the specified two points can be found using the genetic algorithm. Each route was searched for three case models in two-dimensional plane. In consequence of this, it discovered the optimum route with the minimized distance in three case models. Through this study, it is possible to apply optimization of ship pipe route to an actual ship using genetic algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 추계학술대회 논문집 전력기술부문
• /
• pp.226-228
• /
• 2007

This paper proposes Nonlinear Interior Point Method (NIPM) including discrete control variables optimal power flow formulations. The algorithm utilizes the robustness in terms of starting point and fast convergence for large scale power system of NIPM and an introduction of rounding penalty function which is augmented in the Lagrangian function to handle discrete control variables. The derived formulation shows a simplified approach to deal with discrete control problems which is implementable in real large scale systems.

• Journal of Mechanical Science and Technology
• /
• 제15권8호
• /
• pp.1119-1131
• /
• 2001

In this paper we formulate an optimization based approach to determining the maximally inscribed rectangle in a robots workspace. The size and location of the maximally inscribed rectangle is an effective index for evaluating the size and quality of a robots workspace. Such information is useful for, e. g., optimal worktable placement, and the placement of cooperating robots. For general robot workspaces we show how the problem can be formulated as a constrained nonlinear optimization problem possessing a special structure, to which standard numerical algorithms can be applied. Key to the rapid convergence of these algorithms is the choice of a starting point; in this paper we develop an efficient computational geometric algorithm for rapidly obtaining an approximate solution suitable as an initial starting point. We also develop an improved version of the algorithm of Haug et al. for calculating a robots workspace boundary.