• 지능정보연구
• /
• 제6권1호
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• 제어로봇시스템학회논문지
• /
• 제11권2호
• /
• pp.144-151
• /
• 2005

We propose an optimization method to reduce the assembly time of chip mounters. Feeder arrangement and assembly sequence are determined considering the multiple feeder assignment. The problem is divided into two sub-problems: feeder arrangement problem and assembly sequence problem. We present mathematical model for each sub-problem. The clustering algorithm and assignment algorithm are applied to solve the feeder arrangement problem. The assignment algorithm and connection algorithm are applied to solve the assembly sequence problem. Simulation results are then presented to verity the usefulness of the proposed method.

• 한국컴퓨터정보학회논문지
• /
• 제20권8호
• /
• pp.105-112
• /
• 2015

Generally, the optimal solution of assignment problem has been obtained by Hungarian algorithm with O($n^3$) time complexity. This paper proposes more simple algorithm with O($n^2$) time complexity than Hungarian algorithm. The proposed algorithm simply selects minimum cost in each row, and classified into set S, H, and T. Then, the minimum cost is moved from S to T and $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm can be obtain the same optimal solution as well-known algorithms and improve the optimal solution of partial unbalanced assignment problems.

• 한국컴퓨터정보학회논문지
• /
• 제24권5호
• /
• pp.19-26
• /
• 2019

In this paper, we consider the D2D Transmitter(Tx) and Receiver(Rx) pair assignment problem in the cellular system. Sharing the resource of the cellular system, D2D users may cause interference to the cellular system, though it is beneficial to improve the D2D user Capacity. Therefore, to protect the cellular users, D2D transmit power should be carefully controlled. Previously, optimal Tx-Rx assignment to minimize the total transmit power of users was investigated. Accordingly, the iterative algorithm to find the optimum Tx-Rx asignment was obtained. In this work, we consider the case where Tx group users becomes Rx group users, and Rx group users become Tx group users. We prove that the Tx-Rx assignment problem has the duality property. We present the numerical examples that show the duality between U-link and D-link.

• 한국항만학회지
• /
• 제9권2호
• /
• pp.1-8
• /
• 1995

Generally, berth assignment problem has conflicting factors according to the interested parties. In the view of shipping company, it is desirable that berth assignment is made according to the order of arrival. But in the view of port operator, it is better to be assigned regardless the order of arrival to promote the efficiency of berth operation. Thus, it is necessary to establish berth assignment planning which reflects both of interests in a practical situation. This paper aims to develop a reasonable berth assignment algorithm in a container terminal by considering the prescribed factors, and suggests three types of models minimizing the objective functions such as total port staying time, total mooring time and total maximum mooring time by using MPS concept. These models are formulated by 0-1 integer programming and min-max type function, but as the number of variables increases, an optimal solution cannot be achieved easily within a desired computational time. Thus, to tackle this problem this paper proposes a heuristic algorithm, and also the heuristic algorithm proposed in this paper is verified through the several examples.

• Asian-Australasian Journal of Animal Sciences
• /
• 제20권1호
• /
• pp.25-30
• /
• 2007

The capability of microsatellite markers for individual identification and their potential for breed assignment of individuals was evaluated in two Indian horse breeds. The strength of these individual assignment methods was also evaluated by increasing the number of loci in increments of five. The probability of identity of two random horses from the two breeds at all twenty five studied loci was as low as $1.08{\times}10^{-32}$ showing their suitability to distinguish between individual horses and their products. In the phylogenetic approach for individual assignment using Nei's genetic distances, 10.81% of horses associated with breed other than the major cluster of the source breed horses when all twenty five microsatellite loci were implemented. Similar results were obtained when the maximum likelihood approach for individual assignment was used. Based on these results it is proposed that, although microsatellite markers may prove very useful for individual identification, their utility for breed assignment of horses needs further evaluation.

• 무역상무연구
• /
• 제49권
• /
• pp.89-109
• /
• 2011

Among various export financing, forfaitng and factoring give a comfort to exporters as those special financing schemes are extended to them on a without recourse basis. This is good for the exporters in terms of financing and risk cover of buyer or LC issuing banks. To enjoy this benefit, the SME exporters should, however, know the risks involved in sales contract. For example, if the export and importer set Korean law as governing law in the sales contract especially for open account exports, the exporter's receivables might be not welcome by factors according to provisions of Korean Conflict Law and it's application. Those regulations tell that the factor's position would be unstable when the sales contact limit exporter's assignment of receivables to the factor when the sales contract is subject to Korean law. Also the exporters should know related regulation of importer which might affect the assignment of receivables as well. This paper suggests the Korean exporters take internationally recognized agreement/convention such as UNI|DROIT Convention on International Factoring, UN Convention on the Assignment of Receivables in International Trade.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.288-300
• /
• 2006

In this paper, we consider a channel ordering problem that seeks to minimize the total interference in mobile radio networks. If a base station receives connection request from a mobile user, one of the empty channels that are fixed to the base station is assigned to the mobile user. Among several channels available, we can choose one that seems to make least interference with other channels assigned to adjacent base stations. However, a pair of channels that are not separated enough do not generate interference if both of them are not simultaneously used by mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference costs are properly generated.

• 한국철도학회논문집
• /
• 제14권3호
• /
• pp.276-284
• /
• 2011

본 연구는 철도 네트워크에서의 통행배정 모형에 관한 것이다. 기존의 통행배정모형은 주로 도로 혹은 도시 대중교통 네트워크에 초점을 둔 연구로서, 최적전략 기반 통행배정 모형을 비롯한 대부분의 통행배정 모형 이 지역간 철도 네트워크에 대해서는 비현실적인 수요를 생성한다고 알려져 있다. 특히 KTX개통 이후, KTX가 포함된 환승경로를 이용하는 승객이 점차 증가하는 추세이며, 이러한 KTX가 포함된 환승 경로 및 스케줄이 지속적으로 개선되고 있다. 본 연구는 환승을 고려한 새로운 다항로짓 기반 통행배정 모형을 제시한다. 특히 본 연구에서 제시하는 모형은, 통행 시간, 경로의 최소 운행횟수, 환승 저항 등 다양한 변수가 포함된 효용함수가 주어져 있을 때, K개의 최대 효용을 갖는 경로를 탐색하는 알고리즘을 포함하고 있다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권5호
• /
• pp.502-506
• /
• 2008

최근에 제안된 강화 학습 기법인 "potential-based" reinforcement learning(RL) 기법은 다수 학습들과 expert advice들을 감독 지식으로 강화 학습 알고리즘에 융합하는 것을 가능하게 했고 그 효용성은 최적 정책으로의 이론적 수렴성 보장으로 증명되었다. 본 논문에서는 potential-based RL 기법을 셀룰러 네트워크에서의 채널 할당 문제에 적용한다. Potential-based RL 기반의 동적 채널 할당 기법이 기존의 fixed channel assignment, Maxavail, Q-learning-based dynamic channel assignment 채널 할당 기법들보다 효율적으로 채널을 할당한다. 또한, potential-based RL 기법이 기존의 강화 학습 알고리즘인 Q-learning, SARSA(0)에 비하여 최적 정책에 더 빠르게 수렴함을 실험적으로 보인다.