• 대한산업공학회지
• /
• 제34권2호
• /
• pp.205-215
• /
• 2008

convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.277-280
• /
• 2006

This paper deals with a heuristic algorithm for solving a broadband converged access networks (BCAN) design problem. The problem is to minimize the total cost of switches and cables while satisfying demand and QoS constraints. We propose a Tabu Search (TS) algorithm for finding a good feasible solution within a reasonable time limit.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• 대한산업공학회지
• /
• 제41권1호
• /
• pp.1-9
• /
• 2015

In shipbuling processes, a quay wall is a major resource for additional operations after an erection operation at dock. A quay wall is becoming a new bottleneck instead of docks, while ship types with long operation time at quay wall are increasing recently. We developed a quay wall scheduling algorithm for the quayside operations of ships in this paper. The objective function is to minimize the sum of not assigned days of ships which have to be assigned to any quay wall under limited numbers of quay walls. The scheduling algorithm is based on an assignment method to assign each ship to a quay wall among its alternative quay walls at the time of launching or moving to another quay wall. The scheduling algorithm is also using Tabu Search algorithm to optimize assignment sequence of ships. The experiment shows that the algorithms in this paper are effective to make schedule of the quayside operations of ships.

• 대한산업공학회지
• /
• 제37권3호
• /
• pp.198-208
• /
• 2011

At a shipyard, the efficient handling of blocks is one of the most important factors in the shipbuilding process. We consider the problem of deployment planning of blocks from storage yards. As some information of block arrangement should be considered to handle the problem, we adopt the block arrangement based on the coordinates and sizes of each block at a storage yard. Deployment planning for a block involves deciding upon its transportation route from the storage yard and searching for blocks that would obstruct its transportation along this route. A tabu search algorithm for deploying several blocks is developed to minimize the number of obstructive blocks deployed together from the storage yards at a shipyard. The results of computational experiments show that the developed algorithm is very useful in the deployment planning of multiple blocks from the storage yards.

• 한국컴퓨터정보학회논문지
• /
• 제15권10호
• /
• pp.229-237
• /
• 2010

최근 산림경영의 목표가 다양해지고 환경적인 기능을 고려한 공간적인 요소들이 고려되는 등 경영계획을 수립하는 것이 점차 복잡해지고 있다. 따라서 다양한 목표와 조건을 만족시킬 수 있는 최적화 경영기법의 개발이 요구되고 있다. 본 연구에서는 복잡한 경영목표를 다루거나 공간적인 인자들을 다루는데 효과적인 Tabu Search(TS) 휴리스틱 알고리즘을 이용하여, 최적화된 경영계획을 수립할 수 있도록 산림경영 의사결정지원시스템을 개발하였다. 이를 위해 TS 알고리즘의 논리적 흐름을 분석하여 여러 세부 프로세스를 설계하였다. 또한 시스템의 효율성을 높이기 위해서, 각 세부 프로세스의 운영시간 및 작업부하를 최소화하고 시스템 자원의 활용을 극대화하기 위한 방안들을 검토하였다. 이를 토대로 본 연구에서는 TS 알고리즘의논리적 흐름을 일부 변형한모델과 원형 알고리즘에 기반한 모델을 적용하여 최적화 모델링을 수행하고 그 결과를 비교하였다. 그 결과 본 연구를 통해 개발된 의사결정시스템은 주어진 경영목표 및 제한조건을 만족시키는 해를 제공하는 것이 가능하였으며, 특히 변형된 TS 알고리즘을 적용하는 경우 보다 안정적인 최적화 모델링이 가능한 것으로 나타났다. 앞으로 우리나라 산림의 최적화된 경영계획을 수립하는데 본 연구에서 개발된 의사결정시스템의 활용이 가능할 것으로 기대된다.