검색결과

검색조건
좁혀보기
검색필터
결과 내 재검색

간행물

    분야

      발행연도

      -

        검색결과 11

        1.
        2019.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.
        4,200원
        3.
        2008.03 KCI 등재 구독 인증기관 무료, 개인회원 유료
        The vehicle routing problem determines each vehicle routes to find the transportation costs, subject to meeting the customer demands of all delivery points in geography. Vehicle routing problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems. And computational experiments on these instances show that the proposed heuristic yields better results than the simple tabu search does.
        4,000원
        4.
        2006.09 KCI 등재 구독 인증기관 무료, 개인회원 유료
          Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle rout
        4,000원
        5.
        2004.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors simultaneously Meta-heuristic generally finds a good solution If It starts from a good solution In this paper, a tabu
        4,000원
        6.
        2004.04 구독 인증기관 무료, 개인회원 유료
        This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors at a time. The problem is to find a schedule of minimal time to complete all tasks. In this paper, a tabu search is presented. Numerical results show that tabu search yields a better performance than the previous studies.
        3,000원
        11.
        2005.09 KCI 등재 서비스 종료(열람 제한)
        본 연구에서는 퍼지논리제어의 적용을 통해 홍수시 저수지의 방류량을 결정하는데 있어, 예측유입량 자료에 내재된 불확실성을 고려할 수 있는 저수지 운영 모형을 구성하고자 하였다. 제어규칙은 전문가들의 의견을 반영해 규칙기반을 설정하는데 이러한 일반적인 방법의 단점을 보완하고자 전역 최적화 기법인 타부탐색을 이용하여 제어규칙을 자동적으로 설정해 퍼지-타부탐색 모형을 구성하였다. 모형의 적용 결과, 첨두방류량이 감소되어 홍수조절율이 개선되었으며, 총 방류량도