• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.321-324
• /
• 2000

조합 최적화 문제인 Traveling Salesman problems(TSP)을 Genetic Algorithm(GA)[3]과 Local Search Heuristic Algorithm[8]을 이용하여 접근하는 것은 최적해를 구하기 위해 널리 알려진 방법이다. 본 논문에서는 TSP문제를 해결하기 위한 또 다른 접근법으로, 다수의 Ant들이 Tour들을 찾는 ACS(Ant Colony System) Algorithms[4][6][7]을 소개하고, ACS에서 Global Optima를 찾는 과정에서, 이미 이루어져 있는 Ant들의 Tour결과들을 서로 비교한다. Global Updating Rule에 의해 Global Best Tour 에 속해 있는 각 Ant Tour의 edge들을 update하는 ACS Algorithm에, 각 루프마다 Ant Tour들을 우성과 열성 인자들로 구분하고, 각각의 우성과 열성 인자들에 대해서 Global Updating Rule에 기반한 가중치를 적용(Weight Updating Rule)하므로서 기존의 ACS Algorithm보다 효율적으로 최적 해를 찾아내는 방법에 대해서 논하고자 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.36.3-36
• /
• 2001

Imitating animal behaviors is one of the research projects in robotics. This paper presents basic concepts and implementation of ant robots. Our ant robots refer to the robots that are designed and built by imitating ants´ behaviors. ant robot is 5${\times}$5${\times}$6 cm3. A special feature of our ant robot is low cost, we spend under 30 $US for this project.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2002.04a
• /
• pp.26-29
• /
• 2002

We describe a modified method for effectively pretreating soil highly contaminated with ANT or BaA (both initial Conc. are 500 mg/kg soil), i.e., we apply Fenton oxidation in which ethanol is added to increase ANT and BaA removal. At least 0.5 $m\ell$ or 0.75 $m\ell$ of ethanol were added to 1 g of artificially ANT or BaA-contaminated soils (i.e., alluvial and sandy soil), respectively. This was followed by Feton oxidation in which various amounts of $H_2O$$_2$ and Fe$^{2+}$ were added. The results showed more than 98 % of ANT or BaA removal efficiency However less than 10 % of ANT and BaA removal efficiency was obtained in addition of distilled water or sodium dodecy1 sulfate. Additionally, we employ GC-MS to identify the main oxidation product generated by the optimized Fenton reaction [i.e., ANT or BaA degraded in to 69-73% 9,10-anthracenedione (ANTDI) or 43-51% 7,12-benz(a)anthracenedione (BaADI), respectively]. The biodegradability of ANTDI or BaADI are subsequently confirmed to be much more rapid than that of ANT or BaA, respectively, results suggesting that Fenton oxidation with ethanol-microbial treatment can be effectively applied to remove ANT or BaA from soil.l.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.3
• /
• pp.1-7
• /
• 2019

It is one of the known methods to obtain the optimal solution using the Ant Colony Optimization Algorithm for the Traveling Salesman Problem (TSP), which is a combination optimization problem. In this paper, we solve the TSP problem by proposing an improved new ant colony optimization algorithm that combines genetic algorithm mutations in existing ant colony optimization algorithms to solve TSP problems in many cities. The new ant colony optimization algorithm provides the opportunity to move easily fall on the issue of developing local optimum values of the existing ant colony optimization algorithm to global optimum value through a new path through mutation. The new path will update the pheromone through an ant colony optimization algorithm. The renewed new pheromone serves to derive the global optimal value from what could have fallen to the local optimal value. Experimental results show that the existing algorithms and the new algorithms are superior to those of existing algorithms in the search for optimum values of newly improved algorithms.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.369-374
• /
• 2003

Ant Algorithm is used to find the solution of Combinatorial Optimization Problems. Real ants are capable of finding the shortest path from a food source to their nest without using visual informations. This behavior of real ants has inspired ant algorithm. There are various versions of Ant Algorithm. Ant Colony System (ACS) is introduced lately. ACS is applied to the Traveling Salesman Problem (TSP) for verifying the availability of ACS and evaluating the performance of ACS. ACS find a good solution for TSP When ACS is applied to different Combinatorial Optimization Problems, ACS uses the same parameters and strategies that were used for TSP. In this paper, ACS is applied to the Multicast Routing Problem. This Problem is to find the paths from a source to all destination nodes. This definition differs from that of TSP and differs from finding paths which are the shortest paths from source node to each destination nodes. We introduce parameters and strategies of ACS for Multicasting Routing Problem.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.414-424
• /
• 2013

We consider a new load balancing routing for delay-guaranteed services in the network in which the traffic is dynamic and network topologies frequently change. For such an ever-changing network, we propose a new online load balancing routing called AntLBR, which exploits the ant colony optimization method. Generally, to achieve load balancing, researchers have tried to calculate the traffic split ratio by solving a complicated linear programming (LP) problem under the static network environment. In contrast, the proposed AntLBR does not make any attempt to solve this complicated LP problem. So as to achieve load balancing, AntLBR simply forwards incoming flows by referring to the amount of pheromone trails. Simulation results indicate that the AntLBR algorithm achieves a more load-balanced network under the changing network environment than techniques used in previous research while guaranteeing the requirements of delay-guaranteed services.

• Journal of Science and Technology Studies
• /
• v.12 no.1
• /
• pp.145-183
• /
• 2012

Science reporting is easier to lead to failure than other news reporting because it needs higher professionalism. According to Actor-Network Theory(ANT), not only research results(artifacts) of scientists but also science articles are hybrid networks. Namely, they are connected by human actors(scientist, reporter, etc.) and nonhuman actors(press releases etc.). When the process of science reporting is examined on the view of ANT, it is the process that scientists' results translate the media via press releases as intermediaries and expand their network to the public. This study aims at making an ANT analysis of how research results of Electronics and Telecommunications Research Institute(ETRI) scientist Hyun-Tak Kim were reported by lots of media, focusing on the rhetoric of ETRI's press release. It can reveal the reason for the science reporting's failure and hint at the better science journalism.

• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.396-400
• /
• 2009

During periods of large data transmission, routing selection methods are used to efficiently manage data traffic and improve the speed of transmission. One approach in routing selection is AntNet that applies the Ant algorithm in transmissions with uniform probability. However, this approach uses random selection, which can cause excessive data transmission rates and fail to optimize data This paper presents the use of the Genetic Algorithm (GA) to efficiently route and disperse data transmissions, during periods with "unnecessary weight increases for random selection". This new algorithm for improved performance provides highly accurate estimates of the transmission time and the transmission error rate.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.1-10
• /
• 2023

The purpose of this study is to explore ways to nurture creative and fusion-type talents centered on ANT. In order to nurture creative and convergence-type talents centered on ANT, first, it is necessary to utilize Kao's Law in the network formation stage. Second, it is necessary to utilize the strong power of weak ties in the network formation stage. Third, in order to cause a stir in the stage of raising questions among the four stages of translation, the ability to ask questions must be developed. Fourth, education in various creative problem-solving techniques is needed to throw a stir. Fifth, in order to successfully intervene in the second stage of the four stages of translation, the stage of attracting attention, communication and critical thinking skills must be trained. Suggestions for follow-up research are: First, it is necessary to compare and analyze the four stages of translation and the stage of the creative problem-solving model presented by ANT. Second, it is expected that there will be follow-up studies that apply specific cases centering on ANT.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.185-194
• /
• 2008

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop an ant algorithm based on routing mechanism for finding the multiple shortest paths within limited time in real traffic network. The proposed ant algorithm finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn until an acceptable solution is reached. This method can consider traffic constraints easily comparing to the conventional shortest paths algorithms.