Meta Heuristics Team Project

Slides:



Advertisements
Similar presentations
CS6800 Advanced Theory of Computation
Advertisements

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
Ant colonies for the traveling salesman problem Eliran Natan Seminar in Bioinformatics (236818) – Spring 2013 Computer Science Department Technion - Israel.
Vehicle Routing & Scheduling: Part 1
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Nature’s Algorithms David C. Uhrig Tiffany Sharrard CS 477R – Fall 2007 Dr. George Bebis.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Imagine that I am in a good mood Imagine that I am going to give you some money ! In particular I am going to give you z dollars, after you tell me the.
Genetic Algorithms: Solving the Traveling Salesman Problem Thomas Abtey SUNY Oswego.
EAs for Combinatorial Optimization Problems BLG 602E.
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
Ant Colony Optimization: an introduction
The Travelling Salesman Problem (TSP)
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
Genetic Algorithms and Ant Colony Optimisation
The Traveling Salesperson Problem Algorithms and Networks.
A Genetic Solution to the Travelling Salesman Problem Ryan Honig.
Swarm Intelligence 虞台文.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Ch.12 Machine Learning Genetic Algorithm Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Introduction to Design and Manufacture Supply Chain Analysis (K. Khammuang & H. S. Gan) A scientific approach to decision making, which seeks to.
Local Search: walksat, ant colonies, and genetic algorithms.
Thursday, May 9 Heuristic Search: methods for solving difficult optimization problems Handouts: Lecture Notes See the introduction to the paper.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
1 Genetic Algorithms and Ant Colony Optimisation.
Simulated Annealing G.Anuradha.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Ramakrishna Lecture#2 CAD for VLSI Ramakrishna
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
Intro. ANN & Fuzzy Systems Lecture 37 Genetic and Random Search Algorithms (2)
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Genetic Algorithms.
Genetic Algorithms.
metaheuristic methods and their applications
CSCI 4310 Lecture 10: Local Search Algorithms
Shortest Path Problems
Routing Through Networks - 1
School of Computer Science & Engineering
1 The Travelling Salesman Problem (TSP) H.P. Williams Professor of Operational Research London School of Economics.
Example: Applying EC to the TSP Problem
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Comparing Genetic Algorithm and Guided Local Search Methods
Ant colonies for traveling salesman problem
metaheuristic methods and their applications
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
Heuristics Definition – a heuristic is an inexact algorithm that is based on intuitive and plausible arguments which are “likely” to lead to reasonable.
Example: Applying EC to the TSP Problem
CSE 589 Applied Algorithms Spring 1999
Example: Applying EC to the TSP Problem
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Multi-Objective Optimization
Ant Colony Optimization
Design & Analysis of Algorithms Combinatorial optimization
traveling salesman problem
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
Solving the Minimum Labeling Spanning Tree Problem
Boltzmann Machine (BM) (§6.4)
The Traveling Salesperson Problem
Backtracking and Branch-and-Bound
Spanning Trees Lecture 20 CS2110 – Spring 2015.
Traveling Salesman Problem by Genetic Algorithm
Approximation Algorithms
Discrete Mathematics and Its Applications
Beyond Classical Search
Simulated Annealing & Boltzmann Machines
Presentation transcript:

Meta Heuristics Team Project Students: Dukai 200550737 Liwenfei 200550738

Introduction The traveling salesman problem (TSP) is a typical example of a vary hard combinational optimization problem. The problem is to find the shortest tour that passed through each vertex in a give graph exactly once. We try to develop two solutions to Traveling Salesman Problem (TSP) using Simulated annealing (SA) and Genetic algorithm (GA), respectively. In the Traveling Salesman Problem, the goal is to find the shortest distance between N different cities. We will generate our best solutions by using the C++ Language.

Genetic Algorithm (GA) In the traveling salesman problem we wish to find a tour of all nodes in a weighted graph so that the total weight is minimized. A genetic algorithms can be used to find a solution is much less time. There are a couple of steps to solving the traveling problem using a GA and we will describing them step by step.

Genetic Algorithm (GA) process As a problem in Genetic algorithm, the traveling salesman problem is handled as follow steps: First, create a group many random tours in what is called a population. This algorithm uses a greedy initial population that gives preference to linking cities that are close to each other. Second, pick two of the shorter tours parents in the population and combine them to make two new child tours. Hopefully, these children tour will be better than either parents.

Genetic Algorithm (GA) process Third, a small percentage of the time, the child tours are mutated . This is done to prevent all tours in the population from looking identical. Fourth, the new child tours are inserted into the population replacing two of the longer tours. The size of the population remains the same. Fifth, new children tours are repeatedly created until the desired goal is reached.

GA Analyzing and Programming Firstly, by analyzing the general structure of TSP problem with Genetic algorithm (GA), programming with C++ language will be considered and produced. Secondly, according to the C++ programming , the optimal solution of shortest path could be solved. Additionally, using graph is also a helpful method in making algorithm and programming.

Simulated Annealing (SA) This program uses the Simulated annealing algorithm to solve a form of the traveling salesman problem, which is to find the shortest (or a nearly shortest) path connecting a set of sites, such as cities or delivery points.

Simulated Annealing(SA) Process As a problem in Simulated annealing, the traveling salesman problem is handled as follow steps: Configuration: The cities are numbered i = 1. . .N and each has coordinates (xi, yi). A configuration is a permutation of the number 1 . . .N, interpreted as the order in which the cities are visited. Rearrangements: The moves consist of two types: (a) A section of path is removed and then replaced with the same cities running in the opposite order; or

Simulated Annealing(SA) Process (b) A section of path is removed. And then replaced in between two cities on another, randomly chosen, part of the path. Objective Function. In the simplest form of the problem, E is taken just as the total length of journey. Annealing schedule. This requires experimentation. We generate some random rearrangements, and use them to determine the range of values of total length that will be encountered from move to move.

SA Analyzing and Programming Firstly, by analyzing the general structure of TSP problem with Simulated annealing (SA), programming with C++ language will be considered and produced. Secondly, according to the C++ programming , the optimal solution of shortest path could be solved. Additionally, using graph is also a helpful method in making algorithm and programming.

Reference [1]. S. Kirkpatrick, C.D. Gelatt and M.P. Vechi, Optimization by simulated annealing, Science 220 (May 13, 1983). [2]. F. Glover, Tabu search, Center for Applied Artificial Intelligence, Graduate School of Business, University of Colorado, Boulder, 1988. [3]. E.L. Lawler, J.K. Lenstra and A.H.G. Rimnooy Kan, eds.,The Traveling Salesman Problem (North- Holland, 1985). [4]. R.L. Karg and G.L. Thompson, A heuristic approach to solving travelling-salesman problems, Management Science 10 (1964).

Reference [5]. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, Solution of a large-scale travelling-salesman problem, Operations Research 2 (1954). [6]. Byrant A. Julstrom, Very greedy crossover in a genetic algorithm for the traveling salesman problem, Proceedings of the 1995 ACM symposium on Applied computing, p.324-328, February 26-28, 1995, Nashville, Tennessee, United States. [7]. P. Krolak, W. Felts and G. Marble, A man- machine approach towards solving the travelling salesman problem, Communications of the Association for Computing Machinery 14 (1971).

Reference [8]. S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21 (1973). [9]. R.G. Parker and R.L. Rardin, The traveling salesman problem: an update of research, Naval Research Logistics Quarterly 30 (1983). [10]. M. Padberg and G. Rinaldi, Optimization of a 532-city symmetric traveling salesman problem by branch and cut, Operations Research Letters 6, no. 1 (1987).

Reference [11]. Freisleben.B. and Merz.P , A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems, IEEE,1996. [12]. M. Held and R.M. Karp, The travelling salesman problem and minimum spanning trees, part I, Operations Research 18 (1970) 1138–1162; Part II, Mathematical Programming 1 (1971). [13]. Dorigo, M., A cooperative learning approach to the traveling salesman problem; Gambardella, L.M. Evolutionary Computation, IEEE, 1997

Reference [14]. M. Malek, M. Guruswamy, H. Owens and M. Pandya, A hybrid algorithm technique, Technical Report, Dept. of Computer Sciences, The University of Texas at Austin, TR-89-06, 1989. [15]. See, e.g., Finite Size Scaling and Numerical Simulation of Statistical Systems, edited by V. Privman, (World Scientific, Singapore, 1990). [16]. Kengo Katayama , Hiroyuki Narihisa, A new iterated local search algorithm using genetic crossover for the traveling salesman problem, Proceedings of the 1999 ACM symposium on Applied computing, 1999, San Antonio, Texas, United States.