• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.201-207
• /
• 2018

There is no known polynomial time algorithm for random-type quadratic assignment problem(RQAP) that is a NP-complete problem. Therefore the heuristic or meta-heuristic approach are solve the approximated solution for the RQAP within polynomial time. This paper suggests polynomial time algorithm for random type quadratic assignment problem (QAP) with time complexity of $O(n^2)$. The proposed algorithm applies one-to-one matching strategy between ascending order of sum of distance for each location and descending order of sum of quantity for each facility. Then, swap the facilities for reflect the correlation of distances of locations and quantities of facilities. For the experimental data, this algorithm, in spite of $O(n^2)$ polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• 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.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.3
• /
• pp.419-429
• /
• 2005

This paper considers eigenstructure assignment in high-order linear systems via proportional plus derivative feedback. It is shown that the problem is closely related with a type of so-called high-order Sylvester matrix equations. Through establishing two general parametric solutions to this type of matrix equations, two complete parametric methods for the proposed eigenstructure assignment problem are presented. Both methods give simple complete parametric expressions for the feedback gains and the closed-loop eigenvector matrices. The first one mainly depends on a series of singular value decompositions, and is thus numerically very simple and reliable; the second one utilizes the right factorization of the system, and allows the closed-loop eigenvalues to be set undetermined and sought via certain optimization procedures. An example shows the effect of the proposed approaches.

• 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.10 no.16
• /
• pp.133-141
• /
• 1987

Man-machine assignment problem with random service and processing times is considered in this paper. Assuming heterogeneous semi-automatic machines, the problem is dealt with as follow; 1. For the different type of machines that have probabilistics distribution of processing time and nan service time, man·machine assignment problem is solved by heuristic method using expected time value if machine. 2. Since each related time is a random variable, the performance of the optimal assignment obtained from the above method is verified through monte carlo simulation method. 3. The above procedures are programed by BASIC language to use easily and rapidly in the personal computer. The result of this study can contribute to productivity enhancement by increasing the efficiencies of both operators and machines.

• Journal of Korean Port Research
• /
• v.9 no.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.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.51-55
• /
• 2005

Assuring integrity of permission assignment (PA) constraints is a difficult task in role-based access control (RBAC) because of the large number of constraints, users, roles and permissions in a large enterprise environment. We provide solutions for this problem using the conflict concept. This paper introduces the conflict model in order to understand the conflicts easily and to detect conflicts effectively. The conflict model is classified as a permission-permission model and a role-permission model. This paper defines two type conflicts using the conflict model. The first type is an inter-PA-constraints (IPAC) conflict that takes place between PA constraints. The other type is a PA-PAC conflict that takes place between a PA and a PA constraint (PAC) Also, the conditions of conflict occurrence are formally specified and proved. We can assure integrity on permission assignment by checking conflicts before PA and PA constraints are applied.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.91-99
• /
• 2014

TThis paper suggests an heuristic polynomial time algorithm to solve the optimal solution for QAP (quadratic assignment problem). While Hungarian algorithm is most commonly used for a linear assignment, there is no polynomial time algorithm for the QAP. The proposed algorithm derives a grid type layout among unit distances of a distance matrix. And, we apply max-flow/min-distance approach to assign this grid type layout in such a descending order way that the largest flow is matched to the smallest unit distance from flow matrix. Evidences from implementation results of the proposed algorithm on various numerical grid type QAP examples show that a solution to the QAP could be obtained by a polynomial algorithm.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.29-36
• /
• 2013

This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.3
• /
• pp.441-453
• /
• 2017

In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.