• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.1222-1230
• /
• 2010

This study is about developing a transit assignment model on railway network. Current transit assignment models are mainly focused on road or urban transportation so that these models, for example, transit assignment model based on optimal strategy generates unrealistic transit assignment. Especially, since the advent of KTX, more passengers are using the transfer route containing KTX but most transit assignment models have a shortcoming that transfer is not considered or is overestimated. We present a new stochastic transit assignment model based on LOGIT considering transfer resistance.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.5
• /
• pp.653-659
• /
• 2006

The design of $H_2$-optimal control with regional pole assignment via state feedback in linear time-invariant systems is investigated. The aim is to find a state feedback controller such that the closed-loop system has the desired eigenvalues lying in some desired stable regions and attenuates the disturbance between the output vector and the disturbance vector. Based on a proposed result of parametric eigenstructure assignment via state feedback in linear systems, the considered $H_2$-optimal control problem is changed into a minimization problem with certain constraints, and a simple and effective algorithm is proposed for this considered problem. A numerical example and its simulation results show the simplicity and effectiveness of this proposed algorithm.

• Journal of the Korean Institute of Navigation
• /
• v.13 no.1
• /
• pp.55-61
• /
• 1989

Nowadays much efforts for evaluating the productivity of port physical distribution system to meet the rapid change of the port and shipping circumstances has been made continuously all over the world. The major part of these efforts is the improvement of the productivity of cargo handling system. The cargo equipment system as infrastructure in the cargo handling system is organized well in some degrees, but the management system of manpower as upper structure is still remained in an insufficient degree. There is little study, so far, on a systematic research for the management of port labor gang, and even those were mainly depended on rule of thumb. The object of this study is to introduce the method of optimal allocation and assignment for the labor gang in single ship, which was suggested as a first stage in dealing with them generally. The problem of optimal allocation and assignment of the labor gang can be (I) formalized with multi-stage allocation and assignment of the labor gang can be. (II) dealt with two stages in form of hierarchic structure and moreover, (III) The optimal size of labor gang was obtained through dynamic programming from the point of minimizing the summation of labor gang in every stage, (IV) For the problem of optimal assignment, the optimal policy was determined at the point of minimizing the summation of movement between hatches.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.62-65
• /
• 1989

Optimizing transient response for both tracking reference signals and disturbance rejection is determined by the poles and zeros of the transfer function. Thus, optimal pole assignment and how should weighting matrix for the performance index be chosen is very important to achieve optimum transient response. This paper focus its attention on the choosing and analysis of weighting matrix for optimum pole assignment. Optimum pole assignment is defined for linear time-invariant continuous systems.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.407-410
• /
• 1989

Optimizing transient response for both tracking reference signals and disturbance rejection is determined by the poles and zeros of the transfer function. Thus, optimal pole assignment and how should weighting matrix for the performance index be chosen is very important to achieve optimum transient response. This paper focus its attention on the choosing and analysis of weighting matrix for optimum pole assignment. Optimum pole assignment is defined for linear time-invariant continuous systems.

• Communications of the Korean Mathematical Society
• /
• v.17 no.4
• /
• pp.719-729
• /
• 2002

Consider the random n $\times$ m assignment problem with m $\geq$ $_{i,j}$ Let $u_{i,j}$ be iid uniform random variables on [0, 1] and exponential random variables with mean 1, respectively, and let $U_{n, m}$ and $T_{n, m}$ denote the optimal assignment costs corresponding to $u_{i, j}$ and $t_{i, j}$. In this paper we first give a comparison result about the discrepancy E $T_{n, m}$ -E $U_{n, m}$. Using this comparison result with a known lower bound for Var( $T_{n, m}$) we obtains a lower bound for Var( $U_{n, m}$). Finally, we study the way that E $U_{n, m}$ and E $T_{n, m}$ vary as m does. It turns out that only when m - n is large enough, the cost decreases significantly.tly.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.502-506
• /
• 2008

The recently proposed "Potential-based" reinforcement learning (RL) method made it possible to combine multiple learnings and expert advices as supervised knowledge within an RL framework. The effectiveness of the approach has been established by a theoretical convergence guarantee to an optimal policy. In this paper, the potential-based RL method is applied to a dynamic channel assignment (DCA) problem in a cellular networks. It is empirically shown that the potential-based RL assigns channels more efficiently than fixed channel assignment, Maxavail, and Q-learning-based DCA, and it converges to an optimal policy more rapidly than other RL algorithms, SARSA(0) and PRQ-learning.

• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.1-14
• /
• 2004

In this paper, we propose a new data-mining-based methodology for military occupational specialty assignment. The proposed methodology consists of two phases, feature selection and man-power assignment. In the first phase, the k-means partitioning algorithm and the optimal variable weighting algorithm are used to determine attribute weights. We address limitations of the optimal variable weighting algorithm and suggest a quadratic programming model that can handle categorical variables and non-contributory trivial variables. In the second phase, we present an integer programming model to deal with a man-power assignment problem. In the model, constraints on demand-supply requirements and training capacity are considered. Moreover, the attribute weights obtained in the first phase for each specialty are used to measure dissimilarity. Results of a computational experiment using real-world data are provided along with some analysis.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.506-513
• /
• 2002

Distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks. An assignment method of the optimal period of each loop and a heuristic assignment rule of each message's priority are proposed and the integrated scheduling method is developed based on them.