• Journal of Electrical Engineering and Technology
• /
• 제8권4호
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• 한국시뮬레이션학회논문지
• /
• 제19권2호
• /
• pp.99-106
• /
• 2010

대잠작전에서 HMS를 이용한 탐색이 그 기본전술로 이용되고 있으며 점차 HMS 운용전술의 중요성이 증대되고 있으나, 해양환경, 탐색패턴, 소나 운용전술, 대잠 탐색전술 등의 상호작용으로 인하여 효과적인 대잠 탐색전술 개발에 어려움이 있다. 본 연구에서는 다양한 대잠 탐색환경에서 HMS 탑재함이 잠수함을 탐색하는데 사용할 수 있는 탐색패턴들을 분석할 수 있는 시뮬레이터를 개발하였다. 개발된 시뮬레이터는 대잠탐색에 영향을 주는 다양한 요인들을 반영하고, 대잠함의 탐색패턴 및 잠수함의 회피 기동 등을 고려하여, 단독 또는 다수 세력에 의한 협동 대잠작전 등의 다양한 대잠탐색을 시뮬레이션 할 수 있다. 개발된 시뮬레이터는 HMS를 이용한 체계적이고 효율적인 대잠전 운영전술을 개발하고 발전시키는데 유용하게 활용 가능하다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제25권1호
• /
• pp.159-182
• /
• 2016

Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

• 정보관리연구
• /
• 제32권1호
• /
• pp.1-22
• /
• 2001

본 연구는 이용자가 필요로 하는 과학기술정보를 찾기까지 학술지 목록 데이터베이스, 학술지기사 데이터베이스, 원문 데이터베이스를 각기 개별적으로 검색하는 기존의 방식에서 벗어나 통합검색을 지원하는 학술지 원 클릭 서비스 체제를 구현하고자 수행되었다. 데이터베이스 간, 그리고 DB와 전자 저널을 통합하여 학술지 원 클릭 서비스 체제를 구현함으로써 이용자는 학술지 브라우징, 학술지 검색, 학술지 기사검색, 전자 저널 보기, Alert 서비스, My Favorite Journal및 Keyword 등록관리, 원문복사신청을 단일 인터페이스 상에서 이용할 수 있다. 이용자는 학술지 OPAC을 통하여 모든 정보원을 검색하고 학술지 원문까지 입수할 수 있다.

• ETRI Journal
• /
• 제31권5호
• /
• pp.518-524
• /
• 2009

Single parity check (SPC) product codes are simple yet powerful codes that are used to correct errors and/or recover erasures. The focus of this paper is to evaluate the performance of such codes under erasure scenarios and to develop a closed-form tight upper bound for the post-decoding erasure rate. Closed-form exact expressions are derived for up to seven erasures. Previously published closed-form bounds assumed that all unrecoverable patterns should contain four erasures in a square. Additional non-square patterns are accounted for in the proposed expressions. The derived expressions are verified using exhaustive search. Eight or more erasures are accounted for by using a bound. The developed expressions improve the evaluation of the recoverability of SPC product codes without the need for simulation or search algorithms, whether exhaustive or novel.

• 청정기술
• /
• 제7권2호
• /
• pp.99-107
• /
• 2001

Optimization methodologies have been proposed of find the best environment-friendly recycling pathways of plastic materials based on life-cycle assessment (LCA) methodology. The main difficulty in conducting this optimization study is that multiple environmental burdens have to be considered simultaneously as the cost functions. Instead of generating conservative Pareto or noninferior solutions following multi-objective optimization approaches, we have proposed some practical criteria on how to combine the different environmental burdens into a single measure. The obtained single objective optimization problem can then be solved by conventional nonlinear programming techniques or, more effectively, by a tree search method based on decision flows. The latter method reduces multi-dimensional optimization problems to a set of one-dimensional problems in series. It is expected the suggested tree search approach can be applied to many LCA studies as a new promising optimization tool.

• Management Science and Financial Engineering
• /
• 제3권1호
• /
• pp.75-88
• /
• 1997

Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.

• 한국통신학회논문지
• /
• 제40권11호
• /
• pp.2298-2304
• /
• 2015

본 논문은 다중 셀 다중입력 단일 출력 (MISO : multiple-input single-output) 하향링크 능동 안테나 시스템 (AAS : active antenna systems)에서 기지국의 수직 각도를 최적화하는 새로운 기법을 제시한다. 본 연구에서는 기존의 전역 탐색 방식 대신 간단하면서 최적의 값에 근사한 알고리듬들을 제안한다. 먼저, random matrix theory의 특성을 반영하여 평균 전송용량에 large system approximation이 적용된 수직적 빔포밍 알고리듬을 소개한다. 다음으로, signal-to-leakage-and-noise ratio (SLNR)을 기반으로 최적화 문제를 간단하게 만드는 수직적 빔포밍 알고리듬을 제안한다. 실험 결과를 통해 제안된 알고리듬들의 성능이 기존의 전역 탐색 알고리듬에 비해 복잡도가 매우 감소됨에도 불구하고 거의 비슷한 성능을 보임을 증명하였다.

• 천문학회지
• /
• 제35권1호
• /
• pp.35-40
• /
• 2002

Gaudi, Naber & Sackett pointed out that if an event is caused by a lens system containing more than two planets, all planets will affect the central region of the magnification pattern, and thus the existence of the multiple planets can be inferred by detecting additionally deformed anomalies from intensive monitoring of high magnification microlensing events. Unfortunately, this method has important limitations in identifying the existence of multiple planets and determining their parameters (the mass ratio and the instantaneous projected separation) due to the degeneracy of the resulting light curve anomalies from those induced by a single planet and the complexity of multiple planet lensing models. In this paper, we propose a new channel to search for multiple planets via microlensing. The method is based on the fact that the lensing light curve anomalies induced by multiple planets are well approximated by the superposition of those of the single planet systems where the individual planet-primary pairs act as independent lens systems. Then, if the source trajectory passes both of the outer deviation regions induced by the individual planets, one can unambiguously identify the existence of the multiple planets. We illustrate that the probability of successively detecting light curve anomalies induced by two Jovian-mass planets located in the lensing zone through this channel will be substantial. Since the individual anomalies can be well described by much simpler single planet lensing models, the proposed method has an important advantage of allowing one to accurately determine the parameters of the individual planets.

• 대한기계학회논문집A
• /
• 제26권6호
• /
• pp.987-992
• /
• 2002

In an attempt to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. In this paper, pareto-based Continuous Evolutionary Algorithms for Multiobjective Optimization problems having continuous search space are introduced. This algorithm is based on Continuous Evolutionary Algorithms to solve single objective optimization problems with a continuous function and continuous search space efficiently. For multiobjective optimization, a progressive reproduction operator and a niche-formation method fur fitness sharing and a storing process for elitism are implemented in the algorithm. The operator and the niche formulation allow the solution set to be distributed widely over the Pareto-optimal tradeoff surface. Finally, the validity of this method has been demonstrated through a numerical example.