International Journal of Computer Engineering and Applications, Volume XII, Special Issue, August 18, ISSN
|
|
- Bathsheba Lucas
- 5 years ago
- Views:
Transcription
1 International Journal Computer Engineering and Applications, INTELLIGENT ROUTING BASED ON ACO TECHNIQUE F FAULT RING IN 2D-MESHES Gaytri Kumari Gupta research sclar, Jharkhand Rai University, Ranchi-India gayatri.gupta27@gmail.com Sudhanshu Kumar Jha, Assistant Pressor,AssistantPressor, National Institute Technology, Jamshedpur-India sudhanshukumarjha@gmail.com, ABSTRACT We present an intelligent routing based on ACO technique for communication messages via fault ring in 2D meshes. A fault ring [1] is a ring consists the fault-free component around the faulty nodes or faulty links to bypass faults for uninterrupted communication. Ant Colony optimization technique finds and gives an optimized route in 2D-meshes from source to destination, saving time and efforts. When a flit passes through a fault ring, it needs to be routed in an optimal to reduce delays and to optimize cost. Our proposed routing algorithm with ACO technique is driven by the foraging behavior actual ants colonies. The simulation results sw the effectiveness the routing based on ACO technique by comparing it with the algorithm defined in [1]. Index Terms ACO technique, optimal, fault ring, intelligent routing etc. INTRODUCTION nt colony optimization is a meta -heuristic A approach toward solving many problems finding srtest like (the first ACO algorithm)travelling salesman problem[2], single destination srtest problems, all pairs srtest problems, problem protein folding, finding the functional shape or conformation a protein in 2D or 3Dspace etc..this technique has also been used in the field telecommunications such as routing and load balancing. ACO [3] technique is actually inspired by the real ant s foraging behavior or we can say that their indirect communication through pheromones (a kind scent that an ant deposits to tempt changes in the surroundings) secretions for marking the visited place helping others colony ants, following the to search food and carrying it to their nest via the selected optimal which hel to save time Gaytri Kumari Gupta, Sudhanshu Kumar Jha 1
2 INTELLIGENT ROUTING BASED ON ACO TECHNIQUE F FAULT RING IN 2D-MESHES and efforts. The intelligent decision is made by Ants (routing agents) on the basis pheromones concentration and some other parameters. ACO algorithms was first introduced by Marco Dorigo and colleagues in the early 1990 s[5][6][7].it is one the most important approximate optimization technique [4].this technique also plays role in Artificial Intelligent in terms Swarm intelligence which works on designing multiintelligent agent system based on the behavior social insects, birds, and animals etc. In literature, we have also found that this technique also works well in NOC s architecture which provides scalable structure and balancing the communication between the multiple cores. Here, ACO technique hel to find and optimize routes in mesh-based NOC s [8]. The TSP and the protein folding problem under lattice models belong to an important class optimization problems known as combinatorial optimization (CO) like TSP and the protein folding problem under lattice models is a kind optimization problem, graph coloring problem[9-10], vehicle routing problem[11] etc. can also be solved by ACO technique. Our paper is aimed to discuss an intelligent routing technique based on ACO being performed in a 2D-mesh network. In an MPP environment fault (node fault or link faulty) may be fatal for any system that must be treated carefully. There are so many faults tolerant routing algorithm proposed for mesh and other topology [12, 13]. Boppana and chalasini proposed a fault-tolerant routing algorithm for 2Dmeshes were able to handle special convex shape faults like L, T or + with four virtual channels and some non-convex faults too. In this paper, we first propose an intelligent routing algorithm based on multi-aco for finding the optimal. We next present a comparison among earlier used routing algorithm and the proposed routing algorithm in terms optimization. The rest the paper is organized as follows. Section I describes our proposed routing algorithm. Section II presents differences among our proposed routing algorithm and few earlier used routing algorithms. Section III concludes our paper. from different community work to find optimal for routing. Step1: A colony red and black Ants starts their journey from source to different directions (s row and column wise) in order to get food i.e. to reach the destination point. As they move forward they secrete few amounts pheromones to create a trail so that they can come back to their nest or source point. Step 2: Every Ants (routing agent) maintains their own trail to reach their nest (source point). Ants (red or black) communicate with only their own community. Step 3: when Ants get food, they carry food and follow their optimal trail to reach nest and secretes high level pheromones to make trail even with more scent, while some other ants may be wandering and don t get food but as Ants have capability indirect communication, they will get the idea getting food through the most scented trail others ants. Ants start running into the trail pheromones and leave their own search. Step 4: Ants may find multiple routes from the nest to food but the most promising route will be the route followed by the largest number ants having a high level pheromones. For example, as swn in Fig 1. Ant s nest is connected to a food source by multiple bridges having different lengths. Initially, all the ants are at the nest, when they start their journey, some the ants from the red ant community and some from black ant community moves to different s and secrets few amounts pheromone. When some the ants reach to the food source, they take food grains and moves back to the nest, while returning ants secrete a high level pheromones to make route selected, while some others are still in search. Through indirect communication, if they get the knowledge highly secreted pheromone trial and may get success to find the food source so they follow their own trail while some them are wandering and there is no communication so they stop searching and follows the high pheromone trail swn in Fig 1(c). Therefore multi-ant colony optimizations are a useful technique to find optimal as well as alternate routes if available. I. INTELLIGENT ROUTING ALGITHM Our proposed algorithm is based on multi-ant colony optimization [14] technique where ants Gaytri Kumari Gupta, Sudhanshu Kumar Jha 2
3 International Journal Computer Engineering and Applications, Fig 2: Application routing algorithm on different situations in a 2D mesh network n n size. Multi-Ant colony optimizations routing algorithm: ( a) food ( b) food Fig 1. The concentration Pheromones produces one or multiple optimal s for communication. Implementation the algorithm is as follows by a comparative analysis e_cube, f_cube 2, and our proposed (ACO based) algorithm: Basic terminology: A r 1 A r n is ants from red community ant and A b 1 A b n are the ants from black community. Pheromone = number ants visited (counter variable) the location community wise. For simplicity, we are discussing e_cube and f_cube 2 routing algorithm. S is the source point (nest) from where ants have to starts their journey acquiring food. D is the destination point (food). ( c) food ACO meta-heuristic approach 1. Initialize parameters and pheromones trails. Red_counter: =0; black_counter: =0; S (a1, b1)//source point or nest location. 2. While total_cycle do Loop for each direction until food is found Equal number ants starts moving from (a1, b1) to diverge in different directions. Increment the counter by 1; //inializes pheromone table. If found faulty_ link then f_ring exists; Move on f_ring until food is found or reach nearest to food. Increment the counter by 1 for each p; End if End loop Ants check for high pheromones back to nest and sto. // largest counter for each community. Update pheromones table. Increment the counter by 1. End while 3. Return the best solution; Nest /Source point Gaytri Kumari Gupta, Sudhanshu Kumar Jha 3
4 INTELLIGENT ROUTING BASED ON ACO TECHNIQUE F FAULT RING IN 2D-MESHES II. COMPARATIVE ANALYSIS OF FEW ROUTING ALGITHMS USED IN 2D-MESHES. e_cube routing algorithm: - In a fault-free network, e_cube [1], a message travels in a row until it is in the similar column as the destination and then takes column. A row message may take column, but before doing that it changes itself into a column message. A column message never changes its type in e_cube routing. Therefore for the e_cube between S 1 and D 1 cannot be defined as node (1, 1) has a faulty link {(1, 1)-(1, 2)} incident on it, and e_cube routing algorithm does not tolerate faults due to its non-adaptive nature so as with route between S2 and D2 also. 0,3-1,3-2,32,5(al ter nate ) 3,34, 3-4,4 1,0-2,0-3,3-4,3,4,4 3,0-3,1- Table 1: swing a comparative analysis optimal s from source to destination by different routing algorithms. Sourc e - Desti na tion e_cub e f- cube 2 ACO S1-D1 does not get destinati on due to fault 2,4 2,4 0,1-0,2- S2- D2 S3- D ,2-6 1,0-1,1-2,4-3,4-3,5-4,5-4,4 6/8 1,0-1, ,2-4,23,2 faulttol era nce 4 NO 4 YES 4 YES f_cube2 routing algorithm: - In f_cube 2[1] routing algorithm, it is assumed that each node knows the status the link incident on it, and its position in the f_ring if any the links is faulty. let us consider the routing packets from S 2(a 1,b 1) to D 2(a 2,b 2).packet is routed as per e_cube from(1,0)(1,1),gets a faulty link {(1,1)-(1,2)} therefore, packet is misrouted so it will move clockwise as a 1<b 1 (NS message) and moves towards (2,1) s e-cube (2,1)-(2,2)-(2,3)-(2,4) now, it becomes a NS message and move toward (3,4) but it again found a faulty link {(3,4)-(4,4)} so it is misrouted and take a clockwise turn and moves to (3,5)-(4,5)-(4,4). Finally, it reaches the destination (4, 4) visiting 10. Our proposed routing algorithm based on multi- Ant colony optimization technique: - The proposed routing algorithm is based on the real ant's foraging behavior to find the optimal from the source (nest) to the destination (food).in our algorithm ants (red and black) works as a searching agent which finds the srtest route between source and destination in less time. Ants from different community deposits pheromones different type and color in different situations. Ants share information from the same community. Ants have a strong sense smells which hel them to be with their group and smells the food near to them. Due to multiple ants, our algorithm may produce the srtest route as well as an alternate srtest route which hel to route messages even if congestion occurs. Let us consider the route between S2 and D2 depicted in fig 2. Colony ants (red and black) are at node (1, 0), they diverge in different directions to their next p i.e. (1, 1), (0, 0), (2, 0), during foraging process they secrete few amounts pheromones (initialize the counter) to the visited. At node (1,0) Gaytri Kumari Gupta, Sudhanshu Kumar Jha 4
5 International Journal Computer Engineering and Applications, they find a faulty link{(1,1)(1,2)} on their way, so ants would change the,again ants at node(1,1) diverse to node(0,1) or (2,1). Since they have found faulty link on their, they are on fault ring, therefore, they would keep running on the ring till they get the food or they are at the nearest point the food as ants have strong sense smells.ants would meet at node(2,3), instead moving to node(2,4) as in fcube2 algorithm (based on e_cube algorithm), they will move to (3,3)-(4,3) then finally they reach at (4,4). Ant following the (1,0)- (1,1)-(2,1)(2,2)-(2,3)-(3,3)-(4,3)-(4,4) will reach the destination first and they visited only 8 from the source. In Parallel, other ants are also moving towards destination.ants moving via the (1, 0)-(2, 0)-(2,1)- (2,2)-(2,3)-(3,3)-(4,3)-(4,4) also reaches destination at the same time by visiting 8 only. While returning to source point (nest) ants update pheromones (increment the counter) to a high level and make the more scented. By the time, other ants (red and black) may be wandering and will follow the with high pheromones (comparing own counter to the other s counter value their own community, if their counter is less then stop their own search and follow the more scented ) as ants are intelligent to cooperate by their indirect communication capability. III. CONCLUSION We have seen that ACO based routing algorithms have been used for solving a variety problems. Our proposed multi ant colony optimization routing algorithm solves the routing problem as well as congestion by providing alternate at some extents. In fig. 2 routes for S2-D2, our algorithm resulted in the optimal by visiting only 8 while, f_cube2 routing algorithm required 10 for routing a packet. Our algorithm also produces an alternate optimal that may be used on the occurrence congestion in a network. Overall our proposed algorithm yields better result as swn in table1. REFERENCES [1]. V.Boppana, S. Chalasani, Fault-tolerant wormle routing algorithms for mesh networks, IEEE Trans. Comput (7) (1995) [2]. Dorigo, M., Gambardella, L.M., Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation 1(1) (1997) [3]. Christian Blum, Ant colony optimization: Introduction and recent trends, Physics Life Reviews 2 (2005) [4]. Dorigo M, Stützle T. Ant Colony Optimization. Cambridge, MA: MIT Press; 2004 [5]. Dorigo M, Optimization, learning and natural algorithms. Ph.D. thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992 [in Italian]. [6]. Dorigo M, Maniezzo V, Colorni A, Positive feedback as a search strategy. Technical Report , Dipartimento di Elettronica, Politecnicodi Milano, Italy, [7]. Dorigo M, Maniezzo V, Colorni A. Ant System: Optimization by a colony cooperating agents. IEEE Trans Syst Man Cybernet Part B1996;26(1): [8]. Luneque Silva Junior,, Nadia Nedjahb, Luiza de Macedo Mourelle, Routing for applications in NoC using ACO-based algorithms. Applied St Computing, Elsevier 13 (2013) [9]. I. A. Wagner, M. Linden baum, A. M. Bruckstein, Efficient Graph Search by a Smell-Oriented Vertex Process, Annuals Mathematics and Artificial Intelligence, 24, p ,1998. [10]. I. A. Wagner, M. Linderbaum, A. M. Bruckstein, ANTS: Agents, Networks, Trees, and Subgraphs, IBM Haifa Research Lab, Future Generation Computer Systems Journal, North Holland (Editors: Dorigo, Di Caro, and Stutzel), vol.16, no 8, p , June [11]. M. Dorigo, G. Di Caro, The Ant Colony Optimization MetaHeuristic, in Corne D., Dorigo M. and Glover F., New Ideas in Optimization, McGrawHill, May ISBN: [12]. T. Lee and J. Hayes, A fault-tolerant communication scheme for hypercube computers, IEEE Trans. Computers, vol. 41, pp , Oct [13]. M. Peercy and P. Banerjee, Distributed algorithms for srtest- deadlock-free routing and broadcasting in arbitrarily faulty hypercubes, 20th Ann. Int l Symp. Fault-tolerant Computing, pp , [14]. Kwang Mong Sim and Weng Hong Sun, Multi Ant- Colony Optimization for Network Routing, Proceedings the first International Symposium on Cyber Worlds(CW 02) /02$ IEEE. Gaytri Kumari Gupta, Sudhanshu Kumar Jha 5
Using Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationAnt Colony Optimization for dynamic Traveling Salesman Problems
Ant Colony Optimization for dynamic Traveling Salesman Problems Carlos A. Silva and Thomas A. Runkler Siemens AG, Corporate Technology Information and Communications, CT IC 4 81730 Munich - Germany thomas.runkler@siemens.com
More informationFault-Tolerant Routing Algorithm in Meshes with Solid Faults
Fault-Tolerant Routing Algorithm in Meshes with Solid Faults Jong-Hoon Youn Bella Bose Seungjin Park Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science Oregon State University
More informationIMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM
IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM Er. Priya Darshni Assiociate Prof. ECE Deptt. Ludhiana Chandigarh highway Ludhiana College Of Engg. And Technology Katani
More informationNetwork routing problem-a simulation environment using Intelligent technique
Network routing problem-a simulation environment using Intelligent technique Vayalaxmi 1, Chandrashekara S.Adiga 2, H.G.Joshi 3, Harish S.V 4 Abstract Ever since the internet became a necessity in today
More informationSolving Travelling Salesmen Problem using Ant Colony Optimization Algorithm
SCITECH Volume 3, Issue 1 RESEARCH ORGANISATION March 30, 2015 Journal of Information Sciences and Computing Technologies www.scitecresearch.com Solving Travelling Salesmen Problem using Ant Colony Optimization
More informationAnt Colony Optimization: The Traveling Salesman Problem
Ant Colony Optimization: The Traveling Salesman Problem Section 2.3 from Swarm Intelligence: From Natural to Artificial Systems by Bonabeau, Dorigo, and Theraulaz Andrew Compton Ian Rogers 12/4/2006 Traveling
More informationSwarm Intelligence (Ant Colony Optimization)
(Ant Colony Optimization) Prof. Dr.-Ing. Habil Andreas Mitschele-Thiel M.Sc.-Inf Mohamed Kalil 19 November 2009 1 Course description Introduction Course overview Concepts of System Engineering Swarm Intelligence
More informationNORMALIZATION OF ACO ALGORITHM PARAMETERS
U.P.B. Sci. Bull., Series C, Vol. 79, Iss. 2, 2017 ISSN 2286-3540 NORMALIZATION OF ACO ALGORITHM PARAMETERS Alina E. NEGULESCU 1 Due to the fact that Swarm Systems algorithms have been determined to be
More informationAnt Colony Based Load Flow Optimisation Using Matlab
Ant Colony Based Load Flow Optimisation Using Matlab 1 Kapil Upamanyu, 2 Keshav Bansal, 3 Miteshwar Singh Department of Electrical Engineering Delhi Technological University, Shahbad Daulatpur, Main Bawana
More informationImage Edge Detection Using Ant Colony Optimization
Image Edge Detection Using Ant Colony Optimization Anna Veronica Baterina and Carlos Oppus Abstract Ant colony optimization (ACO) is a population-based metaheuristic that mimics the foraging behavior of
More informationA heuristic approach to find the global optimum of function
Journal of Computational and Applied Mathematics 209 (2007) 160 166 www.elsevier.com/locate/cam A heuristic approach to find the global optimum of function M. Duran Toksarı Engineering Faculty, Industrial
More informationSolving a combinatorial problem using a local optimization in ant based system
Solving a combinatorial problem using a local optimization in ant based system C-M.Pintea and D.Dumitrescu Babeş-Bolyai University of Cluj-Napoca, Department of Computer-Science Kogalniceanu 1, 400084
More informationSWARM INTELLIGENCE -I
SWARM INTELLIGENCE -I Swarm Intelligence Any attempt to design algorithms or distributed problem solving devices inspired by the collective behaviourof social insect colonies and other animal societies
More informationHybrid Ant Colony Optimization and Cuckoo Search Algorithm for Travelling Salesman Problem
International Journal of Scientific and Research Publications, Volume 5, Issue 6, June 2015 1 Hybrid Ant Colony Optimization and Cucoo Search Algorithm for Travelling Salesman Problem Sandeep Kumar *,
More informationAutomatic Programming with Ant Colony Optimization
Automatic Programming with Ant Colony Optimization Jennifer Green University of Kent jg9@kent.ac.uk Jacqueline L. Whalley University of Kent J.L.Whalley@kent.ac.uk Colin G. Johnson University of Kent C.G.Johnson@kent.ac.uk
More informationFault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults Seungjin Park Jong-Hoon Youn Bella Bose Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science
More informationAn Ant Approach to the Flow Shop Problem
An Ant Approach to the Flow Shop Problem Thomas Stützle TU Darmstadt, Computer Science Department Alexanderstr. 10, 64283 Darmstadt Phone: +49-6151-166651, Fax +49-6151-165326 email: stuetzle@informatik.tu-darmstadt.de
More informationNavigation of Multiple Mobile Robots Using Swarm Intelligence
Navigation of Multiple Mobile Robots Using Swarm Intelligence Dayal R. Parhi National Institute of Technology, Rourkela, India E-mail: dayalparhi@yahoo.com Jayanta Kumar Pothal National Institute of Technology,
More informationAnt Colony Optimization
Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It
More informationAnt n-queen Solver. Salabat Khan, Mohsin Bilal, Muhammad Sharif, Rauf Baig
International Journal of Artificial Intelligence, ISSN 0974-0635; Int. J. Artif. Intell. Autumn (October) 2011, Volume 7, Number A11 Copyright 2011 by IJAI (CESER Publications) Ant n-queen Solver Salabat
More informationSolving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
More informationInternational Journal of Current Trends in Engineering & Technology Volume: 02, Issue: 01 (JAN-FAB 2016)
Survey on Ant Colony Optimization Shweta Teckchandani, Prof. Kailash Patidar, Prof. Gajendra Singh Sri Satya Sai Institute of Science & Technology, Sehore Madhya Pradesh, India Abstract Although ant is
More informationANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)
ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET) DWEEPNA GARG 1 & PARTH GOHIL 2 1,2 Dept. Of Computer Science and Engineering, Babaria Institute of Technology, Varnama, Vadodara, India E-mail
More informationACO for Maximal Constraint Satisfaction Problems
MIC 2001-4th Metaheuristics International Conference 187 ACO for Maximal Constraint Satisfaction Problems Andrea Roli Christian Blum Marco Dorigo DEIS - Università di Bologna Viale Risorgimento, 2 - Bologna
More informationOn-Line Scheduling Algorithm for Real-Time Multiprocessor Systems with ACO and EDF
On-Line Scheduling Algorithm for Real-Time Multiprocessor Systems with ACO and EDF Cheng Zhao, Myungryun Yoo, Takanori Yokoyama Department of computer science, Tokyo City University 1-28-1 Tamazutsumi,
More informationA Recursive Ant Colony System Algorithm for the TSP
2011 International Conference on Advancements in Information Technology With workshop of ICBMG 2011 IPCSIT vol.20 (2011) (2011) IACSIT Press, Singapore A Recursive Ant Colony System Algorithm for the TSP
More informationAdhoc Network Routing Optimization and Performance Analysis of ACO Based Routing Protocol
Adhoc Network Routing Optimization and Performance Analysis of ACO Based Routing Protocol Anubhuti Verma Abstract Ant Colony Optimization is based on the capability of real ant colonies of finding the
More informationTask Scheduling Using Probabilistic Ant Colony Heuristics
The International Arab Journal of Information Technology, Vol. 13, No. 4, July 2016 375 Task Scheduling Using Probabilistic Ant Colony Heuristics Umarani Srikanth 1, Uma Maheswari 2, Shanthi Palaniswami
More informationA Review: Optimization of Energy in Wireless Sensor Networks
A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department
More informationSelf-Organization Swarm Intelligence
Self-Organization Swarm Intelligence Winter Semester 2010/11 Integrated Communication Systems Group Ilmenau University of Technology Motivation for Self-Organization Problem of today s networks Heterogeneity
More informationAnt Colony Optimization Algorithm for Reactive Production Scheduling Problem in the Job Shop System
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Ant Colony Optimization Algorithm for Reactive Production Scheduling Problem in
More informationRelationship between Genetic Algorithms and Ant Colony Optimization Algorithms
Relationship between Genetic Algorithms and Ant Colony Optimization Algorithms Osvaldo Gómez Universidad Nacional de Asunción Centro Nacional de Computación Asunción, Paraguay ogomez@cnc.una.py and Benjamín
More informationWorkflow Scheduling Using Heuristics Based Ant Colony Optimization
Workflow Scheduling Using Heuristics Based Ant Colony Optimization 1 J.Elayaraja, 2 S.Dhanasekar 1 PG Scholar, Department of CSE, Info Institute of Engineering, Coimbatore, India 2 Assistant Professor,
More informationA Parallel Implementation of Ant Colony Optimization
A Parallel Implementation of Ant Colony Optimization Author Randall, Marcus, Lewis, Andrew Published 2002 Journal Title Journal of Parallel and Distributed Computing DOI https://doi.org/10.1006/jpdc.2002.1854
More informationA combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem
A combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem TRUNG HOANG DINH, ABDULLAH AL MAMUN Department of Electrical and Computer Engineering
More informationAdaptive Model of Personalized Searches using Query Expansion and Ant Colony Optimization in the Digital Library
International Conference on Information Systems for Business Competitiveness (ICISBC 2013) 90 Adaptive Model of Personalized Searches using and Ant Colony Optimization in the Digital Library Wahyu Sulistiyo
More informationarxiv: v1 [cs.ai] 9 Oct 2013
The Generalized Traveling Salesman Problem solved with Ant Algorithms arxiv:1310.2350v1 [cs.ai] 9 Oct 2013 Camelia-M. Pintea, Petrică C. Pop, Camelia Chira North University Baia Mare, Babes-Bolyai University,
More informationInternational Journal of Computer Engineering and Applications, Volume XII, Special Issue, July 18, ISSN
International Journal of Computer Engineering and Applications, Volume XII, Special Issue, July 18, www.ijcea.com ISSN 2321-3469 MULTICAST ROUTING: CONVENTIONAL ALGORITHMS VS ANT COLONY SYSTEM ABSTRACT
More informationRefinement of Data-Flow Testing using Ant Colony Algorithm
Refinement of Data-Flow Testing using Ant Colony Algorithm Abhay Kumar Srivastav, Supriya N S 2,2 Assistant Professor,2 Department of MCA,MVJCE Bangalore-560067 Abstract : Search-based optimization techniques
More informationCT79 SOFT COMPUTING ALCCS-FEB 2014
Q.1 a. Define Union, Intersection and complement operations of Fuzzy sets. For fuzzy sets A and B Figure Fuzzy sets A & B The union of two fuzzy sets A and B is a fuzzy set C, written as C=AUB or C=A OR
More informationImplementation of a Software IP Router using Ant Net Algorithm
Implementation of a Software IP Router using Ant Net Algorithm A. Jusrut, A. Khedan, and V. Ramnarain-Seetohul Computer Science and Engineering Department, University Of Mauritius, Reduit, Mauritius Computer
More informationAn Ant System with Direct Communication for the Capacitated Vehicle Routing Problem
An Ant System with Direct Communication for the Capacitated Vehicle Routing Problem Michalis Mavrovouniotis and Shengxiang Yang Abstract Ant colony optimization (ACO) algorithms are population-based algorithms
More informationVOL. 3, NO. 8 Aug, 2012 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
Job Shop Scheduling using ACO Meta-heuristic with Waiting_Time-based Pheromone Updating Elena Simona Nicoară Petroleum-Gas University of Ploieşti, Information Technology, Mathematics and Physics Department,
More informationModels for pheromone evaluation in Ant Systems for Mobile Ad-hoc networks
Models for pheromone evaluation in Ant Systems for Mobile Ad-hoc networks Fernando Correia Portuguese Naval Academy/I.S.T Lisboa Portugal fcorreia@tagus.inesc-id.pt Teresa Vazão Inesc-ID/I.S.T. Lisboa
More informationApplying Opposition-Based Ideas to the Ant Colony System
Applying Opposition-Based Ideas to the Ant Colony System Alice R. Malisia, Hamid R. Tizhoosh Department of Systems Design Engineering, University of Waterloo, ON, Canada armalisi@uwaterloo.ca, tizhoosh@uwaterloo.ca
More informationFirst approach to solve linear system of equations by using Ant Colony Optimization
First approach to solve linear system equations by using Ant Colony Optimization Kamil Ksia z ek Faculty Applied Mathematics Silesian University Technology Gliwice Poland Email: kamiksi862@studentpolslpl
More informationHYBRID APROACH FOR WEB PAGE CLASSIFICATION BASED ON FIREFLY AND ANT COLONY OPTIMIZATION
HYBRID APROACH FOR WEB PAGE CLASSIFICATION BASED ON FIREFLY AND ANT COLONY OPTIMIZATION ABSTRACT: Poonam Asawara, Dr Amit Shrivastava and Dr Manish Manoria Department of Computer Science and Engineering
More information296 M.R. Jalali, A. Afshar and M.A. Mari~no taken by individual ants from the nest in search for a food source, is essentially random [4]. However, wh
Scientia Iranica, Vol. 13, No. 3, pp 295{302 c Sharif University of Technology, July 2006 Improved Ant Colony Optimization Algorithm for Reservoir Operation M.R. Jalali 1, A. Afshar and M.A. Mari~no 2
More informationAn Experimental Study of the Simple Ant Colony Optimization Algorithm
An Experimental Study of the Simple Ant Colony Optimization Algorithm MARCO DORIGO and THOMAS STÜTZLE IRIDIA Université Libre de Bruxelles Avenue Franklin Roosevelt 50, CP 194/6, 1050 Brussels BELGIUM
More informationAn Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem
1 An Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem Krishna H. Hingrajiya, Ravindra Kumar Gupta, Gajendra Singh Chandel University of Rajiv Gandhi Proudyogiki Vishwavidyalaya,
More informationDynamic Load Balancing using an Ant Colony Approach in Micro-cellular Mobile Communications Systems
Dynamic Load Balancing using an Ant Colony Approach in Micro-cellular Mobile Communications Systems Sung-Soo Kim 1, Alice E. Smith 2, and Soon-Jung Hong 3 1 Systems Optimization Lab. Dept. of Industrial
More informationSearching for Maximum Cliques with Ant Colony Optimization
Searching for Maximum Cliques with Ant Colony Optimization Serge Fenet and Christine Solnon LIRIS, Nautibus, University Lyon I 43 Bd du 11 novembre, 69622 Villeurbanne cedex, France {sfenet,csolnon}@bat710.univ-lyon1.fr
More informationAccelerating Ant Colony Optimization for the Vertex Coloring Problem on the GPU
Accelerating Ant Colony Optimization for the Vertex Coloring Problem on the GPU Ryouhei Murooka, Yasuaki Ito, and Koji Nakano Department of Information Engineering, Hiroshima University Kagamiyama 1-4-1,
More informationSAACO: Semantic Analysis based Ant Colony Optimization Algorithm for Efficient Text Document Clustering
SAACO: Semantic Analysis based Ant Colony Optimization Algorithm for Efficient Text Document Clustering 1 G. Loshma, 2 Nagaratna P Hedge 1 Jawaharlal Nehru Technological University, Hyderabad 2 Vasavi
More informationSwarm Intelligence: An Application of Ant Colony Optimization
International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) Swarm Intelligence: An Application of Ant Colony Optimization A. Ilamaran 1, S. Ganapathiram 2, R. Ashwin Kumar 3, J. Uthayakumar
More informationParallel Implementation of the Max_Min Ant System for the Travelling Salesman Problem on GPU
Parallel Implementation of the Max_Min Ant System for the Travelling Salesman Problem on GPU Gaurav Bhardwaj Department of Computer Science and Engineering Maulana Azad National Institute of Technology
More informationParallel Implementation of Travelling Salesman Problem using Ant Colony Optimization
Parallel Implementation of Travelling Salesman Problem using Ant Colony Optimization Gaurav Bhardwaj Department of Computer Science and Engineering Maulana Azad National Institute of Technology Bhopal,
More informationA Review of Ant Colony based Routing Algorithm in Wireless Ad-hoc Networks
A Review of Ant Colony based Routing Algorithm in Wireless Ad-hoc Networks Sai Priya Thottempudi $, Dr Syed Umar * $ Student, Department of ECE, V R Siddhartha Eng College, A.P.INDIA. * Assoc. Professor,
More informationSystem Evolving using Ant Colony Optimization Algorithm
Journal of Computer Science 5 (5): 380-387, 2009 ISSN 1549-3636 2009 Science Publications System Evolving using Ant Colony Optimization Algorithm Nada M.A. AL-Salami Department of Management Information
More informationTasks Scheduling using Ant Colony Optimization
Journal of Computer Science 8 (8): 1314-1320, 2012 ISSN 1549-3636 2012 Science Publications Tasks Scheduling using Ant Colony Optimization 1 Umarani Srikanth G., 2 V. Uma Maheswari, 3.P. Shanthi and 4
More informationAnt Algorithms. Simulated Ant Colonies for Optimization Problems. Daniel Bauer July 6, 2006
Simulated Ant Colonies for Optimization Problems July 6, 2006 Topics 1 Real Ant Colonies Behaviour of Real Ants Pheromones 2 3 Behaviour of Real Ants Pheromones Introduction Observation: Ants living in
More informationANT PATH OF TOPOLOGY FOR DYNAMIC ROUTING AND WAVELENGTH ASSIGNMENT IN WDM NETWORKS
ANT PATH OF TOPOLOGY FOR DYNAMIC ROUTING AND WAVELENGTH ASSIGNMENT IN WDM NETWORKS 1. K. Aparna, 2. Dr. S.Venkatachalam, 3. Dr. G.R.Babu 1. Asst.Professor, JNTUA College of Engineering. Pulivendulan aparna.kukunuri@yahoo.com
More informationA study of hybridizing Population based Meta heuristics
Volume 119 No. 12 2018, 15989-15994 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A study of hybridizing Population based Meta heuristics Dr.J.Arunadevi 1, R.Uma 2 1 Assistant Professor,
More informationHybrid Bee Ant Colony Algorithm for Effective Load Balancing And Job Scheduling In Cloud Computing
Hybrid Bee Ant Colony Algorithm for Effective Load Balancing And Job Scheduling In Cloud Computing Thomas Yeboah 1 and Odabi I. Odabi 2 1 Christian Service University, Ghana. 2 Wellspring Uiniversity,
More informationModified Greedy Methodology to Solve Travelling Salesperson Problem Using Ant Colony Optimization and Comfort Factor
International Journal of Scientific and Research Publications, Volume 4, Issue 10, October 2014 1 Modified Greedy Methodology to Solve Travelling Salesperson Problem Using Ant Colony Optimization and Comfort
More informationA Particle Swarm Approach to Quadratic Assignment Problems
A Particle Swarm Approach to Quadratic Assignment Problems Hongbo Liu 1,3, Ajith Abraham 2,3, and Jianying Zhang 1 1 Department of Computer Science, Dalian University of Technology, Dalian, 116023, China
More information[Jagtap*, 5 (4): April, 2016] ISSN: (I2OR), Publication Impact Factor: 3.785
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY A SURVEY: ANT BASED BIO-INSPIRED ALGORITHM FOR AD-HOC NETWORK Anjali A Jagtap *, Prof. Ankita Agarwal, Prof. Dipak R Raut, Prof.
More informationResearch Article Using the ACS Approach to Solve Continuous Mathematical Problems in Engineering
Mathematical Problems in Engineering, Article ID 142194, 7 pages http://dxdoiorg/101155/2014/142194 Research Article Using the ACS Approach to Solve Continuous Mathematical Problems in Engineering Min-Thai
More informationImprovement of a car racing controller by means of Ant Colony Optimization algorithms
Improvement of a car racing controller by means of Ant Colony Optimization algorithms Luis delaossa, José A. Gámez and Verónica López Abstract The performance of a car racing controller depends on many
More informationAnt Colony Optimization
DM841 DISCRETE OPTIMIZATION Part 2 Heuristics Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. earch 2. Context Inspiration from Nature 3. 4. 5.
More informationNature Inspired Meta-heuristics: A Survey
Nature Inspired Meta-heuristics: A Survey Nidhi Saini Student, Computer Science & Engineering DAV Institute of Engineering and Technology Jalandhar, India Abstract: Nature provides a major inspiration
More informationIntuitionistic Fuzzy Estimations of the Ant Colony Optimization
Intuitionistic Fuzzy Estimations of the Ant Colony Optimization Stefka Fidanova, Krasimir Atanasov and Pencho Marinov IPP BAS, Acad. G. Bonchev str. bl.25a, 1113 Sofia, Bulgaria {stefka,pencho}@parallel.bas.bg
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationA Quality of Service Routing Scheme for Packet Switched Networks based on Ant Colony Behavior
A Quality of Service Routing Scheme for Packet Switched Networks based on Ant Colony Behavior Liliana Carrillo, J.L Marzo, Pere Vilà, Lluís Fàbrega, Carles Guadall Institut d Informàtica i Aplicacions
More informationHybrids of Ant Colony Optimization Algorithm- A Versatile Tool
Hybrids of Ant Colony Optimization Algorithm- A Versatile Tool 1 Preeti Tiwari, 2 Anubha Jain 1 Senior Assistant Professor, 2 Head of Department 1 Computer Science, 2 CS & IT 1 International School of
More informationHigh Dimensional Data Clustering Using Cuckoo Search Optimization Algorithm
High Dimensional Data Clustering Using Cucoo Search Optimization Algorithm 1 Priya Vaijayanthi, 2 Xin-She Yang, 3 Natarajan A M and 4 Raja Murugadoss 1,3 Department of CSE, Bannari Amman Institute of Technology,
More informationANT COLONY optimization (ACO) is a metaheuristic for
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 34, NO. 2, APRIL 2004 1161 The Hyper-Cube Framework for Ant Colony Optimization Christian Blum, Student Member, IEEE, and Marco
More informationDesign &Implementation the solution for Dynamic Travelling Salesman Problem with Ant Colony Optimization Algorithm and chaos theory
Design &Implementation the solution for Dynamic Travelling Salesman Problem with Ant Colony Optimization Algorithm and chaos theory KamleshLakhwani Vivekananda Institute of Technology Manish Kumar Sharma
More informationAnt Colony Optimization for the Ship Berthing Problem
Ant Colony Optimization for the Ship Berthing Problem Chia Jim Tong, Hoong Chuin Lau, and Andrew Lim School of Computing National University of Singapore Lower Kent Ridge Road Singapore 119260 chia@acm.org,
More informationInternational Journal of Advancements in Research & Technology, Volume 2, Issue 9, September-2013 SN
International Journal of Advancements in Research & Technology, Volume 2, Issue 9, September-2013 146 Survey of Swarm Intelligence Inspired Routing Algorithms and Mobile Ad-Hoc Network Routing Protocols
More informationInvestigation of Simulated Annealing, Ant-Colony and Genetic Algorithms for Distribution Network Expansion Planning with Distributed Generation
Investigation of Simulated Annealing, Ant-Colony and Genetic Algorithms for Distribution Network Expansion Planning with Distributed Generation Majid Gandomkar, Hajar Bagheri Tolabi Department of Electrical
More informationAnt colony optimization with genetic operations
Automation, Control and Intelligent Systems ; (): - Published online June, (http://www.sciencepublishinggroup.com/j/acis) doi:./j.acis.. Ant colony optimization with genetic operations Matej Ciba, Ivan
More informationUpdate Vehicle Traffic Routing Using Ant Colony Optimization Algorithm
Update Vehicle Traffic Routing Using Ant Colony Optimization Algorithm Mohammad Jamal Hossain, Golam Md. Muradul Bashir Computer Science and Engineering Faculty Patuakhali Science and Technology University
More informationMIRROR SITE ORGANIZATION ON PACKET SWITCHED NETWORKS USING A SOCIAL INSECT METAPHOR
MIRROR SITE ORGANIZATION ON PACKET SWITCHED NETWORKS USING A SOCIAL INSECT METAPHOR P. Shi, A. N. Zincir-Heywood and M. I. Heywood Faculty of Computer Science, Dalhousie University, Halifax NS, Canada
More informationMetaheuristics: a quick overview
Metaheuristics: a quick overview Marc Sevaux University of Valenciennes CNRS, UMR 8530, LAMIH / Production systems Marc.Sevaux@univ-valenciennes.fr Marc Sevaux TEW Antwerp 2003 1 Outline Outline Neighborhood
More informationSolving Permutation Constraint Satisfaction Problems with Artificial Ants
Solving Permutation Constraint Satisfaction Problems with Artificial Ants Christine Solnon 1 Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization
More informationPublished by: PIONEER RESEARCH & DEVELOPMENT GROUP ( ) 1
Improving Efficiency by Balancing the Load Using Enhanced Ant Colony Optimization Algorithm in Cloud Environment Ashwini L 1, Nivedha G 2, Mrs A.Chitra 3 1, 2 Student, Kingston Engineering College 3 Assistant
More informationSensor Scheduling Using Ant Colony Optimization
Sensor Scheduling Using Ant Colony Optimization Dan Schrage Charles River Analytics, Inc. 625 Mt. Auburn St. Cambridge, MA 02138, USA +1 617 491 3474 x512 dschrage@cra.com Paul G. Gonsalves Charles River
More informationExcavation Balance Routing Algorithm Simulation Based on Fuzzy Ant Colony
2018 5th International Conference on Electrical & Electronics Engineering and Computer Science (ICEEECS 2018) Excavation Balance Routing Algorithm Simulation Based on Fuzzy Ant Colony Luo Xiaojuan, Yan
More informationData Gathering of Wireless Sensor Network using Ant colony optimization
Data Gathering of Wireless Sensor Network using Ant colony optimization KmandeepKaur, #1 Gurdeep Singh #2,Manit kapoor #3 M.Tech, Deptt. of ECE Ramgarhia Institute of Engineering and Technology Phagwara
More informationENHANCED BEE COLONY ALGORITHM FOR SOLVING TRAVELLING SALESPERSON PROBLEM
ENHANCED BEE COLONY ALGORITHM FOR SOLVING TRAVELLING SALESPERSON PROBLEM Prateek Agrawal 1, Harjeet Kaur 2, and Deepa Bhardwaj 3 123 Department of Computer Engineering, Lovely Professional University (
More informationAn Adaptive Ant System using Momentum Least Mean Square Algorithm
An Adaptive Ant System using Momentum Least Mean Square Algorithm Abhishek Paul ECE Department Camellia Institute of Technology Kolkata, India Sumitra Mukhopadhyay Institute of Radio Physics and Electronics
More informationAnt Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength Allocation
Ant Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength Allocation Griselda Navarro Varela Dept. of Electronic Systems Engineering, University of Essex, Wivenhoe Park, Colchester, Essex
More informationA New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization
A New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization Víctor M. Aragón, Ignacio de Miguel, Ramón J. Durán, Noemí Merayo, Juan Carlos Aguado, Patricia Fernández,
More information150 Botee and Bonabeau Ant Colony Optimization (ACO), which they applied to classical NP-hard combinatorial optimization problems, such as the traveli
Adv. Complex Systems (1998) 1, 149 159 Evolving Ant Colony Optimization Hozefa M. Botee Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM 87501, USA botee@santafe.edu Eric Bonabeau y Santa Fe Institute
More informationStructural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
Structural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems James Montgomery No Institute Given Abstract. When using a constructive search algorithm, solutions to scheduling
More informationA COMPARATIVE STUDY ON MULTICAST ROUTING USING DIJKSTRA S, PRIMS AND ANT COLONY SYSTEMS
International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 1 Number 2, Sep - Oct (2010), pp. 16-25 IAEME, http://www.iaeme.com/ijcet.html
More informationBee Inspired and Fuzzy Optimized AODV Routing Protocol
, pp.70-74 http://dx.doi.org/10.14257/astl.2018.149.15 Bee Inspired and Fuzzy Optimized AODV Routing Protocol B. Jahnavi, G. Virajita, M. Rajeshwari and N. Ch. S. N. Iyengar Department of Information Technology,
More informationParameters Influencing the Performance of Ant Algorithms Applied to Optimisation of Buffer Size in Manufacturing
IEMS Vol. 4, No., pp. 84-9, December 005. Parameters Influencing the Performance of Ant Algorithms Applied to Optimisation of Buffer Size in Manufacturing Matthias Becker Department of Computer Science,
More information