• 한국정밀공학회지
• /
• 제17권4호
• /
• pp.209-219
• /
• 2000

A method is developed to evaluate machining process and to determine the optimal machining conditions considering the environmental effects. The method Is based on the evaluation attributes from the general LCA programs and the analysis technique of AHP from HHS. To assist the analysis. the mass models of cutting energy, tools, and fluids are developed. The models may be used for both quantitative prediction of the uses and disposed masses of materials and optimization of the machining conditions. The algorithm with the mass models is applied to the milling process planning. The process to survey the environmental data, calculate the used mass, and evaluate the alternatives is demonstrated. This demonstration illustrates the of the change of process conditions of the decision making.

• 한국경영과학회지
• /
• 제13권1호
• /
• pp.10-23
• /
• 1988

This paper examines a deterministic, discrete-time, finite-horizon, production/distribution problem for a one-plant multi-retailer system. Production may occur at the plant in each time period. Customer demands at each retailer over a finite number of periods are known and must be met without backlogging. The plant as well as the retailers can serve as stocking points. The problem is to find a minimum-cost production/distribution schedule satisfying the known demands. We show that under a certain cost structure a nested policy is optimal, and present an efficient algorithm to find such an optimal policy. Planning horizon results and some computational saving schemes are also presented.

• 한국항해항만학회지
• /
• 제28권6호
• /
• pp.517-523
• /
• 2004

컨테이너 적하계획은 항만 장비운용의 효율성을 결정짖는 주요 요인 중 하나이다. 적하계획 문제에 유전알고리즘을 응용할 때 처리 작업 수가 많게 되면, 기존의 방법으로 많은 시간이 걸린다. 이 문제를 해결하기 위하여 본 논문에서는 이주모델과 링구조 기반의 의사병렬 유전알고리즘을 개발하고 컨테이너의 최적 적하순서를 결정하는 문제에 적용하여 그 유효성을 밝힌다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.283-285
• /
• 2001

The most work-space invest much time and labor for optimal arrangement. The work-plates of the work-space should be arranged, processed and assembled under the restricted work space. The optimal arrangement under the terms of a restriction arrange the maximum work-plates in appointed work-space. It's the central aim. The work-plates arrangement scheduling of the most work-space are achieved through the experience of the planner. Like this, if the work-plates arrangement is worked by hand, there spend much time for the training planner. And the burden of the personnel expenses occur for using the master worker, also there are dangerous factors to be able to bring the bottleneck circumstance for the process planning, because the quick work planning does not accomplish. With such problems, the biggest problem is inferior the value of the plan. For solved the such problem of hand-operating, some work-spaces developed and used the work-plate arrangement scheduling system for the special quality of themselves. This paper make research into a plan to develop the work-plate arrangement scheduling system efficiently.

• Journal of Construction Engineering and Project Management
• /
• 제7권2호
• /
• pp.1-10
• /
• 2017

The Clonal Selection Algorithm (CSA) is an algorithm inspired by the human immune system mechanism. In CSA, several parameters needs to be optimized by large amount of sensitivity analysis for the optimal results. They limit the accuracy of the results due to the uncertainty and subjectivity. Adaptive Clonal Selection (ACS), a modified version of CSA, is developed as an algorithm without controls by pre-defined parameters in terms of selection process and mutation strength. In this paper, we discuss the ACS in detail and present its implementation in construction site utilization planning (CSUP). When applied to a developed model published in research literature, it proves that the ACS are capable of searching the optimal layout of temporary facilities on construction site based on the result of objective function, especially when the parameterization process is considered. Although the ACS still needs some improvements, obtaining a promising result when working on a same case study computed by Genetic Algorithm and Electimze algorithm prove its potential in solving more complex construction optimization problems in the future.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 학회본부 B
• /
• pp.633-635
• /
• 1999

In this paper, we propose a new method of path planning for multiple mobile robot in dynamic environment. To search the optimal path, multiple mobile robot is always generating path with static and dynamic obstacles avoidance from start point to goal point. The purpose of this paper is to design an optimal path for the mobile robot.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.137-141
• /
• 2000

This paper presents an application of a new Adaptive Genetic Algorithms(AGA) to solve the Optimal Routing problem(ORP) for distribution system planning. In general, since the ORP is modeled as a mixed integer problem with some various mathematical constraints, it is hard to solve the problem. In this paper, we proposed a new adaptive strategy in GA to overcome the premature convergence and improve the convergence efficiency. And for these purposes, we proposed a fitness function suited for the ORP. In the proposed AGA, we used specially designed adaptive probabilities for genetic operators to consider the characteristics of distribution systems that are operated under radial configuration. The proposed algorithm has been tested in sample networks and the results are presented.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.142-146
• /
• 2000

This paper Presents a heuristic algorithm based on branch exchange method to solve ORP (Optimal Routing Problem) for distribution system planning. The ORP is a complex task which is generally formulated as a combinatorial optimization problem with various constraints. The cost function of ORP is consisted of the investment cost and the system operation cost that is generally expressed with system power loss. This paper also adopt an specialy designed selection method of maximum loss reduction loop and branch to reduce optimization time. The effectiveness of the proposed algorithm was shown with 32, 69 bus example system.

• Journal of Welding and Joining
• /
• 제27권2호
• /
• pp.57-62
• /
• 2009

This research was carried out to improve the productivity in the subassembly process of shipbuilding through optimal work planning for the shortest work time. The work time consist of welding time, moving time of gantry, teaching time of robot and robot motion time. The shortest work time is accomplished by even distribution of work and the shortest welding sequence. Even distribution of work was done by appling the simple algorithm. The shortest work sequence was determined by using GA. The optimal work planning decreased the total work time of the subassembly process by 4.1%. The result showed the effectiveness of the suggested simple algorithm for even distribution of work and GA for the shortest welding sequence.

• 한국항해학회지
• /
• 제25권4호
• /
• pp.323-333
• /
• 2001

This paper presents a decision making model for the cruise ship management. A network based optimization model has been developed for a single cruise ship operation. It gives optimal itinerary patterns over the planning period for the cruise ship managers wanting to maximize profit from the cruise ship operation. A network solution method to find the optimal solution is also developed. This network model can be equivalently transformed into a linear programming model, which makes the implementation of the model quite practical however complicated the given set of possible itineraries may be. The ship scheduling network developed in this study can also be used as a general framework to describe all possible cruise ship itineraries the cruise ship manager can figure out.