Reassembling ANT into ‘ANT-IR’: The Concept of Translation within International Relations Context
1
Citation
0
Reference
10
Related Paper
Citation Trend
Abstract:
국제정치이론은 시대가 흐름에 따라 변화의 압력에 놓인다. 국제정치는 국가들 사이에서 이루어지는 관계를 다루는 학문으로, 그것이 지니는 복잡한 현상으로 인하여 이를 국가와 구조로 구분하여 사고하는 조류가 지배적이었다. 한편으로 이러한 접근은 갈수록 심화되는 국제정치의 복잡한 성격을 충분히 반영하지 못하고 있다는 비판에 직면하고 있다. 본 연구는 이러한 한계를 보완하기 위해 대두된 분석틀의 일종인 행위자-네트워크 이론(ANT)을 국제정치 분석에 정착시킬 방법을 모색한다. 본 이론은 이미 국제정치를 분석하기 위한 수단으로 활용되어 온 바 있으며, 이 연구의 문제의식은 그것이 지니는 분석 수단으로서의 효과성을 검토하기 위함이 아니다. 본 연구의 문제의식은 행위자-네트워크 이론을 국제정치에 활용하는 연구가 기존의 사회학적 접근을 원용하는데 그치고 있는 현실을 향하며, 이에 따라 동 이론의 핵심개념인 번역을 국제정치에 보다 적합한 형태로 재구성하는 작업을 시도한다.본 연구는 번역 개념의 재구성을 위하여 관계주의적 권력 개념을 활용한다. 관계주의적 권력 개념이란 행위하는 네트워크(Actor-Network)인 국가들 사이의 관계에 변화를 초래하는 권력을 의미하며, 이는 번역이 지니는 권력 투사 과정으로서의 성격을 고려한 것이다. 이러한 작업은 기존의 이론들이 다루고 있는 권력 개념들 사이의 차이를 극복하여 메타 이론적 접근을 가능케 하는 한편, 행위자-네트워크 이론의 번역 개념을 새롭게 정의함으로써 동 이론의 국제정치학적 변용(ANT-IR)을 가능케 하는 출발점이 될 수 있을 것이다.
Keywords:
Ant colony
Ant colony
Cite
Citations (0)
Improving the intelligent bionic ant colony model will require multidisciplinary research,and so its development will promote progress in related subjects.The ant colony model,a new intelligent bionic model which mimics the behavior of an ant colony,has progressed substantially in the last ten years.However,there has been no systematic study of this field in China.To encourage more research this paper gives a detailed introduction to several major ant colony models according to their underlying bionic principles and simulation methods.The latest developments in this field are also described.Then,typical applications of ant colony models are summarized,and new areas where they can be used are presented.Finally,comparisons are made between the ant colony algorithm,the particle swarm optimization algorithm,the immune algorithm,and the evolutionary algorithm.The similarities and differences between these algorithms are pointed out.This comprehensive introduction should promote research on ant colony algorithms in China.
Ant colony
Swarm intelligence
Parallel metaheuristic
Cite
Citations (0)
In this paper, the continuous Ant Colony Optimization Algorithm (ACOR) is used to investigate the optimum operation of complex multi-reservoir systems. The results are compared with those of the well-known Genetic Algorithm (GA). For this purpose, GA and ACOR are used to solve the long-term operation of a three-reservoir system in Karkheh Basin, southwestern Iran. The solution must determine monthly releases from the three reservoirs and their optimum allocations among the four agricultural demand areas. Meanwhile, a minimum discharge must be maintained within the river reaches for environmental concerns. Review of past research shows that only a few applications of Ant Colony have been generally made in water resources system problems; however, up to the time of initiating this paper, we found no other application of the ACOR in this area. Therefore, unlike GA, application of Ant-Colony-based algorithms in water resources systems has not been thoroughly evaluated and deserves serious study. In this paper, the ACOR is stuided as the most recent Ant-Colony-based algorithm and its application in a multi-reservoir system is evaluated. The results indicate that with when the number of decision variables increases, a longer computational time is required and the optimum solutions found are inferior. Therefore, the ACOR would be unable to solve complex water resources problems unless some modifications are considered. To overcome a part of these drawbacks, a number of techniques are introduced in this paper that considerably improve the quality of the method by decreasing the required computation time and by enhancing optimum solutions found.
Ant colony
Cite
Citations (5)
Multi-level ant system - a new approach through the new pheromone update for ant colony optimization
Ant Colony Optimization (ACO) is a meta-heuristic approach inspired by the study of the behavior of real ant colonies when finding the shortest path from their nest to food source. ACO has been used for solving approximately NP-hard problems and its elite effects has been proved by the experiments. Currently, two famous ACO algorithms are Ant Colony System (ACS) and Max-Min Ant System (MMAS) proposed by M.Dorigo and T.Stutzle. In this paper, we introduce the idea about Multi-level Ant System (MLAS) and its application as an improved version of Max-Min Ant System through a novel pheromone updating scheme. We applied the new algorithm to the well-known combinatorial optimization problems such as Traveling Salesman Problem, in which we compared the results of the new algorithm with that of MMAS algorithms. Experimental results based on the standard test data showed that MLAS algorithm is more effective than MMAS in term of both the average and the best solution.
Ant colony
Formicoidea
Cite
Citations (5)
Many studies have focused in designing a set of good DNA sequences as it is one of the crucial tools in improving the reliability and efficiency of DNA computing. In this paper, an improved model of Ant Colony System is developed in optimizing DNA sequences design. The proposed model suggests that each artificial ant represents a possible solution of the DNA sequences design problem. This differs from the previous Ant Colony System approached where a number of artificial ants are required to represent a possible solution. In the implementation, four objective measures and two constraint measures are employed to obtain a good set of DNA sequences. The performance of the proposed model is evaluated by comparing the result with existing Ant Colony System model and other published sequence design method. The experimental result shows that the proposed Ant Colony System model outperformed the existing Ant Colony System model.
Ant colony
Sequence (biology)
Cite
Citations (14)
An improved ant colony algorithm was put forward,which is more close to the real ant colony information system,in order to solve the VRP in grain logistics.The problem of delay due to the deficiency in cooperation is avoided,through the simulation contrast with the traditional ant colony algorithm in TSP, which approves the effectiveness of the improved ant colony algorithm.
Ant colony
Bacterial colony
Cite
Citations (0)
In this paper the actual research status of ant colony system,which has in recent years aroused wide interests,is summarily reviewed.Several types of modified ant colony system algorithmare are briefly introduced,such as ant colony system (ACS),max-min ant system (MMAS),ant colony algorithm with mutation features,ant colony algorithm integrated with genetic algorithm and so on.And as examples,based on several applications in the power system,this paper investigates some situations combined with applications.Also some hardware realizations of ant as single agent are roughly brought forth.
Ant colony
Formicoidea
Realization (probability)
Parallel metaheuristic
Cite
Citations (3)
An improved ant colony system was presented,which aimed at the drawback of ant colony system in network load space sharing.The algorithm used multiple ant colony to tag in same network and ectohormone of different ant colony restrain each other however which of same ant colony promote.This algorithm carry out the load space sharing by decreasing the number of ant colony's ectohormone in shortest path.The feasibility of the algorithm is proved by experiment and the results are given.
Ant colony
Formicoidea
Cite
Citations (2)
This paper describes GRAF-ANT (Graphical Framework for Ant Colony Optimization), an object-oriented C# framework for developing ant colony systems that we have developed. While developing this framework, abstractions that are necessary for ant colony optimization algorithms were analyzed, as well as the features that their implementing classes should have. During creation of these classes, several problems were solved: implementation of individual ants and ant colonies, connection between visualization and problem spaces, creation of a multithread application in which multiple ant colonies can communicate, creation of a problem independent graphical user interface (GUI), establishing an opportunity for hybridization of ACO (Ant colony optimization). Effects of this hybridization to different variations of ant colony systems is analyzed. The use of the GRAF-ANT and its suitability is illustrated by few instances of the Traveling Salesman Problem (TSP). We also present a concept of escaping ACO stagnation in local optima, named suspicious path destruction, that is also a part of GRAF-ANT.
Ant colony
Extremal optimization
Cite
Citations (15)