• Journal of Korean Society of Transportation
• /
• v.26 no.2
• /
• pp.89-100
• /
• 2008

In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

• Journal of the military operations research society of Korea
• /
• v.34 no.2
• /
• pp.63-77
• /
• 2008

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. Hierarchical network design using genetic algorithm is the first three-tier (Macro, Micro, Pico) model. We increase the reality through applying to Electromagnetic Compatibility Constraints. Computational experiments on 72 problem instances which have $15{\sim}40$ candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers 90% of the demand.

• Journal of Korea Game Society
• /
• v.17 no.4
• /
• pp.137-148
• /
• 2017

Since the power consumption of data centers is large and computer serves take a large portion of it, there have been much research on the power saving of servers in various ways recently. Among the units of severs CPU is one of major power consuming units. In this paper, a method of client-server assignment for minimizing the CPU power consumption of servers in a game server cluster is proposed. We model the client-server assignment problem as an optimization problem, and find a solution to the problem using a simulated annealing-based technique. One of major features of our method is to select a proper operating frequency according to the amount of load on a server. The selection of a lower frequency in case of low load will result in reducing power consumption. To our survey, little research on client-server assignment in consideration of power consumption has been carried out.

• IE interfaces
• /
• v.18 no.4
• /
• pp.504-511
• /
• 2005

The NP-hard channel assignment problem becomes more and more important to use channels as efficiently as possible because there is a rapidly growing demand and the number of usable channel is very limited. The hybrid genetic and local search (HGLS) method in this paper is a hybrid method of genetic algorithm with no interference channel assignment (NICA) in clustering stage for diversified search and local search in tuning stage when the step of search is near convergence for minimizing blocking calls. The new representation of solution is also proposed for effective search and computation for channel assignment.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.159-176
• /
• 1991

The probability of target survival is the most important factor in the target assignment, Most of the studies about it have assumed the case of one target and ane weapon type. Therefore, they can not be applied to the real situation. In this paper. the quantity and type of enemy assets of the friendly force are considered simultaneously. Considered defense type is the coordinated defense with no impact point prediction. The objective function is to minimize the expected total survival value of targets which are scattered in the defense area. The rules of aircraft assignment are as follows : first, classify targets into several groups, each of those has the same desired damage level secondly. select the critical group which has the least survival value in accordance with the additional aircraft assignment, and finally. assign the same number of attack assets against each target in the critical group. In this paper, the attack assets, the escort assets, and the defense assets are considered. The model is useful to not only the simple aircraft assignment problem but also the complicated wargame models.

• IE interfaces
• /
• v.19 no.2
• /
• pp.160-167
• /
• 2006

It is a crucial managerial issue how to manage assembly blocks at shipyard. Based on the project experience in Hyundai Heavy Industries, this study points out the difficulties on the block stockyard operations, formalizes the JIBUN (location) assignment problem for assembly blocks, and develops the JIBUN (location) assignment algorithm whose purpose is to reduce the number of unproductive block moves. Through simulation experiments for various situations, this study demonstrates the usefulness of JIBUN (location) assignment algorithm. In addition, this study examines the impacts of block move sequence rules and of block stockyard layouts on the block stockyard operations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2362-2378
• /
• 2017

To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.257-266
• /
• 2012

This paper overviews clock design problems related to the circuit reliability in deep submicron design technology. The topics include the clock polarity assignment problem for reducing peak power/ground noise, clock mesh network design problem for tolerating clock delay variation, electromagnetic interference aware clock optimization problem, adjustable delay buffer allocation and assignment problem to support multiple voltage mode designs, and the state encoding problem for reducing peak current in sequential elements. The last topic belongs to finite state machine (FSM) design and is not directly related to the clock design, but it can be viewed that reducing noise at the sequential elements driven by clock signal is contained in the spectrum of reliable circuit design from the clock source down to sequential elements.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.