Genetic Algorithms with Oracle for the Traveling Salesman Problem
|
|
- Shanon Bryan
- 5 years ago
- Views:
Transcription
1 PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN Genetic Algorithms with Oracle for the Traveling Salesman Problem Robin Gremlich, Andreas Hamfelt, Héctor de Pereda, and Vladislav Valkovsky Abstract By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms. Keywords Genetic algorithms, Traveling Salesman Problem, optimal decision distribution, Oracle. I. INTRODUCTION HE Traveling Salesman Problem (TSP) was formulated in T the th year of the 2th century and till now it is one of the most popular and important combinatorial problems. The TSP is stated as follows: Given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all cities and returning to the starting point [7]. Although it seems to be quite simple, solving it is very computationally expensive. As no polynomial time algorithm has been discovered, the only way to obtain the best solution is by calculating all possible routes. If we have a map with N cities, the number of possible routes will be N!. For example solving the problem for cities, using a computer with 1 adds per second, would take over years. The reason for TSP s popularity is its practical and theoretical importance. Classical TSP applications include areas such as transportation logistics, PCB drilling, and X-rays analysis. Modern TSP applications include DNA/genome sequencing, bio-informatics, statistical physics, astronomy, etc. TSP belongs to the class of NP-complete problems. It is known [2] that all NP-complete problems could be transformed one to another in polynomial time, so the decision of TSP is also of great theoretical interest. There are two types of TSP: symmetric and asymmetric [5]. For the symmetric TSP the cost of traveling from city A to city B is the same as the cost of traveling from B to A. For asymmetric TSP these costs can be different. Manuscript received July 15, 25. R. Gremlich received his M. Sc. in Computer Science in 24 from the University of Zurich, Zurich, Switzerland ( gremlich@gmx.ch). A. Hamfelt is a professor of the Department of Information Sciences in Uppsala University, Uppsala, Sweden (phone: , andreas.hamfelt@dis.uu.se). H. de Pereda was a Computer Science student in Uppsala University, Uppsala, Sweden. He is now with AtosOrigin, Madrid, Spain ( hector.depereda@atosorigin.com). V. Valkovsky is an associate professor of the Department of Information Sciences in Uppsala University, Uppsala, Sweden (phone: , vladislav.valkovsky@dis.uu.se). Research dedicated to solving the symmetric TSP abounds. For practical applications, currently the large-scale asymmetric TSP is starting to be extremely important (e.g. DNA/genome sequencing). However, concerning the asymmetric TSP there has been far less research. It appears to be a more difficult problem, both with respect to optimization and approximation [4]. Whereas the TSPLIB library of the best-known TSP decisions [] contains symmetric TSP instances with as many as 85 cities, its largest asymmetric TSP instance has only 44 cities and over half of its asymmetric TSP instances have fewer than 1 cities [4]. Computational complexity of the TSP was the main reason for creating the great number of heuristic algorithms to get approximate TSP decisions in polynomial time [5]. One of the most efficient heuristic approaches is the class of genetic algorithms. Genetic algorithms are general-purpose searching techniques based on the Darwinian Principle of Natural Selection []. Genetic algorithms combine selection, crossover and mutation operations with the goal of finding the best solution of a problem. Genetic algorithms search for this solution until a specified termination criterion is met. One of the main problems of genetic algorithms is local minimums [8]. It is very common that genetic algorithm converge to a solution that might be the best among the ones close/similar to it, but it could be far from the best solution we can get. Another duty is generating the initial population []. Starting from a sufficiently good initial population can save a lot of evolution time, as well as facilitating the genetic algorithm to deliver better quality solutions. To overcome the abovementioned problems we propose a concept that we call Oracle. Thanks to information provided by Oracle it is possible to avoid local minimums and generate good quality initial populations. II. ORACLE The approach for finding the optimal decision distributions for large-scale asymmetric TSP was proposed in [1]. For light left tail TSP weight matrixes distributions it will be Rayleigh distribution: 2 x x 2 2 σ ( x) = e 2 p (1) σ For heavy left tail TSP weight matrixes distributions the optimal decision distribution will be γ-distribution: PWASET VOLUME 7 AUGUST 25 ISSN WASET.ORG
2 PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN x β 1 α p( x) = x e =. 5 α + 1 Γ( α + 1) β α (2) generations. We can appreciate how swap adjacent gets quickly stuck in a local minimum, whereas invert mutation is the one that faster gets close to the optimum solution. Methods for finding parameters of these distributions by a given asymmetric TSP weight matrix, calculating a prediction of the optimal tour length and its variance are also presented in [1]. The result of this research provides an opportunity to reduce drastically the search space for solving the asymmetric TSP. For example, for the dimension of the problem n = 1 we can delete nearly % of the elements of the TSP weight matrix as irrelevant for the optimal decision. For the dimension n = 1 nearly. % of the elements can be deleted, etc. After such pruning according to the predicted optimal decision distribution, we can determine the probability for the remaining elements of the weight matrix to be included in the optimal decision to support finding an optimal TSP solution. We will call information provided by this approach Oracle and will use it to improve the performance of genetic algorithms for the asymmetric TSP. III. CLASSICAL GENETIC ALGORITHMS FOR TSP If we want to solve TSP using genetic algorithms, we have to consider some facts. An appropriate way of encoding the tours that the salesman can choose is by assigning every city a different number and representing tours as a list of these numbers in the order they must be visited. Every city/number is intended to be a gene of a full chromosome. Tours/lists represent chromosomes. Lists must have the same length as the number of cities in the TSP and no city can appear twice in the same list. The initial set of solutions can be created either by randomizing the list of cities or creating tours using heuristic algorithms. A simple evaluation function could just calculate the total distance of the tour represented by each list. In this way, lower values will mean routes are closer to the optimum solution. Reproduction can be done by crossover and mutation or by combining both techniques. There is a wide range of mutations to be applied to the members of a population of TSP solutions. Choosing the most appropriate one will determine in some way the success of the algorithm. We analyzed the performance of the six different mutations: swap adjacent nodes mutation, swap nodes mutation, move node mutation, relocate mutation, invert mutation and permute mutation. All the mutation functions have at least one randomized factor, which makes them more efficient when trying to emulate a specie evolution. The more randomized these functions are, the more possibilities of evolution we will have. Swap adjacent nodes mutation turned out to be quite inappropriate for our goal, due to its limited range of variations. On the other hand, invert mutation provided us with best results. This mutation also came out as the less prone to get stuck in local minimums. Fig. 1 shows an example of the rd1 TSP instance from TSPLIB being solved by means of the six different mutations during a certain number of Time (s) Swap_Adjacent mutation Swap_Nodes mutation M ove_nodes mutation Relocate mutation Invert mutatio n Permute mutation Fig. 1 Performance of mutations for 'rd1.tsp' from TSP-LIB To continue the analysis, we need large-scale asymmetric TSP instances, but as it was mentioned above, TSPLIB has not appropriate ones. Because of this fact we will continue our investigation by using generated large-scale instances. Further we will use asymmetric TSP instances up to 5-nodes with elements of weight matrixes generated randomly on the interval [, 1] according to distribution density f(x) = 2x (triangle distribution). Fig. 2 demonstrates the length of the solutions found for a 5-node generated asymmetric TSP instance in relation with the time elapsed until these solutions were reached. The average length of the solutions found so far is also showed. The expected length for the optimal solution delivered by Oracle is around.4 (+/-.45). It is possible to see that, in average, the later the algorithm gets stuck in a local minimum, the closer the solution found is to the optimal path length. However, the length of the best solution found is 57.. This means that the solutions found are still quite far from the optimal one. PWASET VOLUME 7 AUGUST 25 ISSN WASET.ORG
3 PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN Solution found Time (s) Average Fig. 2 Solutions found for a 5-node TSP Fig. demonstrates expected distribution density of the optimal decision, delivered by Oracle, and distribution density of the decision delivered by the classical genetic algorithm for a 5-nodes generated asymmetric TSP instance, which shows poor preliminary precision. In the successive results we should try to get a distribution density much closer to the expected one, which will mean better solutions for the TSP. minimum, but not so much that we loose all the evolution we had already performed. A lot of combinations have been tested in the quest for the most suitable way of skipping a local minimum. The best way we have found to manage this problem is by applying several single-node oriented mutations. We have used a combination of swap node and move node mutations, each of them used twice, alternatively. This technique means an improvement in the algorithm performance. Fig. 4 shows the performance improvement regarding the quality of the solution for a 5-nodes TSP instance node TSP Fig. 4 Average solutions length for a 5-node TSP However, this increase in the precision of the algorithm causes a significant increase of the time needed too, as we can see in Fig ,1,2,,4,5 Fig. Distribution density for classical genetic algorithms IV. LOCAL MINIMUMS PROBLEM As it was mentioned above, local minimums are one of the main problems of genetic algorithms. So, detecting and avoiding local minimums is the first goal of our investigation. By Oracle it is possible to know the expected length of the optimal route and its variance. This information can be used for evaluating whether we have found an appropriate solution or have to keep on searching. Local minimums are detected by counting the number of generations that have been created without improving a best solution, which is sufficiently far from the one predicted by Oracle. When this number reaches a certain quantity, it means that we are in a local minimum and we have to act accordingly. The way of skipping a local minimum is going back in the evolution and trying to evolve in a different direction. This is accomplished by mutating a whole population enough so it does not get back to the same solution we had in the local 1 5-node TSP Fig. 5 Average time spent for a 5-node TSP Consequently, the distribution density improves the one we got for the results of classical genetic algorithms and gets closer to the expected optimal one, as we can see in Fig.. PWASET VOLUME 7 AUGUST 25 ISSN WASET.ORG
4 PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN ,1,2,,4,5 Fig. Distribution density avoiding local minimums Random TSP size Fig. 7 Average length of initial population members V. GENERATION OF INITIAL POPULATION Starting from a sufficiently good initial population can save a lot of evolution time, as well as facilitating the genetic algorithm to deliver better quality solutions. Our task now is to create an efficient and quick way to create initial population members. We will use predicted by Oracle optimal decision distribution as a guide that can lead us to solutions looking quite similar to the optimal path. We came up with the idea of sorting each node s neighbors by predicted Oracle distance density distribution. Then, when it comes to choose the next node in the path, we pick an unvisited neighbor with a probability that is directly proportional to its distance expected density. In this way, distances with an insignificant density will not be picked unless the rest of the neighbors have been visited already. This method reminds of the nearest-neighbor algorithm [], but introduces a pseudo-random factor and considers the expected distance density in the final path instead of the distance itself. From now on, we will call this method most-probableneighbor algorithm. Fig. 7 represents the outstanding performance of the new algorithm, which, in addition, was not as time consuming as preliminary attempts. For each TSP size from 1 to 5, we calculated the average total length of the initial population members, both generated randomly and using the most-probable-neighbor algorithm. As we can see, the members of initial populations generated by this new method are much closer to the optimal route than the solutions provided by genetic algorithms before implementing this improvement, even after performing genetic algorithms evolution through a huge number of generations. This will allow us to start the evolution process from a point where it would have taken an enormous amount of time to get to applying mutations. Another fact we can extract from the graph is that when possible solutions are generated randomly, their length differs from the optimal route length more and more as the number of nodes of TSP instance increases. However the length of solutions generated by the most probable-neighbor algorithm remains somehow constant in relation to the expected length of the optimal route, as we can see in Fig. 8. % 1% 8% % 4% 2% % 111% 15% Random TSP size Fig. 8 Percentage length difference of initial population members with expected optimal road The members of the initial population generated by the most-probable-neighbor algorithm are high quality solutions for the TSP to start the evolution process from. However, it would take too long to generate the entire set of initial population members using this technique. Instead, we generate a few members and mutate them to fill up the entire population. If we take a look at the distribution density for the members of the initial population generated by the most-probableneighbor algorithm (Fig. ), we will appreciate how the curve is much closer to the expected optimal decision distribution.,1,2,,4,5 Fig. Distribution density for most-probable-neighbor algorithm PWASET VOLUME 7 AUGUST 25 ISSN WASET.ORG
5 PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN As these solutions are not generated completely randomly, it was our task to find out an appropriate way to mutate them. By analyzing the paths created by the most-probable-neighbor algorithm we developed a mutation function, which tries to find the place in the path where the last node could be placed in order to decrease the total path length. If it does not find a better place for the last node, it continues with the preceding one, and so on. VI. FINAL RESULTS Now it is time to merge all the improvements we have developed and check how they work all together. The final algorithm works as follows: 1. The initial population is created using the most-probable-neighbor algorithm we have implemented (or by mutating members created by it, in case the process is too slow). 2. Then, the specific mutation that we have created places the last nodes of the path in more proper places in order to make the path more homogeneous.. Finally, the genetic algorithm starts working in the quest for the expected optimal route length. It will detect whether we have reached a good solution for the TSP, or are just in a local minimum. For the second case, the algorithm tries to skip the local minimum and lets the evolution go on. The distribution density for the solution provided looks very similar to that predicted by Oracle, as we can see in Fig ,21 41,8 1,5 5, Final algorithm Fig. 11 Examples of evolutions for a 5-node TSP Time (s) It is obvious that the resulting algorithm delivers better solutions in less time than the classical genetic algorithms, but on the other hand, it spends a considerable amount of time after generating the initial population which does not result in a great improvement of the solutions delivered by the mostprobable-neighbor algorithm. If we take a look at the different distribution densities we have obtained, we will be able to notice how each time they get closer to the predicted by Oracle optimal distribution density, as showed in Fig..,1,2,,4,5 Final results Fig. 1 Distribution density for final results We now have to evaluate how accurate and efficient our new algorithm is in order to decide whether the improvements done to the classical genetic algorithms are worth applying. We can compare the solutions provided by the algorithm by placing all the solutions obtained in a chart. The Y axe of the chart will represent the length of the solution and the X axe will represent the amount of time spent to deliver that solution. The solutions with shorter paths will be at the bottom and those, which have been delivered in less time, will be shown at the left. In this way, solutions placed at the bottom-left corner will be considered better solutions than those in the upperright corner (Fig. 11).,1,2,,4,5 Final results Fig. Distribution density VII. CONCLUSION The presented results confirm that the concept of Oracle is an efficient means for improving the performance of genetic algorithms. PWASET VOLUME 7 AUGUST 25 ISSN WASET.ORG
6 PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN REFERENCES [1] Robin Gremlich, Andreas Hamfelt, and Vladislav Valkovsky, Prediction of the Optimal Decision Distribution for the Traveling Salesman Problem, Proceedings of IPSI International Conf., Sveti Stefan, Montenegro, 24. [2] Papadimitriou C.H., Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice Hall, 182. [] [4] Gutin, Punnen (eds.), The Travelling Salesman Problem and its Variations, Kluwer Academic Publishers, 22. [5] [] [7] [8] [] PWASET VOLUME 7 AUGUST 25 ISSN WASET.ORG
A 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 informationIntroduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.
Chapter 7: Derivative-Free Optimization Introduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.5) Jyh-Shing Roger Jang et al.,
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 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 informationComparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-661, p- ISSN: 2278-8727Volume 13, Issue 3 (Jul. - Aug. 213), PP 17-22 Comparison Study of Multiple Traveling Salesmen Problem using Genetic
More informationParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster Abstract- Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial
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 informationOptimizing the Sailing Route for Fixed Groundfish Survey Stations
International Council for the Exploration of the Sea CM 1996/D:17 Optimizing the Sailing Route for Fixed Groundfish Survey Stations Magnus Thor Jonsson Thomas Philip Runarsson Björn Ævar Steinarsson Presented
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 informationA COMPARATIVE STUDY OF FIVE PARALLEL GENETIC ALGORITHMS USING THE TRAVELING SALESMAN PROBLEM
A COMPARATIVE STUDY OF FIVE PARALLEL GENETIC ALGORITHMS USING THE TRAVELING SALESMAN PROBLEM Lee Wang, Anthony A. Maciejewski, Howard Jay Siegel, and Vwani P. Roychowdhury * Microsoft Corporation Parallel
More informationA HYBRID GENETIC ALGORITHM A NEW APPROACH TO SOLVE TRAVELING SALESMAN PROBLEM
A HYBRID GENETIC ALGORITHM A NEW APPROACH TO SOLVE TRAVELING SALESMAN PROBLEM G.ANDAL JAYALAKSHMI Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India
More informationTask Graph Scheduling on Multiprocessor System using Genetic Algorithm
Task Graph Scheduling on Multiprocessor System using Genetic Algorithm Amit Bansal M.Tech student DCSE, G.N.D.U. Amritsar, India Ravreet Kaur Asst. Professor DCSE, G.N.D.U. Amritsar, India Abstract Task
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 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 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 Traveling Salesman Problem Using Parallel Genetic. Algorithm and Simulated Annealing
Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing Fan Yang May 18, 2010 Abstract The traveling salesman problem (TSP) is to find a tour of a given number of cities
More informationIntroduction to Genetic Algorithms. Genetic Algorithms
Introduction to Genetic Algorithms Genetic Algorithms We ve covered enough material that we can write programs that use genetic algorithms! More advanced example of using arrays Could be better written
More informationGenetic Algorithms. Kang Zheng Karl Schober
Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization
More informationISSN: (Online) Volume 3, Issue 5, May 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Issue 5, May 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at:
More informationSparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach
1 Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach David Greiner, Gustavo Montero, Gabriel Winter Institute of Intelligent Systems and Numerical Applications in Engineering (IUSIANI)
More informationSolving Traveling Salesman Problem for Large Spaces using Modified Meta- Optimization Genetic Algorithm
Solving Traveling Salesman Problem for Large Spaces using Modified Meta- Optimization Genetic Algorithm Maad M. Mijwel Computer science, college of science, Baghdad University Baghdad, Iraq maadalnaimiy@yahoo.com
More informationTwo new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP
Two new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP Orlis Christos Kartsiotis George Samaras Nikolaos Margaritis Konstantinos
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationAdvanced Search Genetic algorithm
Advanced Search Genetic algorithm Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Jerry Zhu, Andrew Moore http://www.cs.cmu.edu/~awm/tutorials
More informationCombining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem
Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine
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 informationA Parallel Architecture for the Generalized Traveling Salesman Problem
A Parallel Architecture for the Generalized Traveling Salesman Problem Max Scharrenbroich AMSC 663 Project Proposal Advisor: Dr. Bruce L. Golden R. H. Smith School of Business 1 Background and Introduction
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 informationA Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem
A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem Richard E. Mowe Department of Statistics St. Cloud State University mowe@stcloudstate.edu Bryant A. Julstrom Department
More informationReport on article The Travelling Salesman Problem: A Linear Programming Formulation
Report on article The Travelling Salesman Problem: A Linear Programming Formulation Radosław Hofman, Poznań 2008 Abstract This article describes counter example prepared in order to prove that linear formulation
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 informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationDesign and Analysis of Algorithms CS404/504. Razvan Bunescu School of EECS.
Welcome Design and Analysis of Algorithms Razvan Bunescu School of EECS bunescu@ohio.edu 1 Course Description Course Description: This course provides an introduction to the modern study of computer algorithms.
More informationNew Genetic Operators for Solving TSP: Application to Microarray Gene Ordering
New Genetic Operators for Solving TSP: Application to Microarray Gene Ordering Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, and Sankar K. Pal Machine Intelligence Unit, Indian Statistical Institute,
More informationHeuristic Optimisation
Heuristic Optimisation Revision Lecture Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic Optimisation University
More informationA NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
TWMS J. App. Eng. Math. V.7, N.1, 2017, pp. 101-109 A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM F. NURIYEVA 1, G. KIZILATES 2, Abstract. The Multiple Traveling Salesman Problem (mtsp)
More informationTravelling Salesman Problem: Tabu Search
Travelling Salesman Problem: Tabu Search (Anonymized) April 2017 Abstract The Tabu Search algorithm is a heuristic method to find optimal solutions to the Travelling Salesman Problem (TSP). It is a local
More informationIntroduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell
Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas
More informationMassively Parallel Approximation Algorithms for the Traveling Salesman Problem
Massively Parallel Approximation Algorithms for the Traveling Salesman Problem Vaibhav Gandhi May 14, 2015 Abstract This paper introduces the reader to massively parallel approximation algorithms which
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 informationEffective Optimizer Development for Solving Combinatorial Optimization Problems *
Proceedings of the 11th WSEAS International Conference on SYSTEMS, Agios Nikolaos, Crete Island, Greece, July 23-25, 2007 311 Effective Optimizer Development for Solving Combinatorial Optimization s *
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 informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 Beyond Classical Search Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed
More informationOptimal tour along pubs in the UK
1 From Facebook Optimal tour along 24727 pubs in the UK Road distance (by google maps) see also http://www.math.uwaterloo.ca/tsp/pubs/index.html (part of TSP homepage http://www.math.uwaterloo.ca/tsp/
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 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 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 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 informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationA HIGH PERFORMANCE ALGORITHM FOR SOLVING LARGE SCALE TRAVELLING SALESMAN PROBLEM USING DISTRIBUTED MEMORY ARCHITECTURES
A HIGH PERFORMANCE ALGORITHM FOR SOLVING LARGE SCALE TRAVELLING SALESMAN PROBLEM USING DISTRIBUTED MEMORY ARCHITECTURES Khushboo Aggarwal1,Sunil Kumar Singh2, Sakar Khattar3 1,3 UG Research Scholar, Bharati
More informationAN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING
International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH
More informationarxiv: v1 [cs.ai] 12 Feb 2017
GENETIC AND MEMETIC ALGORITHM WITH DIVERSITY EQUILIBRIUM BASED ON GREEDY DIVERSIFICATION ANDRÉS HERRERA-POYATOS 1 AND FRANCISCO HERRERA 1,2 arxiv:1702.03594v1 [cs.ai] 12 Feb 2017 1 Research group Soft
More informationOptimal Solving Large Scale Traveling Transportation Problems by Flower Pollination Algorithm
Optimal Solving Large Scale Traveling Transportation Problems by Flower Pollination Algorithm Supaporn SUWANNARONGSRI Department of Materials Handling and Logistics Engineering Faculty of Engineering,
More informationAI Programming CS S-08 Local Search / Genetic Algorithms
AI Programming CS662-2013S-08 Local Search / Genetic Algorithms David Galles Department of Computer Science University of San Francisco 08-0: Overview Local Search Hill-Climbing Search Simulated Annealing
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationTruss structural configuration optimization using the linear extended interior penalty function method
ANZIAM J. 46 (E) pp.c1311 C1326, 2006 C1311 Truss structural configuration optimization using the linear extended interior penalty function method Wahyu Kuntjoro Jamaluddin Mahmud (Received 25 October
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 informationCHAPTER 6 REAL-VALUED GENETIC ALGORITHMS
CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms
More informationHybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem
Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem Otman ABDOUN, Chakir TAJANI and Jaafar ABOUCHABKA LaRIT, Department of Computer Science IBN
More informationTraveling Salesman Problem. Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij
Traveling Salesman Problem Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij 1 Contents TSP and its applications Heuristics and approximation algorithms Construction heuristics,
More informationGenetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA
More informationGRASP. Greedy Randomized Adaptive. Search Procedure
GRASP Greedy Randomized Adaptive Search Procedure Type of problems Combinatorial optimization problem: Finite ensemble E = {1,2,... n } Subset of feasible solutions F 2 Objective function f : 2 Minimisation
More informationA Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems
A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems Yi-Hsuan Lee and Cheng Chen Department of Computer Science and Information Engineering National Chiao Tung University, Hsinchu,
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
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 Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach by John Silberholz, University of Maryland Bruce Golden, University of Maryland Presented at INFORMS 2007 Coral Gables, January
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 informationThe Heuristic Strategy Implementation to the Hopfield -Tank TSP Neural Algorithm
The Heuristic Strategy Implementation to the Hopfield -Tank TSP Neural Algorithm N. Kovač, S. Bauk Faculty of Maritime Studies, University of Montenegro Dobrota 36, 85 330 Kotor, Serbia and Montenegro
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 informationComparative Analysis of Genetic Algorithm Implementations
Comparative Analysis of Genetic Algorithm Implementations Robert Soricone Dr. Melvin Neville Department of Computer Science Northern Arizona University Flagstaff, Arizona SIGAda 24 Outline Introduction
More informationAn Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-Relations
Journal of Computer Science 7 (1): 70-74, 2011 ISSN 1549-3636 2011 Science Publications An Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-Relations Supat Patvichaichod Department
More informationA Parallel Algorithm for UAV Flight Route Planning on GPU
Int J Parallel Prog (2011) 39:809 837 DOI 10.1007/s10766-011-0171-8 A Parallel Algorithm for UAV Flight Route Planning on GPU Seçkin Sancı Veysi İşler Received: 11 December 2010 / Accepted: 26 April 2011
More informationA Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling Repairman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling
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 informationGenetic Algorithms. Chapter 3
Chapter 3 1 Contents of this Chapter 2 Introductory example. Representation of individuals: Binary, integer, real-valued, and permutation. Mutation operator. Mutation for binary, integer, real-valued,
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More informationTravelling Salesman Problem. Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij
Travelling Salesman Problem Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij 1 Contents TSP and its applications Heuristics and approximation algorithms Construction heuristics,
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationSmart Solution for the Traveling Salesman Problem : Using Artificial Intelligent A* algorithm and Hamilton Circuit
Smart Solution for the Traveling Salesman Problem : Using Artificial Intelligent A* algorithm and Hamilton Circuit Hatem F. Halaoui Computer Science and Mathematics Division Haigazian University Beirut,
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 Parallel Genetic Algorithm for Maximum Flow Problem
A Parallel Genetic Algorithm for Maximum Flow Problem Ola M. Surakhi Computer Science Department University of Jordan Amman-Jordan Mohammad Qatawneh Computer Science Department University of Jordan Amman-Jordan
More informationSolving Traveling Salesman Problem Using Combinational Evolutionary Algorithm
Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm Mohammad Reza Bonyadi\ S.Mostafa Rahimi Azghadi^ and Hamed Shah Hosseini^ 1 Department of Electrical & Computer Engineering,
More informationClustering Strategy to Euclidean TSP
2010 Second International Conference on Computer Modeling and Simulation Clustering Strategy to Euclidean TSP Hamilton Path Role in Tour Construction Abdulah Fajar, Nur Azman Abu, Nanna Suryana Herman
More informationSolving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster
Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster Plamenka Borovska Abstract: The paper investigates the efficiency of the parallel computation of the travelling
More informationTravelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan Institute of Technology and Science
Volume 118 No. 20 2018, 419-424 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Travelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan
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 informationMutations for Permutations
Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency
More informationParallel Computing in Combinatorial Optimization
Parallel Computing in Combinatorial Optimization Bernard Gendron Université de Montréal gendron@iro.umontreal.ca Course Outline Objective: provide an overview of the current research on the design of parallel
More informationHeuristic Optimisation
Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationApplication of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3673 3677 Advanced in Control Engineeringand Information Science Application of Improved Discrete Particle Swarm Optimization in
More informationA Parallel Architecture for the Generalized Travelling Salesman Problem: Project Proposal
A Parallel Architecture for the Generalized Travelling Salesman Problem: Project Proposal Max Scharrenbroich, maxfs at umd.edu Dr. Bruce Golden, R. H. Smith School of Business, bgolden at rhsmith.umd.edu
More informationA Genetic Algorithm Approach to the Group Technology Problem
IMECS 008, 9- March, 008, Hong Kong A Genetic Algorithm Approach to the Group Technology Problem Hatim H. Sharif, Khaled S. El-Kilany, and Mostafa A. Helaly Abstract In recent years, the process of cellular
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 informationStructural Optimizations of a 12/8 Switched Reluctance Motor using a Genetic Algorithm
International Journal of Sustainable Transportation Technology Vol. 1, No. 1, April 2018, 30-34 30 Structural Optimizations of a 12/8 Switched Reluctance using a Genetic Algorithm Umar Sholahuddin 1*,
More informationVertex Cover Approximations
CS124 Lecture 20 Heuristics can be useful in practice, but sometimes we would like to have guarantees. Approximation algorithms give guarantees. It is worth keeping in mind that sometimes approximation
More informationWelfare Navigation Using Genetic Algorithm
Welfare Navigation Using Genetic Algorithm David Erukhimovich and Yoel Zeldes Hebrew University of Jerusalem AI course final project Abstract Using standard navigation algorithms and applications (such
More informationA Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem
A Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem Ali Jazayeri and Hiroki Sayama Center for Collective Dynamics of Complex Systems Department of Systems Science and Industrial
More informationA memetic algorithm for symmetric traveling salesman problem
ISSN 1750-9653, England, UK International Journal of Management Science and Engineering Management Vol. 3 (2008) No. 4, pp. 275-283 A memetic algorithm for symmetric traveling salesman problem Keivan Ghoseiri
More information