Open Access Research on Traveling Salesman Problem Based on the Ant Colony Optimization Algorithm and Genetic Algorithm
|
|
- Beverley Hodge
- 5 years ago
- Views:
Transcription
1 Send Orders for Reprints to The Open Automation and Control Systems Journal, 2015, 7, Open Access Research on Traveling Salesman Problem Based on the Ant Colony Optimization Algorithm and Genetic Algorithm Yu Chen * and Yanmin Jia School of Civil Engineering, Northeast Forestry University, Harbin , China Abstract: In this paper, we prompt a new multi-dimensional algoithm to solve the traveling salesman problem based on the ant colony optimization algorithm and genetic algorithm. Ant Colony Optimization (ACO) is a heuristic algorithm which has been proven a successful technique and applied to a number of combinatorial optimization (CO) problems. The traveling salesman problem (TSP) is one of the most important combinatorial problems. ACO is taken as one of the high performance computing methods for TSP. It still has some drawbacks such as stagnation behavior, long computational time, and premature convergence problem of the basic ACO algorithm on TSP. Those problems will be more obvious when the considered problems size increases. The proposed system based on basic ACO algorithm with well distribution strategy and information entropy which is conducted on the configuration strategy for updating the heuristic parameter in ACO to improve the performance in solving TSP. Then, ACO for TSP has been improved by incorporating local optimization heuristic. Algorithms are tested on benchmark problems from TSPLIB and test results are presented. From our experiments, the proposed algorithm has better performance than ACO algorithm. Keywords: Traveling Salesman Problem, Collabrative Algorithm, Ant Colony Optimization Algorithm, Genetic Algorithm. 1. INTRODUCTION In recent years, many research works have been devoted to ant colony optimization (ACO) techniques in different areas. It is a relatively novel meta-heuristic technique and has been successfully used in many applications especially problems in combinatorial optimization. ACO algorithm models the behavior of real ant colonies in establishing the shortest path between food sources and nests. Ants can communicate with one another through chemicals called pheromones in their immediate environment. The ants release pheromone on the ground while walking from their nest to food and then go back to the nest. The ants move according to the amount of pheromones, the richer the pheromone trail on a path is, the more likely it would be followed by other ants. So a shorter path has a higher amount of pheromone in probability, ants will tend to choose a shorter path. Through this mechanism, ants will eventually find the shortest path. Artificial ants imitate the behavior of real ants, but can solve much more complicated problem than real ants can. ACO has been widely applied to solving various combinatorial optimization problems such as Traveling Salesman Problem (TSP), Job-shop Scheduling Problem (JSP) [1, 2], Vehicle Routing Problem (VRP), Quadratic Assignment Problem (QAP), etc. Although ACO has a powerful capacity to find out solutions to combinational optimization problems, it has the problems of stagnation and premature convergence and the convergence speed of ACO is very slow. Those *Address correspondence to this author at the School of Civil Engineering, Northeast Forestry University, Harbin , China; Tel: ; @qq.com problems will be more obvious when the problem size in creases [3]. Therefore, several extensions and improvements versions of the original ACO algorithm were introduced over the years. Various adaptations: dynamic control of solution construction [4], emergence of local search [5, 6], a strategy is to partition artificial ants into two groups: scout ants and common ants [7] and new pheromone updating strategies [8], using candidate lists strategies are studied to improve the quality of the final solution and lead to speedup of the algorithm. All these studies have contributed to the improvement of the ACO to some extents, but they have little obvious effect on increasing the convergence speed and obtaining the global optimal solution. In the proposed system, the main modifications introduced by ACO are the following. First, to avoid search stagnation and ACO is more effective if ants are initially placed on different cities. Second, information entropy is introduced which is adjust the algorithm's parameters. Additionally, the best performing ACO algorithms for the TSP improve the solutions generated by the ants using local search algorithms. The experiment results show that the algorithm proposed in this study can substantially increase the convergence speed of the ACO. In this paper, an improved ant colony optimization algorithm is developed for solving TSP. This algorithm is used to produce near-optimal solutions to the TSP. Evolution Algorithms are widely used optimization algorithm based on Darwinism. In Darwinism, evolution is based on survival of the fittest. Creatures do not have the ability of deciding their mutation directions and choosing advantageous gene to their offspring. But based on the researches in biology, this stochastic evolution theory could not explain some problems in creature's adaptability / Bentham Open
2 1330 The Open Automation and Control Systems Journal, 2015, Volume 7 Chen and Jia The modern biology research shows that the evolution process is not completely stochastic. Such as stress-induced mutation mechanisms were proposed. Specifically, when creatures are maladapted to their environment, that is, when they are stressed, stress-induced mutation mechanisms produce mutations. This theory could be introduced into evolution algorithms in solving some optimization problems. In this paper, an approximate algorithm combining P systems and active evolution algorithm (AEAPS) is proposed in order to solve traveling salesman problems (TSPs} in the special case of complete graphs with Euclidean distance. It follows the nested membrane structure adopted by Nishida, and adopts genetic algorithm (GA)tab search and active evolution algorithm (AEA) as the sub algorithms. The experiments results are compared with Nishida's algorithms and some others. 2. THE BACKGROUND AND FRAME WORK OF GENETIC ALGORITHM Genetic algorithm is the late 1960s and early 1970s, by John Holland and his colleagues at the University of Michgan American student research a method of forming the study. In this method, mechanism simulation of biological evolution Model to construct artificial system, has been widely used in recent years. From Traditional BP neural network algorithm slow convergence and easy to fall into Local minima shortcomings, this paper based on genetic algorithm BP Network mechanisms to improve the convergence speed of the network, and then using the improved BP Neural networks for evaluation of the level of the university library information. In this paper, three-layer BP network, shown in Fig. (1). BP network three Layer nodes are represented, m input nodes x i (each two indicators), in a hidden layer node h j, 1 output node y. Network power input nodes and hidden layer nodes Value w ij, network nodes and the output power hidden layer nodes is t j. Each index can score from reviewer s subjective scoring method after obtaining. The data to be using equation (1) is normalized. x i = x i b i a i b i (1) Fig. (1). Three BP neural network. Where x i and x i respectively represent the i-th index and the actual value standard value; a i, b i are the maximum, minimum, the i-th index. Known evaluation indexes m, n hidden layer nodes depending Problems and experimental data to determine, you can also experience the value of the formula (2) the decision. n = log 2 m (2) Hidden node output is calculated as follows: h j = f m i =1 w ij x i j (3) Where j is the threshold value for hidden node. The output of the output node is calculated as follows: f m i =1 w ij x i j = f f j Where in is an output node threshold. ( ( )) (4) Equation (3) and Equation (4) in the transfer function is generally expressed as (0,1) interval of S-type function: 1 f ( x)= (5) x 1+ e Using genetic algorithm to train the neural network can be used in binary code, code String value from the hidden layer to the input layer connection weights w ij, hidden layer and output layer connection Weights t j, hidden layer threshold j, the output layer threshold. So connected together to form into a long string (the string corresponding to each position of a group of network weights and threshold Value), constitutes an individual. It can generate an initial population of N individuals. Guiding the evolutionary process toward the region of space may contain the best individual conduct. Suitable Select the function should have a great impact on the training results. This paper fitness Function uses a calculation error of the neural network (see equation 6), and the error. The greater the difference is, the smaller the fitness is. Always cut along the neural network output error fewer search direction, the convergence target is the minimum output error. 2 2 E = 1 N s ~s y N y (6) s Where y s =1 ~s, y, respectively, for the desired output and the actual output, N for training. Training samples, then the fitness function is: f ( X s )= 1 E Which, Xs represents one individual. The basic genetic algorithm by selection, crossover and mutation operators constitute three. Select operation is based assessment in groups of individual fitness value Conduct random roulette method adopted in this algorithm on the basis of estimates Selection. Each chromosome number of (7)
3 Research on Traveling Salesman Problem The Open Automation and Control Systems Journal, 2015, Volume offspring produced. According to individual fitness the order value is converted to the corresponding selection probability, a large fitness value corresponding High probability of selection, small fitness value corresponding to a low probability of selection [2], each chromosome Selection probability p s. The formula is: p s = c ( 1 c ) s 1 (8) Where the parameter c is the probability of an individual that is selected the first sorting. In the selection wheel when using binary search method to effectively reduce A small number of comparisons to ensure that the corresponding roulette found (N in O (1og N) For population size, the number of training samples). When using consistent cross crossover method (ie, word by setting shield The entire body of inherited genes determine the two parent individuals in which the individual The corresponding gene, wherein the shield is a randomly generated word and individual encoding result 0/1 sequence identical configurations). When variation in a population of randomly selected individuals, mutation operator Loci child adoption, the basic steps are as follows: start with groups of individuals compiled Code string randomly selected one or more loci, and then follow the variation The probability of each generation after the completion of genetic manipulation, for a new generation of individual error and evaluate the fitness value, to identify the best individual, the optimal individual two-step gradient descent local search, and put out a search of the directly into the body of the new generation of the population, if the learning error achieve accuracy or up to specify the genetic algebra calculation is determinate. So after more than genetic luck count, you can get BP neural network error minimum set of complete initial Weights and thresholds. Genetic networks by BP's initial iterations to get the right value and threshold for normal network training decoded offspring into BP neural network until the end of the study. This method using genetic algorithms to search after the near global optimum, then using BP algorithm local search such BP algorithm can quickly and accurately converge near the solution point, final get the problem global minimum. In this way, both to avoid the BP neural network into local minimum value and BP neural network can quickly close convergence, greatly improving the accuracy and speed of the BP neural network. The BP neural network is widely used mainly for the following advantages: giant parallel distribution makes the processing speed greatly; the distribution of knowledge information is stored in network connection and threshold that has strong fault-tolerance. Although BP network model has many advantages in all aspects, but also has some deficiencies: from the view of mathematics, it is a nonlinear optimization problem and inevitably there exists local minimum points; study algorithm is very slow; the selection of network hidden nodes with great blindness, and there are no empirical theoretically instructions and etc. Therefore, these disadvantages greatly limit the application and promotion of the BP neural network. The paper establishes the highway project construction risk prediction model, mainly using genetic algorithms and BP network combination to improve the performance of BP network, on the basis of series of improvement such as the sample data pretreatment, optimize network hidden nodes, introducing momentum, adaptive adjustments network parameters. Genetic algorithm is a search algorithm based on natural selection and genetic mechanisms for groups, and simulates the course of reproduction, and the interbreeding in the process of a natural and genetic selection. Using genetic algorithm, every possible solution is coded as "a chromosome", namely the individual, a number of individuals form groups (all possible solutions). Genetic algorithm is the process of evolution generational group which is the community of a feasible solution. The genetic algorithm begins, always randomly generated some individuals (i.e. initial weights and threshold), according to the predetermined target function (i.e. the error function) for each individual evaluation, then gives a fitness value. Based on the fitness value, choose the individual to copy the next generation. Choosing reflects the operation principle of "survival of the fittest", "good" individual was used to copy, and the "bad" individual will be eliminated. Then the individual combined the intersection and operator variations to create a new generation. This is a new group of individual which inherited some excellent characters of the generation, thus the performance is superior to the generation, so gradually toward more optimal threshold value and the direction of evolution. When the evolution reached accuracy requirement, and can be asked during a series of network weights and threshold. The GA search always pervades all of the space, which is good at the global search; While BP neural network for local search is more effective. Therefore, both of them combine and complement with each other. First use genetic algorithms to optimize BP neural network, set a good search spaces, then use BP algorithm to search out the optimal solution in this little space. 3. THE BASIC ACO ALGORITHM In this section we introduce the basic ACO algorithm. We decided to use the well-known traveling salesman problem as benchmark, in order to make the comparison with other heuristic approaches easier. Given a set of ri towns, the TSP can be stated as the problem of finding a minimal length closed tour that visits each town once. We call d ij the length of the path between towns i and j. In the case of Euclidean TSP, d ij is the Euclidean distance between i and j (i.e., d ij = (x i x j ) 2 + ( y i y j ) 2 ). An instance of the TSP is given by a graph(n,e), where N is the set of towns and E is the set of edges between towns (a fully connected graph in
4 1332 The Open Automation and Control Systems Journal, 2015, Volume 7 Chen and Jia the Euclidean TSP). Let b i (t ) (i=1,2,...,n) be the number of ants in town at time t and let m = b i (t ) be the total number of ants. Each ant is a simple agent with the following characteristics: it chooses the town to go to with a probability that is a function of the town distance and of the amount of trail present on the connecting edge to force the ant to make legal tours, transitions to already visited towns are disallowed until a tour is completed (this is controlled by a labu list). When it completes a tour, it lays a substance called trail on each edge (i,j) visited. Let ij (t ) be the intensity of trail on edge (i,j) at time t. Each ant at time t chooses the next town, where it will be at time t+1. Therefore, if we call an iteration of the ACO algorithm the m moves carried out by the m ants in the interval (t,t+1), then every n iterations of the algorithm (which we call a cycle) each ant has completed a tour. At this point the trail intensity is updated according to the following formula: ij (t + n) = ij (t ) + ij (9) where evaporation is a coefficient such that (1- ) represents the of trail between time t and t+n m k ij = ij (10) k =1 Where k ij is the quantity per unit of length of trail substance (pheromone in real ants) laid on edge (i,j) by the k-th ant between time t and t+n. It is given by n i =1 if k th ant uses Q edge (i, j) in its tour L K (between time t and t+n) k ij = 0 otherwise (11) where Q is a constant and L k is the tour length of the k-th ant. The coefficient must be set to a value <1 to avoid unlimited accumulation of trail. In our experiments, we set the intensity of trail at time 0, ij (0), to a small positive constant c. In order to satisfy the constraint that an ant visits all the n different towns, we associate with each ant a data structure called the tabu list, that saves the towns already visited up to time t and forbids the ant to visit them again before n iterations (a tour) have been completed. When a tour is completed, the lobo list is used to compute the ant's current solution (i.e., the distance of the path followed by the ant). The tabu list is then emptied and the ant is free again to choose. We define tabu k the dynamically growing vector, which contains the lobo list of the kth ant, tabu k the set obtained from the elements of tabu k and tabu k (s) the s-th element of the list (i.e., the s-th town visited by the k-th ant in the current tour). We call visibililty ij the quantity ij. This quantity is not modified during the run of the ACO algorithm, as opposed to the trail, which instead changes according to the previous formula (1). We define the transition probability from town i to town j for the k-th ant as where ij (t ) ij j allowed p k ij (t ) = is (t ) k is sallowed k 0 otherwise (12) allowed k = { N tabu k } (13) And where and are parameters that control the relative importance of trail versus visibility. Therefore the transition probability is a trade-off between visibility (which says that close towns should be chosen with high probability, thus implementing a greedy constructive heuristic) and trail intensity at time t (that says that if on edge (i, j) there has been a lot of traffic then it is highly desirable, thus implementing the autocatalytic process). In traditional ACO Algorithm, the initialization of the pheromone matrix is equal. Ants need iterate many numbers to find the best tour. We can generate a large amount of tours (e. g. 100 tours), and then we choose some better tours (e. g. 30 tours). At last ants lay trail only on these better tours. These trails affect following ants. When ant completes a tour, it always lays called trail on each edge visited. If the tour is worse, ant also lay the trail on each edge. These trails disturb the following ants, so the ACO algorithm's convergent speed is very slow. We can calculate the length of tour firstly and then we compare with the given value. If the length of tour is less than the given value, we update trail values. Otherwise don't update the trail values. The advantage of PSO algorithm method is that it use self information, individual best information and global best information. We can learn from genetic algorithm, and were arrange formula (12). The w v id can be regarded as mutation operator, and c 1 rand 1 ( p id x id ) + c 2 rand 2 ( p gd x id ) can be regarded as crossover operator. But the crossover operator happened between the individual with local optimum and global optimum.
5 Research on Traveling Salesman Problem The Open Automation and Control Systems Journal, 2015, Volume EXPERIMENTAL ANALYSIS This section compares the results of simulated annealing algorithm, genetic algorithm, ACO algorithm and hybrid algorithms on traveling salesman problem of 30 cities. The parameters of simulated annealing algorithm are set as follows: the initial temperature T=100000, the final temperature T 0 =1, and annealing velocity = 0.99.The parameters of the genetic algorithm optimization toolbox (GAOT) used to solving TSP are set as follows: the population N=30, the cross probability P c = 0.2 and the mutation probability P m = 0.5 The parameters of the hybrid algorithms are set as follows: =1.5, m=30, =2,and = rounds of computer simulation are conducted for each algorithm, and the results are shown in Fig. (2). The optimal tour of 30 cities by hybrid algorithm is shown in Fig. (3). All the 16 hybrid algorithms are proved effective. Especially the hybrid algorithm with across strategy B and mutation strategy B is a simple and effective better algorithm than others. The crossover operators of particle swarm optimization are different from those of genetic algorithm. In hybrid optimization, the crossover operator happened between the individual with local optimum and global optimum, so the capability of offspring got to be improved. Fig. (3). The optimal tour of 30 cities by hybrid algorithm. other algorithms. The following problems need to be considered. 1. The parameters and their effect on the performance of the optimization should be studied in more detail. 2. How to explore hybrid algorithm application to continuous space problem should be investigated. 3. The hybrid algorithm's convergent speed, or the efficiency, should be worth further investigating. 4. How to evaluate the quality of hybrid algorithm and other algorithms is still a problem. CONFLICT OF INTEREST The authors confirm that this article content has no conflict of interest. ACKNOWLEDGEMENTS This work is supported by the Research project of science and technology of Inner Mongolia communication and transportation bureau. REFERENCES Fig. (2). Testing result of algorithms. CONCLUSION In this paper, we presented a novel algorithm of genetic ant colony optimization (GACO) for traveling salesman problem. It keeps the advantages of ant colony optimization and GAs. From our simulation for those test problems, the proposed algorithm indeed can find the best solutions or optimal solutions. In other words, the proposed algorithm seems to have admirable performance. Experiments for benchmark problems show the hybrid algorithm better than [1] Q. Zhao, G. Zhao, and J. Y. Wang, University education level of information and comprehensive measure cooperative research, Intelligence Magazine, no. 6, pp , [2] J. Tai, W. Meleis, and J. Zhang, Adaptive resource allocation for cloud computing environments under bursty workloads, pp , Northeastern University, Boston, USA, [3] J. M. Tirado, D. Higuero, and F. Isaila, Predictive data grouping and placement ivor cloud-based elastic server infrastructures, In: 11 th IEEE/ACM International Symposium on Cluster, Cloud and grid Computing. IEEE, 2011, pp [4] S. I. U. Labs, Private cloud computing with open Nebula, In: Software System: Private Cloud Computing with Open Nebula, 2013, pp [5] Z.Y. Guo, Z.Y. Chen, L.Q. Li, B.P. Song, and Y. Lu, Artificial neural network and its application in regime prediction of groundwater quality, Journal of East China Normal University (Natural Sciences), no. 1, pp , (in Chinese). [6] R. Z. Li, Advance and trend analysis of theoretical methodology for water quality forecast, Journal of Hefei University of Technology, vol. 29, no.1, pp , 2006.
6 1334 The Open Automation and Control Systems Journal, 2015, Volume 7 Chen and Jia [7] H.F. Mo, A.Y. Gu, X.Z. Zhang, and J.C. Zhang, Research on a method of BP neural network in water quality evaluation, Control Engineering of China, vol. 11, pp. 9-10, [8] Z.G. Niu, H.W. Zhang, and H.B. Liu, Application of neural network to prediction of coastal water quality, Journal of Tianjin Polytechnic University, vol. 25, no.2, pp , Received: February 2, 2015 Revised: April 29, 2015 Accepted: May 18, 2015 Chen and Jia; Licensee Bentham Open. This is an open access article licensed under the terms of the Creative Commons Attribution Non-Commercial License ( licenses/by-nc/3.0/) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, provided the work is properly cited.
Solving 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 informationMETAHEURISTICS. Introduction. Introduction. Nature of metaheuristics. Local improvement procedure. Example: objective function
Introduction METAHEURISTICS Some problems are so complicated that are not possible to solve for an optimal solution. In these problems, it is still important to find a good feasible solution close to the
More informationOpen Access Research on the Prediction Model of Material Cost Based on Data Mining
Send Orders for Reprints to reprints@benthamscience.ae 1062 The Open Mechanical Engineering Journal, 2015, 9, 1062-1066 Open Access Research on the Prediction Model of Material Cost Based on Data Mining
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 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 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 informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationA new improved ant colony algorithm with levy mutation 1
Acta Technica 62, No. 3B/2017, 27 34 c 2017 Institute of Thermomechanics CAS, v.v.i. A new improved ant colony algorithm with levy mutation 1 Zhang Zhixin 2, Hu Deji 2, Jiang Shuhao 2, 3, Gao Linhua 2,
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 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 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 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 informationRobot Path Planning Method Based on Improved Genetic Algorithm
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Robot Path Planning Method Based on Improved Genetic Algorithm 1 Mingyang Jiang, 2 Xiaojing Fan, 1 Zhili Pei, 1 Jingqing
More informationRESEARCH OF COMBINATORIAL OPTIMIZATION PROBLEM BASED ON GENETIC ANT COLONY ALGORITHM
RESEARCH OF COMBINATORIAL OPTIMIZATION PROBLEM BASED ON GENETIC ANT COLONY ALGORITHM ZEYU SUN, 2 ZHENPING LI Computer and Information engineering department, Luoyang Institute of Science and Technology,
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 informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More informationHybrid of Genetic Algorithm and Continuous Ant Colony Optimization for Optimum Solution
International Journal of Computer Networs and Communications Security VOL.2, NO.1, JANUARY 2014, 1 6 Available online at: www.cncs.org ISSN 2308-9830 C N C S Hybrid of Genetic Algorithm and Continuous
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 informationPrediction of traffic flow based on the EMD and wavelet neural network Teng Feng 1,a,Xiaohong Wang 1,b,Yunlai He 1,c
2nd International Conference on Electrical, Computer Engineering and Electronics (ICECEE 215) Prediction of traffic flow based on the EMD and wavelet neural network Teng Feng 1,a,Xiaohong Wang 1,b,Yunlai
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 informationUsing The Heuristic Genetic Algorithm in Multi-runway Aircraft Landing Scheduling
TELKOMNIKA Indonesian Journal of Electrical Engineering Vol.12, No.3, March 2014, pp. 2203 ~ 2211 DOI: http://dx.doi.org/10.11591/telkomnika.v12i3.4488 2203 Using The Heuristic Genetic Algorithm in Multi-runway
More informationStudy on GA-based matching method of railway vehicle wheels
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(4):536-542 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Study on GA-based matching method of railway vehicle
More informationDIPARTIMENTO DI ELETTRONICA - POLITECNICO DI MILANO
DIPARTIMENTO DI ELETTRONICA - POLITECNICO DI MILANO Positive feedback as a search strategy Marco Dorigo Vittorio Maniezzo Alberto Colorni Report n. 91-016 June 1991 2 Title: Positive feedback as a search
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
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 informationResearch on Cloud Resource Scheduling Algorithm based on Ant-cycle Model
, pp.427-432 http://dx.doi.org/10.14257/astl.2016.139.85 Research on Cloud Resource Scheduling Algorithm based on Ant-cycle Model Yang Zhaofeng, Fan Aiwan Computer School, Pingdingshan University, Pingdingshan,
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 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 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 informationA Study on the Traveling Salesman Problem using Genetic Algorithms
A Study on the Traveling Salesman Problem using Genetic Algorithms Zhigang Zhao 1, Yingqian Chen 1, Zhifang Zhao 2 1 School of New Media, Zhejiang University of Media and Communications, Hangzhou Zhejiang,
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationHybrid Bionic Algorithms for Solving Problems of Parametric Optimization
World Applied Sciences Journal 23 (8): 1032-1036, 2013 ISSN 1818-952 IDOSI Publications, 2013 DOI: 10.5829/idosi.wasj.2013.23.08.13127 Hybrid Bionic Algorithms for Solving Problems of Parametric Optimization
More informationLECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2
15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO ANT-ROUTING TABLE: COMBINING PHEROMONE AND HEURISTIC 2 STATE-TRANSITION:
More informationTHE MULTI-TARGET FIRE DISTRIBUTION STRATEGY RESEARCH OF THE ANTI-AIR FIRE BASED ON THE GENETIC ALGORITHM. Received January 2011; revised May 2011
International Journal of Innovative Computing, Information and Control ICIC International c 2012 ISSN 1349-4198 Volume 8, Number 4, April 2012 pp. 2803 2810 THE MULTI-TARGET FIRE DISTRIBUTION STRATEGY
More informationOpen Access A Sequence List Algorithm For The Job Shop Scheduling Problem
Send Orders of Reprints at reprints@benthamscience.net The Open Electrical & Electronic Engineering Journal, 2013, 7, (Supple 1: M6) 55-61 55 Open Access A Sequence List Algorithm For The Job Shop Scheduling
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 informationOptimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO
Optimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO Nasir Mehmood1, Muhammad Umer2, Dr. Riaz Ahmad3, Dr. Amer Farhan Rafique4 F. Author, Nasir Mehmood is with National
More information4/22/2014. Genetic Algorithms. Diwakar Yagyasen Department of Computer Science BBDNITM. Introduction
4/22/24 s Diwakar Yagyasen Department of Computer Science BBDNITM Visit dylycknow.weebly.com for detail 2 The basic purpose of a genetic algorithm () is to mimic Nature s evolutionary approach The algorithm
More informationAn Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid
An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun
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 informationA Genetic Algorithm for Multiprocessor Task Scheduling
A Genetic Algorithm for Multiprocessor Task Scheduling Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB,
More informationAero-engine PID parameters Optimization based on Adaptive Genetic Algorithm. Yinling Wang, Huacong Li
International Conference on Applied Science and Engineering Innovation (ASEI 215) Aero-engine PID parameters Optimization based on Adaptive Genetic Algorithm Yinling Wang, Huacong Li School of Power and
More informationA New Selection Operator - CSM in Genetic Algorithms for Solving the TSP
A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP Wael Raef Alkhayri Fahed Al duwairi High School Aljabereyah, Kuwait Suhail Sami Owais Applied Science Private University Amman,
More informationKyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming
Kyrre Glette kyrrehg@ifi INF3490 Evolvable Hardware Cartesian Genetic Programming Overview Introduction to Evolvable Hardware (EHW) Cartesian Genetic Programming Applications of EHW 3 Evolvable Hardware
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 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 informationMSc Robotics and Automation School of Computing, Science and Engineering
MSc Robotics and Automation School of Computing, Science and Engineering MSc Dissertation ANT COLONY ALGORITHM AND GENETIC ALGORITHM FOR MULTIPLE TRAVELLING SALESMEN PROBLEM Author: BHARATH MANICKA VASAGAM
More informationCHAOTIC ANT SYSTEM OPTIMIZATION FOR PATH PLANNING OF THE MOBILE ROBOTS
CHAOTIC ANT SYSTEM OPTIMIZATION FOR PATH PLANNING OF THE MOBILE ROBOTS Xu Mingle and You Xiaoming Shanghai University of Engineering Science, Shanghai, China ABSTRACT This paper presents an improved ant
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
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 informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many
More informationSolving ISP Problem by Using Genetic Algorithm
International Journal of Basic & Applied Sciences IJBAS-IJNS Vol:09 No:10 55 Solving ISP Problem by Using Genetic Algorithm Fozia Hanif Khan 1, Nasiruddin Khan 2, Syed Inayatulla 3, And Shaikh Tajuddin
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 informationThe movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat
An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult
More informationA Projection Pursuit Model Optimized by Free Search: For the Regional Power Quality Evaluation
Send Orders for Reprints to reprints@benthamscience.ae 1422 The Open Cybernetics & Systemics Journal, 2015, 9, 1422-1427 Open Access A Projection Pursuit Model Optimized by Free Search: For the Regional
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
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 informationThe study of comparisons of three crossover operators in genetic algorithm for solving single machine scheduling problem. Quan OuYang, Hongyun XU a*
International Conference on Manufacturing Science and Engineering (ICMSE 2015) The study of comparisons of three crossover operators in genetic algorithm for solving single machine scheduling problem Quan
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 informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
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 informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationResearch on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a
International Conference on Education Technology, Management and Humanities Science (ETMHS 2015) Research on Applications of Data Mining in Electronic Commerce Xiuping YANG 1, a 1 Computer Science Department,
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 informationOpen Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing Environments
Send Orders for Reprints to reprints@benthamscience.ae 368 The Open Automation and Control Systems Journal, 2014, 6, 368-373 Open Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing
More informationDERIVATIVE-FREE OPTIMIZATION
DERIVATIVE-FREE OPTIMIZATION Main bibliography J.-S. Jang, C.-T. Sun and E. Mizutani. Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence. Prentice Hall, New Jersey,
More informationResearch on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm
Acta Technica 61, No. 4A/2016, 189 200 c 2017 Institute of Thermomechanics CAS, v.v.i. Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm Jianrong Bu 1, Junyan
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 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 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 informationA Data Classification Algorithm of Internet of Things Based on Neural Network
A Data Classification Algorithm of Internet of Things Based on Neural Network https://doi.org/10.3991/ijoe.v13i09.7587 Zhenjun Li Hunan Radio and TV University, Hunan, China 278060389@qq.com Abstract To
More informationComparison of TSP Algorithms
Comparison of TSP Algorithms Project for Models in Facilities Planning and Materials Handling December 1998 Participants: Byung-In Kim Jae-Ik Shim Min Zhang Executive Summary Our purpose in this term project
More informationResearch Article A Novel Metaheuristic for Travelling Salesman Problem
Industrial Volume 2013, Article ID 347825, 5 pages http://dx.doi.org/10.1155/2013/347825 Research Article A Novel Metaheuristic for Travelling Salesman Problem Vahid Zharfi and Abolfazl Mirzazadeh Industrial
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 informationAn Embedded Dynamic Security Networking Technology Based on Quick Jump and Trust
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 014, 8, 579-585 579 Open Access An Embedded Dynamic Security Networking Technology Based on Quick Jump and
More informationA Network Intrusion Detection System Architecture Based on Snort and. Computational Intelligence
2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 206) A Network Intrusion Detection System Architecture Based on Snort and Computational Intelligence Tao Liu, a, Da
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
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 informationThe AVS/RS Modeling and Path Planning
Journal of Applied Science and Engineering, Vol. 18, No. 3, pp. 245 250 (2015) DOI: 10.6180/jase.2015.18.3.04 The AVS/RS Modeling and Path Planning Tang Meng 1 * and Xue-Fei Liu 2 1 Shenzhen Energy Corporation,
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationGenetic Algorithms Variations and Implementation Issues
Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary
More informationThe Ant System: Optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics Part B, Vol.26, No.1, 1996, pp.1-13 1 The Ant System: Optimization by a colony of cooperating agents Marco Dorigo *,^, Member, IEEE, Vittorio Maniezzo
More informationFSRM Feedback Algorithm based on Learning Theory
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 699-703 699 FSRM Feedback Algorithm based on Learning Theory Open Access Zhang Shui-Li *, Dong
More informationHybrid of Ant Colony Optimization and Gravitational Emulation Based Load Balancing Strategy in Cloud Computing
Hybrid of Ant Colony Optimization and Gravitational Emulation Based Load Balancing Strategy in Cloud Computing Jyoti Yadav 1, Dr. Sanjay Tyagi 2 1M.Tech. Scholar, Department of Computer Science & Applications,
More informationABSTRACT I. INTRODUCTION. J Kanimozhi *, R Subramanian Department of Computer Science, Pondicherry University, Puducherry, Tamil Nadu, India
ABSTRACT 2018 IJSRSET Volume 4 Issue 4 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology Travelling Salesman Problem Solved using Genetic Algorithm Combined Data
More informationScheduling of Independent Tasks in Cloud Computing Using Modified Genetic Algorithm (FUZZY LOGIC)
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 9, September 2015,
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 informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree Rahul Mathur M.Tech (Purs.) BU, AJMER IMRAN KHAN Assistant Professor AIT, Ajmer VIKAS CHOUDHARY Assistant Professor AIT, Ajmer ABSTRACT:-Many
More informationInternational Journal of Current Research and Modern Education (IJCRME) ISSN (Online): & Impact Factor: Special Issue, NCFTCCPS -
TO SOLVE ECONOMIC DISPATCH PROBLEM USING SFLA P. Sowmya* & Dr. S. P. Umayal** * PG Scholar, Department Electrical and Electronics Engineering, Muthayammal Engineering College, Rasipuram, Tamilnadu ** Dean
More informationHomework 2: Search and Optimization
Scott Chow ROB 537: Learning Based Control October 16, 2017 Homework 2: Search and Optimization 1 Introduction The Traveling Salesman Problem is a well-explored problem that has been shown to be NP-Complete.
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 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 informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationEvolutionary Algorithms. CS Evolutionary Algorithms 1
Evolutionary Algorithms CS 478 - Evolutionary Algorithms 1 Evolutionary Computation/Algorithms Genetic Algorithms l Simulate natural evolution of structures via selection and reproduction, based on performance
More informationReduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem
Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem A.Aranganayaki(Research Scholar) School of Computer Science and Engineering Bharathidasan University Tamil Nadu, India
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 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 informationLOAD BALANCING IN CLOUD COMPUTING USING ANT COLONY OPTIMIZATION
International Journal of Computer Engineering & Technology (IJCET) Volume 8, Issue 6, Nov-Dec 2017, pp. 54 59, Article ID: IJCET_08_06_006 Available online at http://www.iaeme.com/ijcet/issues.asp?jtype=ijcet&vtype=8&itype=6
More information