• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.95-105
• /
• 2003

Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4788-4813
• /
• 2019

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field $GF(p^m)$ using graph and automata to design the data hiding scheme of the general form ($k,N,{\lfloor}{\log}_2p^{mn}{\rfloor}$) for binary, gray and palette images with the given assumptions, where k, m, n, N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.10-21
• /
• 2008

User travel behavior is based on the existence of complete traffic information in deterministic user optimal principle by Wardrop(1952). According to deterministic user optimal principle, users choose the optimal route from origin to destination and they change their routes arbitrarily in order to minimize travel cost. In this principle, users only consider travel time as a factor to take their routes. However, user behavior is not determined by only travel time in actuality. Namely, the models that reflect only travel time as a route choice factor could give irrational travel behavior results. Therefore, the model is necessary that considers various factors including travel time, transportation networks structure and traffic information. In this research, more realistic deterministic optimal traffic assignment model is proposed in the way of route recognizance behavior. This model assumes that when users decide their routes, they consider many factors such as travel time, road condition and traffic information. In addition, route recognizance attributes is reflected in this suggested model by forward searching method and backward searching method with numerical formulas and algorithms.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.1-12
• /
• 1996

This paper deals with production scheduling of block assembly shop in shipbuilding company. The Objectives of the schedule are leveling of daily total workload and fair assignment of workload to each department of the shop. Optimizing the objectives, we consider some restrictions which consisit of block due dates, workability of each department, and space restriction. We formulate the problem in mathematical form. But the model is too complex to find the optimal solution (the problem is NP-complete) and we use the genetic algorithm to find a good solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.884-889
• /
• 1989

In this paper, a new procedure for selecting weighting matrices in linear discrete time quadratic optimal control problem (LQ-problem) is proposed. In LQ-problems, the quadratic weighting matrices are usually decided on trial and error in order to get a good response. But using the proposed method, the quadratic weights are decided in such a way that all poles of the closed loop system are located in a desired region for good responses as well as for stability and values of the quadratic cost function are kept less then a specified value.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1641-1646
• /
• 2006

This paper deals with a physical access network design problem arising from the deployment of fiber-to-the-home passive optical networks (FTTH-PON). The problem seeks to find an optimal location and capacity assignment of splitters in the network such that the total cost of fiber and splitter is minimized, while satisfying all the demand. We propose tabu search approach for finding a good feasible solution.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.703-705
• /
• 1999

셀룰러 네트워크에서의 효율적인 채널 할당 문제는 통신자원의 사용을 최적화하려는 의도에서 여러 연구자들에 의해 최근 활발히 연구되고 있다. 셀룰러 네트워크는 셀을 나타내는 노드들로 이루어진 삼각형의 격자모양의 그래프로 모델 되어지며, 셀룰러 네트워크에서의 채널할당 문제는 그래프에서의 컬러링 문제로 바꿔질 수 있다. 본 논문에서는 셀룰러 네트워크에서의 최적의 채널 할당 알고리즘을 제안하며, 셀의 수가 N일 때 시간 복잡도가 O(N)인 알고리즘이다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.289-298
• /
• 1995

We consider a general queueing network with multi-server stations. The stations are under heavy traffics or moderate variable conditions. We develope an algorithm to determine the optimal loading policy, which minimizes the congestion in a network. Under more specified condition, majorization and arrangement orderings are established to compare, respectively, various loading and assignment policies. Implications of results are also discussed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.753-770
• /
• 1996

In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location. And a heuristic rule is suggested in order to overcome computational difficulties of the optimization model. The performance of the rule is evaluated by comparing it with the result of DP model.

• IE interfaces
• /
• v.11 no.3
• /
• pp.23-40
• /
• 1998

In this paper, a method to determine the optimal configuration of operating policies in an integrated-automated manufacturing system using the Taguchi method and computer simulation experiments is presented. An integrated-automated manufacturing system called direct-input-output manufacturing system(DIOMS) is described. We only consider the operational aspect of the DIOMS. Four operating policies including input sequencing control, dispatching rule for the storage/retrieval(S/R) machine, machine center-based part type selection rule, and storage assignment policy are treated as design factors. The number of machine centers, the number of part types, demand rate, processing time and the rate of each part type, vertical and horizontal speed of the S/R machine, and the size of a local buffer in the machine centers are considered as noise factors in generating various manufacturing system environment. For the performance characteristics, mean flow time and throughput are adopted. A robust design experiment with inner and outer orthogonal arrays are conducted by computer simulation, and an optimal configuration of operating policies is presented which consists of a combination of the level of each design factor. The validity of the optimal configurations is investigated by comparing their signal-to-noise ratios with those obtained with full factorial designs.