• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.328-338
• /
• 1994

TSP(Traveling Salesman Problem) is a famous problem in Operations Research fields due to its applicability to various problems. It is also well-known that the problem is hard to solve in reasonable time, since it is in the NP-Complete class. Hence it is desired to develop heuristics which have polynominal complexity and also solve the problem to near-optimality. This paper presents a heuristic algorithm for TSP using the concept of dynamic programming. The proposed method has the complexity of O(N$\^$3/), and gives improved solutions than other well-known algorithms in our extensive computational experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.239-242
• /
• 2000

Symbiotic evolutionary algorithms are stochastic search algorithms that imitate the biological coevolution process through symbiotic interactions. In the algorithms, the fitness evaluation of an individual requires first selecting symbiotic partners of the individual. The symbiotic partner effects the change of individual's fitness and search direction. In this study we are to analyze how much partnering strategies can influence the performance of the algorithms. For this goal extensive experiments are carried out to compare the performance of partnering strategies. The NKC model and the binary string covering problem are used as the test-bed problems. The experimental results indicate that there does not exist statistically significant difference in their performance.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.27-37
• /
• 1999

In just-in-time production systems, U-shaped production lines rather than traditional straight lines are often adopted since they have some advantages. The advantages of U-lines over straight lines are that the workstations required can be reduced and the necessary number of workers can be easily adjusted when the demand rates are changed. In this paper, we present a new heuristic based on genetic algorithm to improve the workload smoothness in the U-line. In the proposed algorithm, a new genetic representation is developed which is specific to the problem being solved. To enhance the capability of searching good solutions, genetic operators are designed by using the problem-specific information and heuristics. Extensive experiments are carried out on well-known test-bed problems in the literature to verify the performance of our algorithm. The computational results show that our algorithm is a promising alternative to existing heuristics.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.187-201
• /
• 1998

In ATM networks with high capacity, the effect of failures on transmission links or nodes can be catastrophic, so that the issue of survivability is of great importance. In this paper. we consider the routing problem for working and backup virtual paths(VPs). To accomplish a higher survivability. routing the two kinds of VPs should be taken into account at the same time because backup VP routing depends on the working VP routing. A coevolutionary algorithm is employed to solve the problem for simultaneously routing of working and backup VPs. To develop an efficient coevolutionary algorithm for the problem. structure of populations, encoding method, neighborhood, and genetic operators are studied in this paper. The results of extensive experiments are reported. The performance comparison of the proposed algorithm with a conventional genetic algorithm and existing heuristics shows that our approach is promising.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.1-14
• /
• 2005

We propose a VSSI-CRL(Variable Sampling Size and Samplina Interval-Conforming Run length) synthetic control chart in order to improve the statistical characteristics of both the VSSI chart and the CRL synthetic chart. The VSSI-CRL chart utilizes VSSI sampling scheme, but it produces a signal only when the CRI is less than a given limit. An algorithm for calculating the ARL(Average Run length) and ATS(Average Time to Signal) of the VSSI-CRL chart is developed by employing Markov chain method. We present some lemmas for describing the statistical characteristics of the VSSI-CRL chart under in-control state. A procedure for designing the VSSI-CRL chart is proposed based on the lemmas. Extensive comparative studios show that the VSSI-CRL chart is superior to the CRL synthetic chart or the VSSI chart in general, and is comparable to the EWMA chart in ATS performance.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.21-29
• /
• 2003

The traffic scheduling problem for a satellite cluster with an arbitrary number of satellites is considered. which is one of the most interesting problems in the satellite communication scheduling area. This problem is to find a time slot assignment maximizing the transponder utilization for a satellite cluster This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, we suggest new efficient algorithms for this problem, which have less time complexity than the best existing one and provide much better solution quality. Extensive simulation results are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.4
• /
• pp.1-14
• /
• 2009

This study empirically tests post-M&A performance through competitiveness variables based on extensive firm-based panel data over the past 26 years in the world steel industry. Different measures of profitability, productivity, efficiency, market share, and growth rate which are considered as critical factors of competitiveness are used in the analysis. In particular, this paper tries to separate M&A samples into two cases; horizontal integration (between steel makers) and vertical integration (between steel makers and iron ore suppliers/steel consuming firms). Merged firms show significant improvement in competitiveness relative to other individual firms in the steel industry.

• Knowledge Management Research
• /
• v.19 no.2
• /
• pp.21-45
• /
• 2018

With the widespread use of smartphones and the development of information technology, an online service called SNS(social network service) has emerged, and as an increasing number of people began to use SNS, extensive research has been conducted on SNS. SNS is an important factor for adolescents who are developing social skills that help them to adapt to the society, and for adults who are stepping into the society. The present study investigates the effects of information search, self-disclosure, interaction, and playfulness, all of which are motivational factors for SNS use, on flow in SNS, and empirically analyzes the degree of these variables influence according to flow in SNS and individual's personal nature(extrovert, introvert). The analysis results showed that information search, self-disclosure, interaction, and playfulness were positively correlated with flow in SNS, and flow in SNS was positively correlated with social skills. The degree of influence varied depending on the individual's personal nature(extrovert, introvert). These findings may provide important insights for researchers studying SNS, SNS managers, and company officials using SNS.

• Korean Management Science Review
• /
• v.14 no.1
• /
• pp.67-76
• /
• 1997

The most research on facility layout problems ignored the actual shapes of activity spaces and the aisles between activities. In many cases, the research also ignored the actual shape of building where the activities are to be arranged. In this paper, We present a block based layout technique that applies a genetic algorithm to search for a very good facility layout with horizontal aisles. From the extensive experiments for two different cases with respect to the shape of activity space, it was found that the proposed method generated better layouts than the ones obtained by applying Tam's algorithm in all test problems. The proposed algorithm showed about 10% improvement of performance on the average. We determined the best combination of the reproduction rule and the genetic operators with their probabilities for each test problem through the experiment.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.122-125
• /
• 1998

In this article, a reduction method for nominal variables is presented and its use illustrated. Factor analysis model (FAM) generally enables us to reduce variables having interval or ratio scale based on their correlation coefficients. We developed an extensive method that makes FAM applicative to the case of nominal variables which does not give correlation coefficients, but only the degree of association. Cramer's V coefficient is a well-established measure that provides the strength of association for nominal variables with a range of [0,1]. When Cramer's V coefficient can logically substitute for correlation coefficient, FAM would be extensively used for reduction of nominal variables.