• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.22-28
• /
• 2009

We consider facility layout problems, where mn facility units are assigned into mn cells. These cells are arranged into a rectangular pattern with m rows and n columns. In order to solve this cell type facility layout problem, many approximation algorithms with improved local search methods were studied because it was quite difficult to find exact optimum of such problem in case of large size problem. In this paper, new algorithms based on Simulated Annealing (SA) method with two neighborhood generation methods are proposed. The new neighborhood generation method adopts the exchanging operation of facility units in accordance with adjacent preference. For evaluating the performance of the neighborhood generation method, three algorithms, previous SA algorithm with random 2-opt neighborhood generation method, the SA-based algorithm with the new neighborhood generation method (SA1) and the SA-based algorithm with probabilistic selection of random 2-opt and the new neighborhood generation method (SA2), are developed and compared by experiment of solving same example problem. In case of numeric examples with problem type 1 (the optimum layout is given), SA1 algorithm could find excellent layout than other algorithms. However, in case of problem type 2 (random-prepared and optimum-unknown problem), SA2 was excellent more than other algorithms.

• 한국전자통신학회논문지
• /
• 제16권3호
• /
• pp.533-540
• /
• 2021

시스템의 성능을 평가하기 위하여 1차원 3-이웃 셀룰라 오토마타(Cellular Automata, 이하 CA) 기반의 의사 난수 생성기가 여러 분야에서 많이 응용되고 있다. 보다 더 효과적인 키 수열 생성을 위해 2차원 CA와 1차원 5-이웃 CA가 응용되었으나, 주어진 특성 다항식에 대응하는 대칭 1차원 5-이웃 CA를 설계하는 것은 매우 어려운 문제이다. 이를 해결하기 위해 특성 다항식의 점화식을 이용한 합성 방법, Krylov 행렬을 이용한 합성 방법과 같이 1차원 5-이웃 CA 합성에 관한 연구들이 진행되었다. 그러나 여전히 비선형 방정식을 풀어야 하는 문제점이 있었다. 이러한 문제점을 해결하기 위해, 최근 90/150 CA의 전이 행렬과 블록행렬을 이용한 1차원 5-이웃 CA 합성 방법이 제안되었다. 본 논문에서는 제안된 알고리즘의 이론적인 과정을 상세히 기술하고 그 알고리즘을 이용하여 높은 차수의 원시 다항식에 대응하는 대칭 1차원 5-이웃 CA를 구한다.

• 한국컴퓨터정보학회논문지
• /
• 제11권1호
• /
• pp.129-138
• /
• 2006

지금까지 maximal covering문제를 해결하기 위해 다양한 기법들이 적용되어 왔다. 타부 탐색 역시 그 중의 하나이다. 그러나 기존 연구에서는 타부 탐색을 비롯한 언덕오르기 탐색이나 시뮬레이티드 어닐링과 같은 이웃해 탐색 기법들에 대한 종합적인 분석과 성능 향상을 위한 노력이 부족하였다. 본 논문에서는 다양한 실험과 분석을 통해 이웃해 탐색 기법들의 성능을 향상시키기 위한 방안을 소개한다. 기본적으로 모든 이웃해 탐색 기법들은 k-exchange 이웃해 생성 방법을 사용하고 있으며 다양한 파라미터 설정에 따라 각 기법의 성능이 어떻게 달라지는가를 분석하였다. 실험 결과 단순 언덕오르기 탐색과 시뮬레이티드 어닐링이 다른 기법들에 비해 훨씬 우수한 탐색 성능을 보였으며, 일반적인 경우와는 달리 단순 언덕오르기 탐색이 시뮬레이티드 어닐링과 비슷한 성능을 보임을 확인하였다.

• 대한기계학회논문집A
• /
• 제20권6호
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• 한국건설관리학회논문집
• /
• 제20권5호
• /
• pp.42-51
• /
• 2019

철도운영기관은 수송수요예측과 열차차량의 수송능력을 토대로 수송계획을 세우고 이에 따른 열차운행계획을 수립한다. 열차운행계획을 통해 열차 운행간격이 조정되어 열차운행시간표(열차다이아)가 작성되고, 열차운행에 사용되는 열차의 차량운영계획이 수립된다. 열차운영기관에서는 열차 운영관리의 효율성을 높이기 위해 다이아에 편성되어진 열차들의 승무인원을 판단하고 배치하는 승무일정계획을 수립해야 한다. 본 연구에서는 승무일정계획 문제인 승무다이아 작성단계에 제약조건을 만족하는 이웃해 탐색기법을 적용하여 승무 계획의 효율적 관리가 가능하도록 하는 방법론을 제시한다. 연구에서 제시한 방법론에 의해 생성된 승무 다이아는 실제 운영하는 열차시간표를 대상으로 기존 승무다이아와 결과 값을 비교하여 제시된 방법론의 효율성을 검증하였다.

• 한국측량학회지
• /
• 제18권3호
• /
• pp.315-322
• /
• 2000

수치표면모형은 어떤 지역 표면의 고도를 표현하는 수치모형이다 이것은 항공사진으로부터 정사영상생성을 생성하는데 필수적인 것이며, 최근에는 항공사진에서 건물과 같은 인공구조물의 추출에도 자주 응용되고 있다 영상정합기술을 사용하면 수치표면모형을 자동적으로 생성할 수 있다. 이 연구에서는 건물지역에 대하여 수치표면모형을 자동적으로 생성하는데 적용할 수 있는 영상정합 방법을 제안하였다. 제안된 정합방법은 중복촬영된 항공사진상에서 공액점과 공액선을 찾아낸다. 공액점을 탐지하는데 있어서는 화소 값간의 상관계수뿐만 아니라 공액점쌍일가능성이 있는 것들간의 위치관계도 비교된다. 공액선 탐지에 있어서는 선 측면의 컬러 속성값, 선의 모양, 인접하는 점 및 선들간의 위치관계, 그리고 선들간의 연결관계가 비교된다. 제안된 정합방법은 건물지역을 포함하는 대상지역의 수치표면모형 자동생성에 유용할 것으로 생각된다.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1997년도 추계학술대회 논문집
• /
• pp.140-145
• /
• 1997

In case of spot-welded joints, the fatigue cracks generally originate from the weld interfaces of the neighborhood nugget tips, and propagate toward the outer surfaces of the sheets. Generally, because fatigue crack was observed in nugget around, strain gage was attached at nugget zone. Accordingly, it was very difficult to detect the generation time of fatigue crack in spot-welded joints and to measure the propagation speed of fatigue crack. We developed the non-destructive method, according to which th fatigue crack propagation rate can be quantitatively estimated by utilizing information obtained from strain gages bonded on the electrode indentations of spot welds. The results measured by real crack were compared with the data which was measured by strain gauge method in fatigue testing. And so fatigue strength was evaluated by stress intensity factor. In this study behavior of fatigue crack propagation under repeated load were considered.

• 정보저장시스템학회논문집
• /
• 제1권2호
• /
• pp.137-142
• /
• 2005

In this paper, we propose a new servo system design strategy to reduce the position error signal(PES) and track mis-registration(TMR) in magnetic disk drive systems. The proposed method provides a systematic design procedure based on the plant model and an optimal solution via an optimization with a 'Robust Random Neighborhood Search(RRNS)' algorithm. In addition, it guarantees the minimum PES level as well as stability to parametric uncertainties. Furthermore, the proposed method can be used to estimate the performance at the design stage and thus can reduce the cost and time for the design of the next generation product. The reduction of PES as well as robust stability is demonstrated by simulation and experiments.

• 산업경영시스템학회지
• /
• 제28권2호
• /
• pp.8-17
• /
• 2005

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative Improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.

• Journal of Electrical Engineering and Technology
• /
• 제8권6호
• /
• pp.1251-1260
• /
• 2013

This paper presents the optimal scheduling of hourly consumption in a residential community (community, neighborhood, etc.) based on real-time electricity price. The residential community encompasses individual residential loads, communal (shared) loads, and local generation. Community-aggregated loads, which include residential and communal loads, are modeled as fixed, adjustable, shiftable, and storage loads. The objective of the optimal load scheduling problem is to minimize the community-aggregated electricity payment considering the convenience of individual residents and hourly community load characteristics. Limitations are included on the hourly utility load (defined as community-aggregated load minus the local generation) that is imported from the utility grid. Lagrangian relaxation (LR) is applied to decouple the utility constraint and provide tractable subproblems. The decomposed subproblems are formulated as mixed-integer programming (MIP) problems. The proposed model would be used by community master controllers to optimize the utility load schedule and minimize the community-aggregated electricity payment. Illustrative optimal load scheduling examples of a single resident as well as an aggregated community including 200 residents are presented to show the efficiency of the proposed method based on real-time electricity price.