• 한국경영과학회지
• /
• 제33권2호
• /
• pp.17-26
• /
• 2008

The traveling salesman problem is to find tours through all cities at minimum cost ; simply visiting the cities only once that a salesman wants to visit. As such, the traveling salesman problem is a NP-complete problem ; an heuristic algorithm is preferred to an exact algorithm. In this paper, we suggest an effective cost relaxation using a candidate arc set which is obtained from a regression function for the traveling salesman problem. The proposed method sufficiently consider the characteristics of cost of arcs compared to existing methods that randomly choose the arcs for relaxation. For test beds, we used 31 instances over 100 cities existing from TSPLIB and randomly generated 100 instances from well-known instance generators. For almost every instances, the proposed method has found efficiently better solutions than the existing method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.23-25
• /
• 1998

Many of the currently used PN code acquisition algorithms detect the phase of the incoming PN signal on the basis of ML estimation principle and utilize statistics grounded in taking inner products. By showing that any set of 2n-1 PN sequences arising in SSRG or MSRG (those typically used in IS'95 implementations) configuration constitutes a linearly independent set and that the number of candidate PN sequences has to equal the dimension of the span of the candidate PN sequences, we prove that the lowerbounding computational complexity involved in any PN code acquistion, utilizing (only) inner product computations at each stage of acquisition, corresponds precisely to those, such as double dwell acquistion circuitries, currently used.

• 대한전자공학회논문지
• /
• 제26권9호
• /
• pp.1395-1401
• /
• 1989

An efficient file allocation algorithm and a new method which calculate appraisal value of candidate computer site for distributed computer systems are proposed. The file allocation problem size is reduced by using the preassignment condition. The appraisal value of candidate node is calcualted as the user state array and node state array are varied according to control variables. As the selection criteria is applied to the candidates, the reasonable node is selected and assign state is determined. The proposed algorithm is heuriatic polynomial time algorithm. By performing algorithm for sample problems. It is shown that the proposed algorithm is superior to conventional method in terms of deviation from optimal solution.

• 대한음성학회:학술대회논문집
• /
• 대한음성학회 2006년도 추계학술대회 발표논문집
• /
• pp.142-145
• /
• 2006

Discrimination between speech and music is important in many multimedia applications. Previously we proposed a new parameter for speech/music discrimination, the mean of minimum cepstral distances (MMCD), and it outperformed the conventional parameters. One weakness of it is that its performance depends on range of candidate frames to compute the minimum cepstral distance, which requires the optimal selection of the range experimentally. In this paper, to alleviate the problem, we propose a multi-dimensional MMCD parameter which consists of multiple MMCDs with different ranges of candidate frames. Experimental results show that the multi-dimensional MMCD parameter yields an error rate reduction of 22.5% compared with the optimally chosen one-dimensional MMCD parameter.

• 한국정보처리학회논문지
• /
• 제6권3호
• /
• pp.633-640
• /
• 1999

Reinforcement learning performs learning through interacting with trial-and-error in dynamic environment. Therefore, in dynamic environment, reinforcement learning method like Q-learning and TD(Temporal Difference)-learning are faster in learning than the conventional stochastic learning method. However, because many of the proposed reinforcement learning algorithms are given the reinforcement value only when the learning agent has reached its goal state, most of the reinforcement algorithms converge to the optimal solution too slowly. In this paper, we present COMREL(COMpressed REinforcement Learning) algorithm for finding the shortest path fast in a maze environment, select the candidate states that can guide the shortest path in compressed maze environment, and learn only the candidate states to find the shortest path. After comparing COMREL algorithm with the already existing Q-learning and Priortized Sweeping algorithm, we could see that the learning time shortened very much.

• 대한음성학회지:말소리
• /
• 제60호
• /
• pp.191-201
• /
• 2006

Discrimination between speech and music is important in many multimedia applications. Previously we proposed a new parameter for speech/music discrimination, the mean of minimum cepstral distances (MMCD), and it outperformed the conventional parameters. One weakness of MMCD is that its performance depends on range of candidate frames to compute the minimum cepstral distance, which requires the optimal selection of the range experimentally. In this paper, to alleviate the problem, we propose a multi-dimensional MMCD parameter which consists of multiple MMCDS with combination of different candidate frame ranges. Experimental results show that the multi-dimensional MMCD parameter yields an error rate reduction of 22.5% compared with the optimally chosen one-dimensional MMCD parameter.

• ETRI Journal
• /
• 제31권5호
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

• 한국지구물리탐사학회:학술대회논문집
• /
• 한국지구물리탐사학회 2003년도 Proceedings of the international symposium on the fusion technology
• /
• pp.684-689
• /
• 2003

One field identified by an inverse method is one of multiple candidate solutions those are independently obtained through a specific estimation technique. While averaging of optimized fields can provide a better description of the spatial feature of an unknown field, it deteriorates the flow and transport characteristics of the optimized fields. As a result, the averaged field is not suited for modeling aquifer performances. Based on genetic algorithm, an optimal field synthesis technique is developed, which combines diversely optimized fields into a refined group of fields. Each field in the population is paired, and a sub-region of each field is exchanged by crossover operation to create a group of synthesized fields of enhanced modeling capability. The population of the fields is evolved till the synthesized fields become sufficiently similar. Applications of the optimal field synthesis to synthetic cases indicate that the objective functions of the fields assessing the modeling capabilities are further reduced after the optimal field synthesis. The identified fields from various inverse techniques may yield a range of modeling results under varied flow situations. The uncertainty is narrowed down through the optimal field synthesis and the associated modeling results converge on that of the reference field. The developed inverse modeling facilitates the construction of a reliable simulation model and hence trustworthy predictions of the future performances.

• 한국도서관정보학회지
• /
• 제45권4호
• /
• pp.409-428
• /
• 2014

본 연구에서 부산대표도서관 건립의 입지후보지로 선정된 4곳의 입지후보지에 대하여 각각 비용편익분석과 순현재가치, 내부수익률의 방법을 활용하여 경제적 타당성을 분석하였다. 편익을 분석하기 위해 조건부가치측정법(CVM)을 활용하였으며, 지불의사금액(WTP)을 도출하기 위해 사전조사와 본조사로 구성된 두 차례의 설문조사를 수행하였다. 사전조사를 통해 각 후보지별 최적제시금액을 설계하였으며, 이를 토대로 각 5가지 유형의 제시금액을 설정하고, 본조사를 통해 각 후보지에 대한 지불의사금액(WTP)을 도출하였다. 분석 결과, 4곳 모두 부산대표도서관 건립을 위한 경제적 타당성이 있는 것으로 나타났으며, 그 중 편익-비용 비율이 가장 높은 곳은 부산시민공원 후보지임을 확인하였다.

• 대한기계학회논문집A
• /
• 제37권5호
• /
• pp.609-617
• /
• 2013

본 논문은 무인 자율 주행을 위한 최소 시간 경로계획 알고리즘에 대해서 제안하였다. 최소 시간 경로계획 문제는 경로의 기하학적인 형상에 대한 고려뿐만이 아니라 차량 동역학까지 고려해야 하는 최적 문제이다. 경로계획은 후보 경로 생성 알고리즘과 속도 최적화 알고리즘으로 구성된다. 후보 경로 생성 알고리즘은 최단 거리 경로와 최고 속도 경로를 조합하여 후보경로를 생성한다. 속도 최적화 알고리즘은 차량의 주행성능 한계와 타이어 마찰 한계를 고려하여 각 후보 경로의 최고 속도를 계산한다. 이렇게 계산된 경로와 속도를 이용하여 각 후보 경로의 주행 시간을 계산하고 가장 작은 주행 시간의 경로를 최단시간 경로로 도출한다. 그리고 제안한 알고리즘은 CarSim 과 Matlab/Simulink 를 사용한 시뮬레이션을 통해 검증하였다.