• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.1
• /
• pp.1-8
• /
• 2010

This paper presents global and optimal solution for weapon assignment problems using the Munkres assignment algorithm. We propose a new modeling method of weapon assignment problems concerning some constraints of weapon systems. In this paper, we compares the Munkres weapon assignment algorithm with two other algorithms employing a search tree model in terms of computational complexity and performance. One is an optimal algorithm using exhausted search and the other is a greedy algorithm which selects the first search result as a solution. The experiment results show that the Munkres weapon assignment algorithm has better performance and less computational complexity in comparison with the two other algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.93-101
• /
• 2013

This paper suggests optimal location algorithm of new firm $A(F_A)^{\prime}s$ p(p$B(F_B)$ already operating q outlets of sports in the market. This algorithm selects top q nodes among $V=V{\backslash}F_B$ nodes that covers maximum nodes based on the shortest distance. Then, q nodes choose next node that has a maximum cover with inclusion-exclusion principle. At the time of same number of cardinality in q sets to pre-defined q, we select the maximum cover node set. This algorithm called by competitive algorithm. The competitive algorithm simply decides the optimal location of the outlets p=1,2,3,4 for q=5. Also, we show that the market share of competitive algorithm can be maximize.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.221-226
• /
• 2004

Ant Colony System(ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign to color for adjacency node($v_i, v_j$) that they has not same color. In this paper introducing ANTCOL Algorithm that is method to solve solution by Ant Colony System algorithm that is not method that it is known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, show the wav how to apply ACS to solve ATP And compare graph coloring result and execution time when use existent generating functions(ANT_Random, ANT_LF, ANT_SL, ANT_DSATUR, ANT_RLF method) with ANT_XRLF method that use XRLF that apply Randomize to RLF to solve ANTCOL. Also compare graph coloring result and execution time when use method to add re-search to ANT_XRLF(ANT_XRLF_R) with existent generating functions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.950-975
• /
• 2016

Device-to-Device (D2D) communication underlaying cellular networks is a promising add-on component for future radio communication systems. It provides more access opportunities for local device pairs and enhances system throughput (ST), especially when mobile relays (MR) are further enabled to facilitate D2D links when the channel condition of their desired links is unfavorable. However, mutual interference is inevitable due to spectral reuse, and moreover, selecting a suitable transmission mode to benefit the correlated resource allocation (RA) is another difficult problem. We aim to optimize ST of the hybrid system via joint consideration of mode selection (MS) and RA, which includes admission control (AC), power control (PC), channel assignment (CA) and relay selection (RS). However, the original problem is generally NP-hard; therefore, we decompose it into two parts where a hierarchical structure exists: (i) PC is mode-dependent, but its optimality can be perfectly addressed for any given mode with additional AC design to achieve individual quality-of-service requirements. (ii) Based on that optimality, the joint design of MS, CA and RS can be viewed from the graph perspective and transferred into the maximum weighted independent set problem, which is then approximated by our greedy algorithm in polynomial-time. Thanks to the numerical results, we elucidate the efficacy of our mechanism and observe a resulting gain in MR-aided D2D communication.