• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2004년도 춘계학술대회 논문집
• /
• pp.514-521
• /
• 2004

A routing is the path that an actual train set follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

• 한국철도학회논문집
• /
• 제7권4호
• /
• pp.326-331
• /
• 2004

A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

• Journal of the Korean Physical Society
• /
• 제73권12호
• /
• pp.1808-1813
• /
• 2018

I develop a transfer matrix algorithm for computing the geometric quantities of a square lattice polymer with nearest-neighbor interactions. The radius of gyration, the end-to-end distance, and the monomer-to-end distance were computed as functions of the temperature. The computation time scales as ${\lesssim}1.8^N$ with a chain length N, in contrast to the explicit enumeration where the scaling is ${\sim}2.7^N$. Various techniques for reducing memory requirements are implemented.

• 대한산업공학회지
• /
• 제1권2호
• /
• pp.73-81
• /
• 1975

In an earlier paper ('Scheduling Jobs on a Number of Identical Machines' by Elmaghraby and Park, March 1974, AIIE Transactions) a branch-and-bound algorithm was developed for the sequencing problem when all jobs are available to process at time zero and are independet (i.e., there are not a priori precedence relationships among jobs.). However, the amount of computation required by the algorithm was not considered to be short if more than 50 jobs were processed. As an effort to improve the algorithm, the present paper modifies the implicit enumeration procedure in the algorithm so that moderately large problems can be treated with what appears to be a short computational time. Mainly this paper is concerned with improving the lower bound in the implicit enumeration procedure. The computational experiences with this new branch-and-bound algorithm are given.

• 국제학술발표논문집
• /
• The 4th International Conference on Construction Engineering and Project Management Organized by the University of New South Wales
• /
• pp.575-581
• /
• 2011

A novel approach for analysis of criticality with respect to path and to activity in networks with fuzzy activity durations is proposed. After recalling the Yager ranking method, the relative degree of criticality of activities and paths are defined. An efficient algorithm based on path enumeration to compute the relative degree of criticality of activities and paths in networks with fuzzy durations is proposed. Examples of former researches are employed to validate the proposed approach. The proposed algorithm has been tested on real world project networks and experimental results have shown that the algorithm can calculate the relative degree of criticality of activities and paths in a reasonable time.

• 산업경영시스템학회지
• /
• 제15권25호
• /
• pp.91-95
• /
• 1992

The aircraft schedule is the central of an airline's planning process, aimed at optimizing the deployment of airline's resources in order to maximize profits In this paper, the aircraft schedule is formulated as an integer programming model and the exact algorithm hared on enumeration method is proposed.

• Communications for Statistical Applications and Methods
• /
• 제16권2호
• /
• pp.229-238
• /
• 2009

범주형 자료분석을 위해 고려할 수 있는 모형들은 일반적으로 최우추정에 의하여 적합이 이루어지므로 이상값에 쉽게 영향을 받을 수 있다. 본 연구에서는 분할표 자료에 포함된 이상칸(outlying cell)에 영향을 받지 않는 최대 절삭우도 추정 값(maximum trimmed likelihood estimates)을 얻기 위한 추정 방법을 제안하였다. 제안된 방법은 우도에 의존하여 분할표에 포함된 칸을 제거해나가며 절사우도의 최대값을 찾기 때문에 완전탐색(complete enumeration)에 비해 계산의 양이 매우 적다. 따라서 일반적인 다차원 분할표 자료분석을 위해 쉽게 적용될 수 있다. 실제 자료분석 예를 통해 제안된 추정방법을 설명하였으며, 모의실험을 통해 문제점과 특징을 토론하였다.

• 한국지능시스템학회논문지
• /
• 제24권2호
• /
• pp.218-224
• /
• 2014

The logic-based scheduling language RCPSV may be used to model resource-constrained project scheduling problems with variants for minimizing the project completion time. A diagram-based, nonredundant enumeration algorithm for the RCPSV-problem is proposed and the correctness of the algorithm is proved.

• 융합보안논문지
• /
• 제13권1호
• /
• pp.11-17
• /
• 2013

본 논문에서는 MANET(Mobile Ad-hoc Network) 환경에서의 보안 요구사항과 DDoS(Distributed Denial of Service) 공격방지를 위한 보호노드(게이트웨이) 설정 알고리즘을 제시한다. 이를 위하여, 정보보호를 위한 기반 기술 및 네트워크 응용기술과 보안위협을 분석하고 MANET에서 필수적으로 요구되는 보안 요구사항을 제시하며, 송신과 수신노드 사이 정보전달시 DDoS 공격을 효과적으로 방어하기 위한 보호노드 설정 알고리즘을 제시하고 성능을 분석한다. 보호노드 설정시 보호노드와 수신노드들 사이의 총링크 비용의 최대값을 최소화하는 경우와 평균비용을 최소화하는 경우로 구분하여 성능을 분석하며, 각 알고리즘의 성능을 All Enumeration 기법을 이용하여 구한 최적해와 비교, 분석한다. 분석결과, 보호노드와 수신노드들 사이의 최대비용을 이용하는 경우보다 평균비용을 이용하여 보호노드를 설정하는 경우 송신과 수신 노드들 사이의 총비용이 최소화됨을 알 수 있다.

• 대한교통학회지
• /
• 제8권2호
• /
• pp.67-75
• /
• 1990

This paper treats the problem to schedule for trains with how transit priority so as to maximizing the number that can be sent during given time periods without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time Expanded Network without traverse time through application of Ford and Fulkerson Model and construct the Enumeration Algorithm for solutions using TENET Generator (TENETGEN). Finally, we compare our algorithm with Dinic's Maximal-Flow Algorithm and examine the avaliability of our procedures in personal computer.