Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korean Operations Research and Management Science Society
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 32, Issue 4 - Dec 2007
Volume 32, Issue 3 - Sep 2007
Volume 32, Issue 2 - Jun 2007
Volume 32, Issue 1 - Mar 2007
Selecting the target year
An Experimental Comparison of Adaptive Genetic Algorithms
Yun, Young-Su ;
Journal of the Korean Operations Research and Management Science Society, volume 32, issue 4, 2007, Pages 1~18
In this paper, we develop an adaptive genetic algorithm (aGA). The aGA has an adaptive scheme which can automatically determine the use of local search technique and adaptively regulate the rates of crossover and mutation operations during its search process. For the adaptive scheme, the ratio of degree of dispersion resulting from the various fitness values of the populations at continuous two generations is considered. For the local search technique, an improved iterative hill climbing method is used and incorporated into genetic algorithm (GA) loop. In order to demonstrate the efficiency of the aGA, i) a canonical GA without any adaptive scheme and ii) several conventional aGAs with various adaptive schemes are also presented. These algorithms, including the aGA, are tested and analyzed each other using various test problems. Numerical results by various measures of performance show that the proposed aGA outperforms the conventional algorithms.
A Model for Detecting Braess Paradox in General Transportation Networks
Park, Koo-Hyun ;
Journal of the Korean Operations Research and Management Science Society, volume 32, issue 4, 2007, Pages 19~35
This study is for detecting the Braess Paradox by stable dynamics in general transportation networks. Stable dynamics, suggested by Nesterov and de Palma, is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model based on link latency function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. The phenomenon that increasing capacity of a network, for example creating new links, may decrease its performance is called Braess Paradox. It has been studied intensively under user equilibrium model with link latency function since Braess demonstrated a paradoxical example. However it is an open problem to detect the Braess Paradox under stable dynamics. In this study, we suggest a method to detect the Paradox in general networks under stable dynamics. In our model, we decide whether Braess Paradox will occur in a given network. We also find Braess links or Braess crosses if a network permits the paradox. We also show an example how to apply it in a network.
Cognitive Map based Tacit Knowledge Management Approach to Intelligent Sales Strategy Sharing of Enterprise S/W
Chung, Nam-Ho ; Lee, Nam-Ho ; Lee, Kun-Chang ;
Journal of the Korean Operations Research and Management Science Society, volume 32, issue 4, 2007, Pages 37~50
Dramatic development of information technology requires new type of sales strategy to enterprise S/W dealers. That is, one should thoroughly consider diversified types of enterprise S/W and more elaborated consumer needs to establish successful sales strategy. However, various factors that should be considered in establishing enterprise S/W sales strategy are different according to types of enterprise S/W and hard to be managed systematically which led to the current situation where they have not been discussed enough. Therefore, this study introduced the relationship between the factors that affect selection of enterprise S/W using the concept of cognitive map on various enterprise S/W sales cases. Through this process, this study grouped the cognitive maps of similar cases to introduce their characteristics and made this result to be practically useful to enterprise S/W sales strategy.
A Branch-and-price Algorithm for the Minimum ADM Problem on WDM Ring Networks
Chung, Ji-Bok ;
Journal of the Korean Operations Research and Management Science Society, volume 32, issue 4, 2007, Pages 51~60
In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.
Toward Socially Agreeable Aggregate Functions for Group Recommender Systems
Ok, Chang-Soo ; Lee, Seok-Cheon ; Jeong, Byung-Ho ;
Journal of the Korean Operations Research and Management Science Society, volume 32, issue 4, 2007, Pages 61~75
In ubiquitous computing, shared environments are required to adapt to people intelligently. Based on information about user preferences, the shared environments should be adjusted so that all users in a group are satisfied as possible. Although many group recommender systems have been proposed to obtain this purpose, they only consider average and misery. However, a broad range of philosophical approaches suggest that high inequality reduces social agreeability, and consequently causes users' dissatisfactions. In this paper, we propose social welfare functions, which consider inequalities in users' preferences, as alternative aggregation functions to achieve a social agreeability. Using an example in a previous work, we demonstrate the effectiveness of proposed welfare functions as socially agreeable aggregate functions in group recommender systems.
Application of Analytic Hierarchy Process to the Performance Management of University Organization
Lee, Hyung-Seok ; Kim, Non-Joong ;
Journal of the Korean Operations Research and Management Science Society, volume 32, issue 4, 2007, Pages 77~88
This study is to apply of AHP to the performance management of university organization. Especially, in the present study, the authors modeled performance evaluations for S university administration hierarchically and analyzed the weights of those. The domains of performance evaluations were divided in five domains: strategy, resource management, process, finance management, and customer management, referred to the viewpoints of BSC. The results of analysis revealed that strategy was the most important element of evaluation in the first stage and except for strategy and finance management which consist of the single element of evaluation respectively in the second stage, the efficiency of administration supporting service was the important element of evaluation. The weights of performance evaluations, however, revealed in different as the class of position. Finally this study showed that the weights of performance evaluations computed in the present study can be used as those of evaluation indices for S university administration.
Performance Analysis of a Sleep Mode Operation in the IEEE 802.16e Wireless MAN with M/G/1 Multiple Vacations Model
Jung, Sung-Hwan ; Hong, Jung-Wan ; Chang, Woo-Jin ; Lie, Chang-Hoon ;
Journal of the Korean Operations Research and Management Science Society, volume 32, issue 4, 2007, Pages 89~99
In this paper, an analytic model of a sleep mode operation in the IEEE 802.16e is investigated. A mobile subscriber station(MSS) goes to sleep mode after negotiations with the base station(BS) and wakes up periodically for a short interval to check whether there is downlink traffic to it. If the arrival of traffic is notified, an MSS returns to wake mode. Otherwise, it again enters increased sleep interval which is double as the previous one. In order to consider the situation more practically, we propose the sleep mode starting threshold, during which MSS should await packets before it enters the sleep mode. By modifying the M/G/l with multiple vacations model, energy consumption ratio(ECR) and average packet response time are calculated. Our analytic model provides potential guidance in determining the optimal parameters values such as sleep mode starting threshold, minimal sleep and maximal sleep window.