Solving Travelling Salesman Problem Using Variants of ABC Algorithm
|
|
- Sheena Watkins
- 6 years ago
- Views:
Transcription
1 Volume 2, No. 01, March 2013 ISSN The International Journal of Computer Science & Applications (TIJCSA) RESEARCH PAPER Available Online at Solving Travelling Salesman Problem Using Variants of ABC Algorithm Ginnu George Student, Computer Science and Engineering Karunya University Abstract Dr.Kumudha Raimond Professor, Computer Science and Engineering Karunya University This paper mainly explains about the performance of variants of Artificial Bee Colony (ABC) algorithms in solving the Travelling Salesman Problem (TSP). The main goal of TSP is that a number of cities should be visited by a salesman and return to the starting city along with a number of possible shortest routes. In this work, it investigates over variants of ABC algorithms such as Improved ABC (I-ABC) and Prediction Selection ABC (PS-ABC). The variants of ABC algorithms are used to find the optimal path for TSP. The results of the original ABC algorithms are compared with the results of the I-ABC and PS-ABC algorithms and shows that the PS-ABC performs well in finding the shortest distance within the minimum span of time. Keywords- Artificial Bee Colony, Improved ABC, Prediction Selection ABC. 1. Introduction Optimization problems is mainly used for finding nearly optimal solution and are frequently encountered in various applications such as TSP [10], Container Loading problems (CL) [11], Scheduling problems [12], engineering design [13, 14] etc. TSP is one of the NP hard optimization problems. In TSP, the salesman travels all the cities at once and returns to the starting city with the possible shortest route within small duration. Many heuristic optimization methods are developed so far for searching nearly optimal solution in solving TSP such as Genetic Algorithm (GA) [1, 2], Particle Swarm Optimization (PSO) [3, 5], Ant Colony optimization (ACO) [4, 6], Simulated Annealing (SA) [7] and Artificial Bee Colony (ABC) [8, 2013, - TIJCSA All Rights Reserved 97
2 9]. ABC algorithm shows more effective when compared to the above optimization algorithms since it is the latest optimization technique which is developed by Dervis Karaboga in the year In the year 2012 the variants of ABC Algorithms [ 17] such as I-ABC and PS-ABC has been proposed and shows that PS-ABC performs well in finding the nearly optimal solution within minimum span of time. This work investigates the variants of ABC algorithms over TSP inorder to find the trend of PS-ABC algorithm with respect to original ABC and I-ABC algorithm. The outline of the paper is organized as follows: section 2 explains the concepts of TSP, section 3 explains the architecture of variants of ABC algorithms, the results and discussions in solving TSP are presented in section 4 and section 5 concludes the paper. 2. Travelling Salesman Problem (TSP) The main goal of TSP is that, the salesman travels through a number of cities, visits each city once and returns to the starting city as trying to obtain a closed tour in finding a shortest path within minimum span of time. The distance between the two cities i and i+1 is calculated with help of the following eq (1) [15]: ( T[ i], T[ i + 1] ) = d 2 2 ( ( xi xi+ 1 ) + yi yi+ 1) (1) The total tour length [15] is calculated in the eq (2): Where, n is the total number of cities T is the tour length n f = 1 d( T[ i], T[ i + 1] + d( T[ n], T[1]) i= 1 (2) In solving the TSP Nearest Neighbor method [16] is used. The Nearest Neighbor method compares the distribution of distances in which from one point to nearest neighbor point in the given set of locations. The main steps of Nearest Neighbor Method are as follows: Step 1: Initially starts from a random node Step 2: Moves towards the unvisited node Step 3: Repeat the above steps until all nodes are visited and finally joins the first and last node to form a closed route and hence obtains the reference path. 3. Artificial Bee Colony Algorithm and its Variants ( I-ABC and PS-ABC ) 2013, - TIJCSA All Rights Reserved 98
3 The I-ABC and PS-ABC are the variants of ABC algorithms. The following subsections explain in detail about the Original ABC algorithm and its variants. 3.1 Original ABC Algorithm In ABC algorithm, the food source position represents a solution to the optimization problem and the nectar amount of a food source corresponds to the fitness of the corresponding solution. The following Fig. 1 [18] explains about the original ABC algorithms. STEP 1: At the first step, the ABC generates a randomly distributed initial population of solutions (SN), where SN denotes the size of employed bees or onlooker bees. Each solution X i is a D-dimensional vector where i=1,2, SN and D is the number of optimization parameters. STEP 2: After initialization, the initial fitness of the population is evaluated. The population of the solutions is then subjected to repeated cycles such as employed bees, the onlooker bees and the scout bees. STEP 3: For each employed bee new solutions (V ij ) is produced by using the solution search equation. STEP 4: Calculate the probability values P ij for the solutions V ij by the following eq (3) [17]: fit p = i i SN fit j= 1 j (3) Where, fit i denotes the fitness value of the i th solution. Solution search equation is given below (4) [17]: vij = xij + φ ij ( xij xkj) (4) where k is {1,2,..,SN} and j is {1,2,D} are randomly generating indexes, Φ ij is a random number between [ 1, 1] and X ij is the food position or the solution. After obtaining the new solution its fitness is evaluated and then it applies the greedy solution mechanism that is if the fitness value of the new one is better than that of the previous one, then the employed bee would memorize the new position and forget the previous one. Otherwise it keeps the position of the previous one in its memory. For each employed bee new solutions (V ij ) is produced by using the solution search equation shown eq (4).After obtaining the new solution its fitness is evaluated and finally applies the greedy solution mechanism. 2013, - TIJCSA All Rights Reserved 99
4 STEP 5: If a position cannot be improved further through a predetermined number of cycles, the food source should be abandoned. Determine the abandoned solution for the scout, if exists, and replace it with a new randomly produced solution x ij. STEP 6: Memorize the best solution that is obtained so far. STEP 7: Repeat the cycle until the termination condition is satisfied. The main strength of ABC is having good exploration while the limitations are slow convergence and poor exploitation. Fig.1 Flowchart of original ABC algorithm [18] 2013, - TIJCSA All Rights Reserved 100
5 3.2 Improved ABC (I-ABC) To overcome the limitations of original ABC, Improved ABC (I-ABC) is proposed. In I-ABC inertia weight and acceleration coefficients are introduced in the solution search equation to modify the search process. The operation process can be modified as the following eq (5) [17]: v ij = x w + 2( φ 0.5)( x x ) Φ 1 + ϕ ( x x ) Φ2 (5) ij ij ij ij kj Where, ω ij is the inertia weight, x j is the j th parameter of the best-so-far solution, Φ ij and φ ij are random numbers between [0, 1], Φ1 and Φ 2 are positive parameter that could control the maximum step size. The inertia weight and acceleration coefficients are defined as functions of the fitness in the search process of ABC. They are given in the following equations (6), (7) and (8) [17]: 1 wij = Φ 1 = (6) (1 + exp( fitness( i) ap)) ij j kj Φ 2 =1 if bee is employee one (7) 1 2 = 1+ exp( fitness ( i) ap Φ if bee is looked one (8) Where, ap is the fitness value in the first iteration. 3.3 Prediction Selection ABC (PS-ABC) To increase the exploitation capacity and convergence speed and also to overcome the trapping of local optimal solutions in Improved ABC (I-ABC), a high efficient algorithm, called PS-ABC (Prediction-Selection ABC) algorithm. In PS-ABC [17], an employed bee firstly works out three new solutions by three different solution search equations, and then chooses and finally determines the best one as the candidate solution. The Solution Search Equations used in PS- ABC are: the first one is eq (4), which is the solution modification form of the original ABC algorithm. The second one is the eq (5) and the third one is the GABC equation which is explained by the following eq (9). 2013, - TIJCSA All Rights Reserved 101
6 vij = xij ϕ + 2( φij 0.5)( xij xkj) + ij ( x j xkj) Where, v ij is the new feasible solution that is an modified feasible solution depending on its previous solution x ij. x j is the j th parameter of the best-so-far solution, Φ ij is a random number between [0, 1], φ ij is between [0, c], c is a non negative constant, which is set 1.The Fig. 2 shown below explains the explains the main operations of PS-ABC. (9) 3.4 Architecture of ABC Algorithm for TSP Fig. 2 Flowchart of PS-ABC [17] Fig.3 shows the flowchart of ABC algorithm for optimization of the TSP [16]. In the initialization phase, the control parameters are set, such as colony size, iteration number etc. In the next phase, a reference path is obtained by using nearest neighbor method. When the working bees are initialized, the bee optimization loop is set. Then the random node is assigned for the bee and then computes the probabilities by the eq (3) and calculates the path and will memorize the best solution by applying greedy selection mechanism. Finally the bees will become as scout 2013, - TIJCSA All Rights Reserved 102
7 bees and the working bees are updated. The optimization loop is terminated when the termination criterion is satisfied and hence the best solution is obtained. Start Set control parameters Obtain no. of locations Compute the path using nearest neighbor method Initialize the working bees Set Cycle =1 Reset the path Construct the new paths for bees Compute the step probabilities Compute fitness Memorize best solution Cycle=cycle+1 Yes No Stop Fig.3 Flowchart of ABC algorithm for Travelling Salesman problem [16] 2013, - TIJCSA All Rights Reserved 103
8 4. Results and Discussions In TSP the colony size is taken as 40. The number of cities is taken as 50 and the number of iteration is 50. Fig.4 shows the locations of the different cities and Fig.5 shows the reference path for salesman to travel which is obtained by the nearest neighbor method. C# is the language used for solving TSP. Fig.4 Locations of 50 cities Fig.5 Reference path obtained The shortest distances and their corresponding paths are given in the Table.1 Algorithms No: of Cities ABC 50 Table.1 Different paths and their shortest distance Path Allocated 1,33,46,6,40,15,20,3,17,11,38,23,35,28,19,10,13,14,45,49, 36,8,25,12,44,21,41,24,7,2,31,5,26,29,32,42,47,9,50,16,4,3 7,43,27,48,39,34,1 1,6,40,15,46,33,20,18,17,22,38,23,45,49,36,8,25,12,44,21, 41,24,7,2,31,5,26,29,32,42,47,9,50,16,4,19,10,14,13,37,43, 27,48,39,34,3,11,28,1 1,21,41,24,7,2,31,5,26,29,32,42,47,9,50,16,4,19,10,14,13,3 7,43,27,48,39,34,3,11,28,6,40,15,46,33,20,18,17,22,38,23, 45,49,36,8,25,12,44,1 Shortest Distance , - TIJCSA All Rights Reserved 104
9 I-ABC 50 PS-ABC 50 1,31,5,26,29,32,42,47,45,46,6,40,15,9,50,16,4,37,43,27,48, 39,34,33,20,3,17,11,38,23,35,28,19,10,13,14,41,24,7,2, 49, 36,8,25,12,44,21,1 1,14,45,49,36,8,25,12,44,21,41,24,7,2,31,5,26,29,32,42,47, 33,46,6,40,15,20,3,17,11,38,23,35,28,19,10,13,43,27,48,39,34,50,16,4,37,9,1 1,22,38,23,45,49,36,8,25,12,44,21,41,24,7,2,31,5,26,29,32, 42,47,9,50,16,4,19,10,14,13,37,43,27,48,39,34,3,11,28,6,4 0,15,46,33,20,18,17,1 1,19,10,13,14,41,24,7,2,31,5,26,29,32,42,47,45,49,36,8,25, 12,44,21,9,50,16,4,37,43,27,48,39,34,33,46,6,40,15,20,3,1 7,11,38,23,35,28,30,1 1,49,36,8,25,12,44,21,41,24,7,2,31,5,26,29,32,42,47,9,50,1 6,4,37,43,27,48,39,34,33,46,6,40,15,20,3,17,11,38,23,35,2 8,19,10,13,14,1 1,21,9,50,16,4,37,43,27,48,39,34,33,46,6,40,15,20,3,17,11, 38,23,35,28,30,19,10,13,14,41,24,7,2,31,5,26,29,32,42,47, 45,49,36,8,25,12,44,1 1,92,48,39,34,3,22,38,23,45,49,11,28,6,40,15,46,33,20,18, 17,50,16,4,19,10,14,13,37,36,8,25,12,44,21,41,24,7,2,31,5, 2643,29,32,42,47,1 1,9,50,16,4,37,43,27,48,39,34,33,46,6,40,15,20,3,17,11,38, 23,35,28,19,10,13,14,41,24,7,2,31,5,26,29,32,42,47,45, 49, 36,8,25,12,44,21, , - TIJCSA All Rights Reserved 105
10 Thus, the best shortest distance is given in the Table 2 Algorithms No: of Cities ABC 50 I-ABC 50 PS-ABC 50 Table 2 Best shortest distance Path Allocated 1,31,5,26,29,32,42,47,45,46,6,40,15,9,50,16,4,37,43,27,48,39,34,33,20,3,17,11,38,23,35,28,19,10,13,14,41,24,7,2,49,36,8, 25,12,44,21,1 1,19,10,13,14,41,24,7,2,31,5,26,29,32,42,47,45,49,36,8,25,12,44,21,9,50,16,4,37, 43,27,48,39,34,33,46,6,40,15,20,3,17,11, 38,23,35,28,30,1 1,9,50,16,4,37,43,27,48,39,34,33,46,6,40,15,20,3,17,11,38,23,35,28,19,10,13,14,4 1,24,7,2,31,5,26,29,32,42,47,45,49,36,8, 25,12,44,21,1 Shortest Distance Time Consumed milsec milsec milsec The graphs shown below mainly describe the influence of ABC variants by varying the number of cities. The results are depicted in Fig.6 and Fig.7. The results show that for 50 iterations if the number of cities is increased the corresponding shortest distance and the time taken also is increased. Further analysis of the graphs in terms of shortest distance and time, the linear increment is very less for PS-ABC when compared to I-ABC and ABC algorithm. However, from the results, it is clear that PS-ABC performs well when compared to I-ABC and ABC algorithm in finding the shortest distance within the minimum span of time. A sample results are explained in detail in the above Table 1 and Table 2 where the number of cities are taken as 50 and also the number of iteration is taken as 50. From the above sample results it shows that when the number of cities is taken as 50 the PS-ABC performs better in finding the least distance within the small amount of time. 2013, - TIJCSA All Rights Reserved 106
11 Shortest Distance ABC I- ABC PS- ABC No:of CiNes Fig.6 Comparison of performance of 3 algorithms for n number of cities in 50 iteration Time No:of CiNes ABC I- ABC PS- ABC Fig. 7 Comparison of performance of 3 algorithms for n number of cities in terms of time Conclusion The optimization algorithms are mainly used for solving the NP-hard optimization problems. In this work the variants of ABC algorithm are presented aiming at minimizing the distance of the tour and also find the correspondent optimal path. For obtaining the performance the original ABC algorithm is compared with the variants of ABC algorithm (I-ABC and PS-ABC). The results show that the PS-ABC performs well in finding the shortest distance within the minimum span of time when compared to I-ABC and ABC algorithms. 2013, - TIJCSA All Rights Reserved 107
12 References [1] J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, [2] D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley, Boston, [3] R.C. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, [4] M. Dorigo, V. Maniezzo, A. Colorni, The ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems Man and Cybernetics PartB- Cybernetics 26 (1), 29 41, [5] T. Xiang, X. Liao, K.-W. Wong, An improved particle swarm optimization algorithm combined with piecewise linear chaotic map, Applied Mathematics and Computation 190, , [6] Yu Bin, An improved ant colony optimization for vehicle routing problem, European Journal of Operational Research 196, , 2009 [7] S. Kirkpatrick, C.D. Gelatto, M.P. Vecchi, Optimization by simulated annealing, Science 220, , [8] D. Karaboga, An idea based on honey bee swarm for numerical optimization, Erciyes University, Kayseri, Turkey, Technical Report-TR06, [9] D. Karaboga, B. Akay, A comparative study of artificial bee colony algorithm,applied Mathematics and Computation 214, , [10] L.Wong, M.Low,An Efficient Bee Colony Optimization Algorithm for Traveling Salesman Problem using Frequency-based Pruning, School of Computer Engineering, Nanyang Technological University. [11] T. Dereli, G.S. Das, A hybrid bee(s) algorithm for solving container loading problems, Applied Soft Computing 11, , [12] K. Ziarati, R. Akbari, V. Zeighami, On the performance of bee algorithms for resourceconstrained project scheduling problem, Applied Soft Computing 11, , [13] P. Pawar, R. Rao, J. Davim, Optimization of process parameters of milling process using particle swarm optimization and artificial bee colony algorithm, International Conference on Advances in Mechanical Engineering, [14] R.S. Rao, S. Narasimham, M. Ramalingaraju, Optimization of distribution network configuration for loss reduction using artificial bee colony algorithm, International Journal of Electrical Power and Energy Systems Engineering (IJEPESE) 1, , [15] D. Karaboga, A Combinatorial Artificial Bee Colony Algorithm for Traveling Salesman Problem, IEEE Transactions, 50-53, [16] Ashita S. Bhagade, Artificial Bee Colony (ABC) Algorithm for Vehicle Routing Optimization Problem, International Journal of Soft Computing and Engineering (IJSCE), , Volume-2, Issue-2, May [17] Li. G., Niu. P., Xiao. X., Development and Investigation of Efficient Artificial Bee Colony Algorithm for Numerical Function Optimization, Applied Soft Computing 12, , , - TIJCSA All Rights Reserved 108
13 [18] R. Venkata Rao, P.J. Pawar, Parameter optimization of a multi-pass milling process using non-traditional optimization algorithms, Applied Soft Computing 10, , AUTHOR S PROFILE Ginnu George received her B.Tech from Sri Subramanya college of Engineering and Technology, affiliated to Anna University and currently doing M.tech in Karunya University. Dr. Kumudha Raimond received her B.E from Arulmigu Meenakshi Amman College of Engineering, affiliated to Madras University and M.E from Government College of Technology, Coimbatore and Doctoral degree from Indian Institute of Technology, Madras, India. Her area of expertise is in intelligent systems. She is a Senior Member of International Association of Computer Science and Information Technology (IACSIT) and Member of Machine Intelligence Research Lab: Scientific Network for Innovation and Research Excellence. 2013, - TIJCSA All Rights Reserved 109
Optimization of Benchmark Functions Using Artificial Bee Colony (ABC) Algorithm
IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719 Vol. 3, Issue 10 (October. 2013), V4 PP 09-14 Optimization of Benchmark Functions Using Artificial Bee Colony (ABC) Algorithm
More informationArtificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems Dervis Karaboga and Bahriye Basturk Erciyes University, Engineering Faculty, The Department of Computer
More informationArtificial bee colony algorithm with multiple onlookers for constrained optimization problems
Artificial bee colony algorithm with multiple onlookers for constrained optimization problems Milos Subotic Faculty of Computer Science University Megatrend Belgrade Bulevar umetnosti 29 SERBIA milos.subotic@gmail.com
More informationTravelling Salesman Problem Using Bee Colony With SPV
International Journal of Soft Computing and Engineering (IJSCE) Travelling Salesman Problem Using Bee Colony With SPV Nishant Pathak, Sudhanshu Prakash Tiwari Abstract Challenge of finding the shortest
More informationQuick Combinatorial Artificial Bee Colony -qcabc- Optimization Algorithm for TSP
Quick Combinatorial Artificial Bee Colony -qcabc- Optimization Algorithm for TSP 97 Beyza Gorkemli Department of Computer Engineering Erciyes University Kayseri, TURKEY bgorkemli@erciyes.edu.tr Abstract
More informationEnhanced ABC Algorithm for Optimization of Multiple Traveling Salesman Problem
I J C T A, 9(3), 2016, pp. 1647-1656 International Science Press Enhanced ABC Algorithm for Optimization of Multiple Traveling Salesman Problem P. Shunmugapriya 1, S. Kanmani 2, R. Hemalatha 3, D. Lahari
More informationABC Optimization: A Co-Operative Learning Approach to Complex Routing Problems
Progress in Nonlinear Dynamics and Chaos Vol. 1, 2013, 39-46 ISSN: 2321 9238 (online) Published on 3 June 2013 www.researchmathsci.org Progress in ABC Optimization: A Co-Operative Learning Approach to
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 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 informationUsing 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 informationComparison between Different Meta-Heuristic Algorithms for Path Planning in Robotics
Comparison between Different Meta-Heuristic Algorithms for Path Planning in Robotics Yogita Gigras Nikita Jora Anuradha Dhull ABSTRACT Path planning has been a part of research from a decade and has been
More informationRELEVANCE OF ARTIFICIAL BEE COLONY ALGORITHM OVER OTHER SWARM INTELLIGENCE ALGORITHMS
RELEVANCE OF ARTIFICIAL BEE COLONY ALGORITHM OVER OTHER SWARM INTELLIGENCE ALGORITHMS Punam Bajaj Assistant Professor Department of Computer Engineering Chandigarh Engineering College, Landran Punjab,
More informationChaotic Bee Swarm Optimization Algorithm for Path Planning of Mobile Robots
Chaotic Bee Swarm Optimization Algorithm for Path Planning of Mobile Robots Jiann-Horng Lin and Li-Ren Huang Department of Information Management I-Shou University, Taiwan jhlin@isu.edu.tw Abstract: -
More informationRobust Descriptive Statistics Based PSO Algorithm for Image Segmentation
Robust Descriptive Statistics Based PSO Algorithm for Image Segmentation Ripandeep Kaur 1, Manpreet Kaur 2 1, 2 Punjab Technical University, Chandigarh Engineering College, Landran, Punjab, India Abstract:
More informationA Survey on Feature Extraction Techniques for Palmprint Identification
International Journal Of Computational Engineering Research (ijceronline.com) Vol. 03 Issue. 12 A Survey on Feature Extraction Techniques for Palmprint Identification Sincy John 1, Kumudha Raimond 2 1
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 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 informationOptimistic Path using Artificial Bee Colony Approach
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 13 (2014), pp. 1255-1261 International Research Publications House http://www. irphouse.com Optimistic Path
More informationParticle Swarm Optimization Based Approach for Location Area Planning in Cellular Networks
International Journal of Intelligent Systems and Applications in Engineering Advanced Technology and Science ISSN:2147-67992147-6799 www.atscience.org/ijisae Original Research Paper Particle Swarm Optimization
More informationGA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les
Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,
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 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 informationAn Improved Association Rule Mining Approach to Reduce Iterations in Ant Colony Algorithm through Artificial Bee Colony Algorithm
An Improved Association Rule Mining Approach to Reduce Iterations in Ant Colony Algorithm through Artificial Bee Colony Algorithm Girish Kumar Ameta M.Tech Scholar, Arya College of Engineering & Information
More informationA META-HEURISTIC APPROACH TO LOCATE OPTIMAL SWITCH LOCATIONS IN CELLULAR MOBILE NETWORKS
University of East Anglia From the SelectedWorks of Amin Vafadarnikjoo Fall October 8, 2015 A META-HEURISTIC APPROACH TO LOCATE OPTIMAL SWITCH LOCATIONS IN CELLULAR MOBILE NETWORKS Amin Vafadarnikjoo Seyyed
More informationEnhanced Artificial Bees Colony Algorithm for Robot Path Planning
Enhanced Artificial Bees Colony Algorithm for Robot Path Planning Department of Computer Science and Engineering, Jaypee Institute of Information Technology, Noida ABSTRACT: This paper presents an enhanced
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 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 informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationParticle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm
Particle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm Oğuz Altun Department of Computer Engineering Yildiz Technical University Istanbul, Turkey oaltun@yildiz.edu.tr
More informationHybrid approach for solving TSP by using DPX Cross-over operator
Available online at www.pelagiaresearchlibrary.com Advances in Applied Science Research, 2011, 2 (1): 28-32 ISSN: 0976-8610 CODEN (USA): AASRFC Hybrid approach for solving TSP by using DPX Cross-over operator
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 informationInnovative Systems Design and Engineering ISSN (Paper) ISSN (Online) Vol.5, No.1, 2014
Abstract Tool Path Optimization of Drilling Sequence in CNC Machine Using Genetic Algorithm Prof. Dr. Nabeel Kadim Abid Al-Sahib 1, Hasan Fahad Abdulrazzaq 2* 1. Thi-Qar University, Al-Jadriya, Baghdad,
More informationPower Load Forecasting Based on ABC-SA Neural Network Model
Power Load Forecasting Based on ABC-SA Neural Network Model Weihua Pan, Xinhui Wang College of Control and Computer Engineering, North China Electric Power University, Baoding, Hebei 071000, China. 1471647206@qq.com
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 informationABCRNG - Swarm Intelligence in Public key Cryptography for Random Number Generation
Intern. J. Fuzzy Mathematical Archive Vol. 6, No. 2, 2015,177-186 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 22 January 2015 www.researchmathsci.org International Journal of ABCRNG - Swarm Intelligence
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationIn recent years several different algorithms
Journal of Advances in Computer Engineering and Technology, 3(2) 2017 A hybrid meta-heuristic algorithm based on ABC and Firefly algorithms Azita yousefi 1, Bita amirshahi 2 Received (2015-10-09) Accepted
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 Hybrid Fireworks Optimization Method with Differential Evolution Operators
A Fireworks Optimization Method with Differential Evolution Operators YuJun Zheng a,, XinLi Xu a, HaiFeng Ling b a College of Computer Science & Technology, Zhejiang University of Technology, Hangzhou,
More informationA Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-3, Issue-6, January 2014 A Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
More informationORDER BASED EMIGRANT CREATION STRATEGY FOR PARALLEL ARTIFICIAL BEE COLONY ALGORITHM. Department, Antalya, Turkey. Samsun, Turkey
ORDER BASED EMIGRANT CREATION STRATEGY FOR PARALLEL ARTIFICIAL BEE COLONY ALGORITHM Alperen AKSOY 1,+, Selçuk ASLAN 2, Derviş KARABOĞA 3 1 Alanya Alaaddin Keykubat University, Engineering Faculty, Computer
More informationDistribution System Network Reconfiguration by using Artificial Bee Colony Algorithm.
IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 9, Issue 1 Ver. I (Jan. 2014), PP 48-52 Distribution System Network Reconfiguration by using
More informationKhushboo Arora, Samiksha Agarwal, Rohit Tanwar
International Journal of Scientific & Engineering Research, Volume 7, Issue 1, January-2016 1014 Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison Khushboo Arora,
More informationSolving Constraint Satisfaction Problems by Artificial Bee Colony with Greedy Scouts
, 23-25 October, 2013, San Francisco, USA Solving Constraint Satisfaction Problems by Artificial Bee Colony with Greedy Scouts Yuko Aratsu, Kazunori Mizuno, Hitoshi Sasaki, Seiichi Nishihara Abstract In
More informationNew Method for Accurate Parameter Estimation of Induction Motors Based on Artificial Bee Colony Algorithm
New Method for Accurate Parameter Estimation of Induction Motors Based on Artificial Bee Colony Algorithm Mohammad Jamadi Zanjan, Iran Email: jamadi.mohammad@yahoo.com Farshad Merrikh-Bayat University
More informationHandling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization
Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Richa Agnihotri #1, Dr. Shikha Agrawal #1, Dr. Rajeev Pandey #1 # Department of Computer Science Engineering, UIT,
More informationHybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques
Hybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques Nasser Sadati Abstract Particle Swarm Optimization (PSO) algorithms recently invented as intelligent optimizers with several highly
More informationIMPROVED ARTIFICIAL FISH SWARM ALGORITHM AND ITS APPLICATION IN OPTIMAL DESIGN OF TRUSS STRUCTURE
IMPROVED ARTIFICIAL FISH SWARM ALGORITHM AD ITS APPLICATIO I OPTIMAL DESIG OF TRUSS STRUCTURE ACAG LI, CHEGUAG BA, SHUJIG ZHOU, SHUAGHOG PEG, XIAOHA ZHAG College of Civil Engineering, Hebei University
More informationAfrican Buffalo Optimization (ABO): a New Meta-Heuristic Algorithm
Journal of Advanced & Applied Sciences (JAAS) Volume 03, Issue 03, Pages 101-106, 2015 ISSN: 2289-6260 African Buffalo Optimization (ABO): a New Meta-Heuristic Algorithm Julius Beneoluchi Odili*, Mohd
More informationA Hybrid Method to Solve Travelling Salesman Problem
A Hybrid Method to Solve Travelling Salesman Problem Bharati T Pandhare, Prof. Y R Kalshetty, M.E Student, Department of Computer Science & Engineering, SVERI COE Pandharpur, Maharashtra, India Associate
More informationModified Order Crossover (OX) Operator
Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.
More informationMobile Robot Path Planning in Static Environments using Particle Swarm Optimization
Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization M. Shahab Alam, M. Usman Rafique, and M. Umer Khan Abstract Motion planning is a key element of robotics since it empowers
More informationSIMULATION APPROACH OF CUTTING TOOL MOVEMENT USING ARTIFICIAL INTELLIGENCE METHOD
Journal of Engineering Science and Technology Special Issue on 4th International Technical Conference 2014, June (2015) 35-44 School of Engineering, Taylor s University SIMULATION APPROACH OF CUTTING TOOL
More informationTraffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization
Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,
More informationOpportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem
Opportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem arxiv:1709.03793v1 [cs.ne] 12 Sep 2017 Shubham Dokania, Sunyam Bagga, and Rohit Sharma shubham.k.dokania@gmail.com,
More informationA SURVEY OF COMPARISON BETWEEN VARIOUS META- HEURISTIC TECHNIQUES FOR PATH PLANNING PROBLEM
A SURVEY OF COMPARISON BETWEEN VARIOUS META- HEURISTIC TECHNIQUES FOR PATH PLANNING PROBLEM Toolika Arora, Yogita Gigras, ITM University, Gurgaon, Haryana, India ABSTRACT Path planning is one of the challenging
More informationNetwork Routing Protocol using Genetic Algorithms
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a
More informationArtificial Bee Colony based Test Data Generation for Data-Flow Testing
Indian Journal of Science and Technology, Vol 9(39), DOI: 10.17485/ijst/2016/v9i39/100733, October 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Artificial Bee Colony based Test Data Generation
More informationInternational Journal of Information Technology and Knowledge Management (ISSN: ) July-December 2012, Volume 5, No. 2, pp.
Empirical Evaluation of Metaheuristic Approaches for Symbolic Execution based Automated Test Generation Surender Singh [1], Parvin Kumar [2] [1] CMJ University, Shillong, Meghalya, (INDIA) [2] Meerut Institute
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 informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationACCELERATING THE ANT COLONY OPTIMIZATION
ACCELERATING THE ANT COLONY OPTIMIZATION BY SMART ANTS, USING GENETIC OPERATOR Hassan Ismkhan Department of Computer Engineering, University of Bonab, Bonab, East Azerbaijan, Iran H.Ismkhan@bonabu.ac.ir
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 informationDISTANCE EVALUATED SIMULATED KALMAN FILTER FOR COMBINATORIAL OPTIMIZATION PROBLEMS
DISTANCE EVALUATED SIMULATED KALMAN FILTER FOR COMBINATORIAL OPTIMIZATION PROBLEMS Zulkifli Md Yusof 1, Zuwairie Ibrahim 1, Ismail Ibrahim 1, Kamil Zakwan Mohd Azmi 1, Nor Azlina Ab Aziz 2, Nor Hidayati
More informationABC Analysis For Economic operation of power system
ABC Analysis For Economic operation of power system 1 Prachi Shukla, 2.Alka Thakur 1 M.tech Schlor, Electrical Department, SSSUTMS, M.P.India 2 Associate Professor, Electrical Department, SSSUTMS, M.P.India
More informationIJAMS CNC TURNING PROCESS OPTIMIZATION USING BIO-INSPIRED ALGORITHM. R. S. S. Prasanth 1, K. Hans Raj 1
IJAMS CNC TURNING PROCESS OPTIMIZATION USING BIO-INSPIRED ALGORITHM R. S. S. Prasanth 1, K. Hans Raj 1 1 Dayalbagh Educational Institute, Dayalbagh, Agra 282110, INDIA rss.prasanth@gmail.com, khansraj@rediffmail.com
More informationAn Improved Tree Seed Algorithm for Optimization Problems
International Journal of Machine Learning and Computing, Vol. 8, o. 1, February 2018 An Improved Tree Seed Algorithm for Optimization Problems Murat Aslan, Mehmet Beskirli, Halife Kodaz, and Mustafa Servet
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 informationPerformance Comparison of Genetic Algorithm, Particle Swarm Optimization and Simulated Annealing Applied to TSP
Performance Comparison of Genetic Algorithm, Particle Swarm Optimization and Simulated Annealing Applied to TSP Madhumita Panda Assistant Professor, Computer Science SUIIT, Sambalpur University. Odisha,
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 informationDynamic Capacity Routing in Networks with MTSP
Dynamic Capacity Routing in Networks with MTSP Ranjana Ponraj1*, George Amalanathan2 1 Hindustan 2 University, Chennai, Tamil Nadu, India. Periyar Maniammai University, Thanjavur, Tamil Nadu, India. *
More informationPerformance Analysis of Min-Min, Max-Min and Artificial Bee Colony Load Balancing Algorithms in Cloud Computing.
Performance Analysis of Min-Min, Max-Min and Artificial Bee Colony Load Balancing Algorithms in Cloud Computing. Neha Thakkar 1, Dr. Rajender Nath 2 1 M.Tech Scholar, Professor 2 1,2 Department of Computer
More informationMETHODOLOGY FOR SOLVING TWO-SIDED ASSEMBLY LINE BALANCING IN SPREADSHEET
METHODOLOGY FOR SOLVING TWO-SIDED ASSEMBLY LINE BALANCING IN SPREADSHEET Salleh Ahmad Bareduan and Salem Abdulsalam Elteriki Department of Manufacturing and Industrial Engineering, University Tun Hussein
More informationA Parallel Simulated Annealing Algorithm for Weapon-Target Assignment Problem
A Parallel Simulated Annealing Algorithm for Weapon-Target Assignment Problem Emrullah SONUC Department of Computer Engineering Karabuk University Karabuk, TURKEY Baha SEN Department of Computer Engineering
More informationSci.Int.(Lahore),28(1), ,2016 ISSN ; CODEN: SINTE 8 201
Sci.Int.(Lahore),28(1),201-209,2016 ISSN 1013-5316; CODEN: SINTE 8 201 A NOVEL PLANT PROPAGATION ALGORITHM: MODIFICATIONS AND IMPLEMENTATION Muhammad Sulaiman 1, Abdel Salhi 2, Eric S Fraga 3, Wali Khan
More informationSolving the Shortest Path Problem in Vehicle Navigation System by Ant Colony Algorithm
Proceedings of the 7th WSEAS Int. Conf. on Signal Processing, Computational Geometry & Artificial Vision, Athens, Greece, August 24-26, 2007 88 Solving the Shortest Path Problem in Vehicle Navigation System
More informationAn Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm
An Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm Prabha S. 1, Arun Prabha K. 2 1 Research Scholar, Department of Computer Science, Vellalar
More informationANANT COLONY SYSTEMFOR ROUTING IN PCB HOLES DRILLING PROCESS
International Journal of Innovative Management, Information & Production ISME International c2013 ISSN 2185-5439 Volume 4, 1, June 2013 PP. 50-56 ANANT COLONY SYSTEMFOR ROUTING IN PCB HOLES DRILLING PROCESS
More informationParticle Swarm Optimization Algorithm for Multisalesman Problem with Time and Capacity Constraints
Appl. Math. Inf. Sci. 7, No. 6, 2439-2444 (2013) 2439 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/070637 Particle Swarm Optimization Algorithm for
More informationArtificial Bee Colony Algorithm Optimization for Human-machine Interface Layout of Cabin Driver's Desk
Artificial Bee Colony Algorithm Optimization for Human-machine Interface Layout of Cabin Driver's Desk 1 School of Art and Design, Xi an University of Technology Xi an, 710054, China E-mail: ekinshow@sina.com
More informationTracking Changing Extrema with Particle Swarm Optimizer
Tracking Changing Extrema with Particle Swarm Optimizer Anthony Carlisle Department of Mathematical and Computer Sciences, Huntingdon College antho@huntingdon.edu Abstract The modification of the Particle
More informationHybrid Approach for Energy Optimization in Wireless Sensor Networks
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 International Conference
More informationA Comparative Study on Nature Inspired Algorithms with Firefly Algorithm
International Journal of Engineering and Technology Volume 4 No. 10, October, 2014 A Comparative Study on Nature Inspired Algorithms with Firefly Algorithm M. K. A. Ariyaratne, T. G. I. Fernando Department
More informationResearch Article Polygonal Approximation Using an Artificial Bee Colony Algorithm
Mathematical Problems in Engineering Volume 2015, Article ID 375926, 10 pages http://dx.doi.org/10.1155/2015/375926 Research Article Polygonal Approximation Using an Artificial Bee Colony Algorithm Shu-Chien
More informationFast Artificial Bee Colony for Clustering
Informatica 42 (2018) 211 219 211 Fast Artificial Bee Colony for Clustering Abba Suganda Girsang Computer Science Department, BINUS Graduate Program - Master of Computer Science Bina Nusantara University,
More informationProviding new meta-heuristic algorithm for optimization problems inspired by humans behavior to improve their positions
Providing new meta-heuristic algorithm for optimization problems inspired by humans behavior to improve their positions Azar,Adel 1 ; Seyedmirzaee, Seyedmoslem* 2 1- Professor of management, Tarbiatmodares
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 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 informationPerformance Analysis of Shortest Path Routing Problem using Heuristic Algorithms
Performance Analysis of Shortest Path Routing Problem using Heuristic Algorithms R. Somasundara Manikandan 1 1 Department of Computer Science, Raja Doraisingam Govt. Arts College, Sivaganga, Tamilnadu,
More informationParallel Artificial Bee Colony (PABC) for Job Shop Scheduling Problems Sudip Kumar Sahana, Indrajit Mukherjee, Prabhat Kumar Mahanti
1 Sudip Kumar Sahana, 2 Indrajit Mukherjee, 3 Prabhat Kumar Mahanti 1, First Author Dept. of Computer Science & Engineering, Birla Institute of Technology, Mesra., E-mail: 1 sudipsahana@bitmesra.ac.in
More informationPre-requisite Material for Course Heuristics and Approximation Algorithms
Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
More informationComparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems
Australian Journal of Basic and Applied Sciences, 4(8): 3366-3382, 21 ISSN 1991-8178 Comparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems Akbar H. Borzabadi,
More informationA Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem
2011, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com A Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem Mohammad
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 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 informationArgha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India.
Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Training Artificial
More informationGRID SCHEDULING USING ENHANCED PSO ALGORITHM
GRID SCHEDULING USING ENHANCED PSO ALGORITHM Mr. P.Mathiyalagan 1 U.R.Dhepthie 2 Dr. S.N.Sivanandam 3 1 Lecturer 2 Post Graduate Student 3 Professor and Head Department of Computer Science and Engineering
More informationArtificial Bee Colony Algorithm using MPI
Artificial Bee Colony Algorithm using MPI Pradeep Yenneti CSE633, Fall 2012 Instructor : Dr. Russ Miller University at Buffalo, the State University of New York OVERVIEW Introduction Components Working
More informationHABCO: A Robust Agent on Hybrid Ant-Bee Colony Optimization
TELKOMNIKA, Vol. 15, No. 3, September 2017, pp. 1247 1256 ISSN: 1693-6930, accredited A by DIKTI, Decree No: 58/DIKTI/Kep/2013 DOI: 10.12928/telkomnika.v15.i3.3656 1247 HABCO: A Robust Agent on Hybrid
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 information