• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.25-31
• /
• 2003

Local alignment is an important task in molecular biology to see if two sequences contain regions that are similar. The most popular approach to local alignment is the use of dynamic programming due to Smith and Waterman, but the alignment reported by the Smith-Waterman algorithm has some undesirable properties. The recent approach to fix these problems is to use the notion of normalized scores for local alignments by Arslan, Egecioglu and Pevzner. In this paper we consider the problem of finding all local alignments whose normalized scores are above a given threshold, and present a fast heuristic algorithm. Our algorithm is 180-330 times faster than Arslan et al.'s for sequences of length about 120 kbp and about 40-50 times faster for sequences of length about 30 kbp.

• Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.253-260
• /
• 2015

Feature-based NC machining, which requires high quality of 3D CAD model, is widely used in machining aircraft structural part. However, there has been little research on how to automatically detect the CAD model errors. As a result, the user has to manually check the errors with great effort before NC programming. This paper proposes an automatic CAD model errors detection approach for aircraft structural part. First, the base faces are identified based on the reference directions corresponding to machining coordinate systems. Then, the CAD models are partitioned into multiple local regions based on the base faces. Finally, the CAD model error types are evaluated based on the heuristic rules. A prototype system based on CATIA has been developed to verify the effectiveness of the proposed approach.

• Journal of the military operations research society of Korea
• /
• v.6 no.1
• /
• pp.93-101
• /
• 1980

An effectively designed budget system in the poor resources environment necessarily has three design criteria : (i) to be both planning-oriented and control-oriented, (ii) to be both rationalistic and realistic, (iii) to be sensitive to the variations of resources environment. PPB system is an extreme (planning-oriented and rationalistic) and conventional OEB/OUB system is the other extreme (control-oriented and incrementalistic). Generally, the merits of rationalism are limited because of the infeasibility of applications. Hence, mixtures of the two extremes such as MBO, ZBB, and RZBB have been examined and applied during the last decade. The classical mathematical models of capital budgeting are the starting points of the development of the Budget-Mix Model introduced in this paper. They are modified by the followings: (i) technological-resource constraints, (ii) bounded-variable constraint, (iii) the exchange rules. Special emphasis is laid on the above (iii), because we need more efficient interresource exchanges in the budget-mix process. The Budget-Mix Model is not based on optimization, but a heuristic approach which assures a satisficing solution. And the application fields of this model range between the incremental Nonzero-Base Budgeting and the rational Zero-Base Budgeting. In this thesis, the author suggests 'the budget- mix concept' and a budget-mix model. Budget-mix is a decision process of making program-mix and resource-mix together. For keeping this concept in the existing organization realistic, we need the development of quantitative models describing budget-mix situations.

• The Journal of Information Systems
• /
• v.25 no.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.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.15-19
• /
• 2004

Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the number of visiting times and the distance between visited cities. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.1-8
• /
• 2003

In this paper. we develop an analytical model to evaluate the virtual topology reconfiguration phase of optical Internet networks. To counter the continual approximation problem brought by traditional heuristic approach, we take the traffic prediction into consideration and propose a new heuristic reconfiguration algorithm called Prediction based Multi-stage Reconfiguration approach. We then use this analytical model to study the different configuration operation policies in response to the changing traffic patterns in the higher layer and the congestion level on the virtual topology. This algorithm persists to decide the optimal instant of reconfiguration easily based on the network state. Simulation results show that our virtual topology management Policy significantly outperforms the conventional one, while the required physical resources are limited.

• Asia-Pacific Journal of Business
• /
• v.15 no.3
• /
• pp.431-448
• /
• 2024

Purpose - This study aims to explore the return characteristics of asset growth factors in the Korean stock marekt by employing the representativeness heuristic-a behavioral bias originally identified by Kahneman and Tversky(1972). Design/methodology/approach - Our empirical analysis, based on Korean stock market data from 2004 to 2023, compared the conditional probability of high asset growth companies achieving elevated returns to the overall probability. This assessment helps gauge the representativeness of potential 'future Google' companies. Additionally, we use regression models to explore investor behavior and market anomalies in the stock returns. Findings - The findings suggest that when dividing the sample period into phases with high and low representativeness measures, biases significantly impact asset growth factors. Specifically, during high representativeness preiods, stock price reversals were absent among high asset growth companies. Conversely, during low representativeness periods, stock price drifts become evident. Research implications or Originality - This research contributes to the field of behavioral finance by providing empirical evidence of the impact of cognitive biases on asset growth and stock returns in an emerging market like Korea. It highlights the need for investors and policymakers to consider psychological factors when analyzing market behaviors, potentially leading to more informed investment strategies and regulatory frameworks.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.4
• /
• pp.303-315
• /
• 2005

In this paper we address a design problem for hub-and-spoke networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. In this paper, CHLPwD is formulated as 0-1 integer programming. We develop an evolutionary algorithm here to solve the large sized CHLPwD. To do this, we present the representation and the genetic operators suitable for the problem and propose a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1699-1708
• /
• 2007

The optimal power flow(OPF) problem was introduced by Carpentier in 1962 as a network constrained economic dispatch problem. Since then, the OPF problem has been intensively studied and widely used in power system operation and planning. In these days, OPF is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. To solve OPF problem, many heuristic optimization methods have been developed, such as Genetic Algorithm(GA), Evolutionary Programming(EP), Evolution Strategies(ES), and Particle Swarm Optimization(PSO). Especially, PSO algorithm is a newly proposed population based heuristic optimization algorithm which was inspired by the social behaviors of animals. However, population based heuristic optimization methods require higher computing time to find optimal point. This shortcoming is overcome by a straightforward parallel processing of PSO algorithm. The developed parallel PSO algorithm is implemented on a PC cluster system with 6 Intel Pentium IV 2GHz processors. The proposed approach has been tested on the IEEE 30-bus system. The results showed that computing time of parallelized PSO algorithm can be reduced by parallel processing without losing the quality of solution.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.2
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.