GRASP. Greedy Randomized Adaptive. Search Procedure
|
|
- Darrell McDonald
- 5 years ago
- Views:
Transcription
1 GRASP Greedy Randomized Adaptive Search Procedure
2 Type of problems Combinatorial optimization problem: Finite ensemble E = {1,2,... n } Subset of feasible solutions F 2 Objective function f : 2 Minimisation Problem : S E R * E F, f ( S * ) f ( S )
3 Multi start meta heuristic -Create multiple initial solutions (construction) -Repair solution if it is infeasible (repair) -Run a local search in its neighborhood (local search) -Iterate over these three steps until stopping condition is met
4 History Concept was formalized by Feo and Resende. Article published in 1989
5 GRASP overview Most of the literature is base on the construction phase and improvements to the construction phase GRASP can be used with any combination of construction algorithms and local search algorithms
6 Plan Construction phase Improvements to the construction phase GRASP extensions: Path relinking Overview of a few others Parallel GRASP
7 Construction Phase Initial solutions are built iteratively by adding elements. At each stage of the initial solution construction, a Restricted Candidate List (RCL) is constructed.
8 Construction continued The RCL contains an ordering of the best next element to add to the solution. The next element is chosen from a truncation of this list Iterate until we have an initial solution
9 Construction algorithm procedure Greedy Randomized Construction(Seed) 1 Solution /0; 2 Initialize the set of candidate elements; 3 Evaluate the incremental costs of the candidate elements; 4 while there exists at least one candidate element do 5 Build the restricted candidate list (RCL); 6 Select an element s from the RCL at random; 7 Solution Solution+{s}; 8 Update the set of candidate elements; 9 Reevaluate the incremental costs; 10 end; 11 return Solution; end Greedy Randomized Construction.
10 RCL List construction Rank approach Keep the p best elements in the RCL. Take random element from RCL If p N, purely random construction If p 1, purely greed construction (and only one determinist initial solution)
11 RCL Continued Relative Threshold Approach Only keep elements in the RCL that are worst than best element by a factor element e E cost c ( e ) Only keep elements that obey : c ( e ) [ c min, c min + α ( c max c min )] Alpha is a hyper parameter Alpha 0, purely greedy algorithm Alpha 1, purely random algorithm
12 RCL tradeoff In both cases, balance must occur between purely random (multiple average initial solutions) and purely greedy (only one solution is tried). Also, computation cost of local search is inversely proportional to quality of initial solution and computation cost of local search > initial solution construction cost
13 RCL Tradeoff
14 RCL Tradeoff Typical alpha~0.2
15 Classic construction procedure shortcomings RCL construction can be expensive since it is constructed for every element added to the initial solution No history of initial solution is kept Past good initial solutions should influence construction of future solution
16 Construction phase improvements Many algorithms exist to improve construction phase (both for quality and complexity) Complexity reduction Reactive Grasp Bias functions Intelligent construction POP principle Cost perturbation
17 Complexity Reduction Random + greedy Randomly add first p elements to the initial solution Complete the solution with greedy approach Sampled greedy Only sample a few elements to put in RCL instead of all remaining elements
18 Reactive Grasp Variable Alpha At each new initial solution construction phase, choose Alpha from a set of possible Alpha. The probability of choosing a given Alpha is proportional to the quality of the past solutions with this Alpha
19 Reactive GRASP continued Formally: Set of Cost of possible Alpha : Probability of Average value of Relative score of each Alpha : incumbent solution : solutions with a given α i : α i : ψ p i z A q * i = i { = α z A * i, α 2,... α m } Updated Probabilty for α i : q i q i
20 Bias functions Next element to take from the RCL to add to solution under construction is usually chosen randomly from RCL Use a bias function based on rank so choice is no longer uniform random (same as gene selection through rank)
21 Bias function continued A few proposed bias functions proposed: uniform bias ( r ) = 1 linear bias ( r ) = 1/ r exponential bias ( r ) = e polynomial bias ( r ) = r r n probability of element σ of RCL = bias ( r bias ( ( σ )) r ( σ ))
22 Intelligent construction Keep a pool of elite solution This pool contains the best solutions that are sufficiently different between each other When constructing an initial solution, choose elements from RCL that will give a solution which contains patterns in elite solutions
23 Intelligent construction Example in TSP: Assume elite solutions contain the same 3 linked nodes The construction phase should favor the use of these same three nodes so they are linked
24 Proximate Optimality Principle (POP) Greedy construction is not always optimal. Especially on huge problems. Instead, run a few local search algorithms during construction phase Ex: Binato ran a local search at 40% and 80% during construction
25 Cost Perturbation Modify cost function when building RCL based on past solutions. Not necessarily applicable to every problem. Good results obtained using this for the Steiner tree problem (interconnect points on a plane)
26 Path Re-linking Given two solutions, explore the path linking these two solutions in the solution space. Start from one solution, go to best neighbor that brings us closer to the other solution. Iterate until reaching other solution.
27 Path re-linking end Formally: calculate moves while s evaluate cost of s 1 = if(s 1 1! min( < = global s 2 s i ) global best necessary to transform s best) = s s 1, i = s 1 + δ i, δ i ( s 1 1, into s s 2 ), 2 : ( i s 1, s 2 )
28 Path re-linking and GRASP Multiple ways of incorporating path relinking with GRASP. Most keep a pool of elite solutions. As before, this pool contains the best solutions that are sufficiently different between each other
29 Path re-linking and GRASP Strategies: Intensification: re-link all local solution with one or more elite solution Intensification: re-link elites between each other periodically (akin to an evolutionary process) Post-optimization: re-link every elite solution Post-optimization: submit pool to an evolutionary process
30 Intensification Find a local minima s through local search Choose a solution g from elite pool. g should be chosen so that it is different than s (different hamming distance for example). Determine which solution is the initial solution and which is the destination
31 Intensification continued Apply one of the path re-linking algorithms
32 Intensification variations Forward path re-linking Go from local minima to elite solution Backward path re-linking Go from elite solution to local minima (more logical since elite neighborhood should be on average better) Back and forward path re-linking Do both. Expensive but best of both solutions.
33 Intensification variations Mixed path re-linking Ping pong between local minima and elite solution. Should give the advantages of back and forward at half the cost Truncated path re-linking Only explore close neighborhood of elite solution and/or local minima
34 Intensification variations Greedy randomized adaptive path relinking Number of paths between solution is exponential in ( s 1, s 2 ) Instead of greedily exploring one path, occasionally choose the next element randomly Leads to more path being explored and diversifies the paths explored
35 Intensification variations Evolutionary path re-linking Every few GRASP iteration, re-link the solutions in the elite pool to create a new population of elites. Use greedy randomized path re-linking to diversify the elite pool
36 Path re-linking advantages Path re-linking helps reduce the time before a target optimum is reached
37 GRASP extensions and implementation ideas Use of a hash table of already explored solution can limit wasting time exploring multiple times the same solution neighborhood. Not all initial solutions need to be explored. Only promising ones should be investigated
38 GRASP hybrids Classic GRASP uses a simple local search. But it can use a VNS instead as the two can be seen as complimentary (construction vs. exploration). Tabu search can also be used. In fact, any search meta heuristic. Grasp construction phase can also be used to create an initial population for genetic algorithms.
39 Grasp algorithm comparison
40 Parallel Grasp Multi start heuristic particularly well suited for parallel implementation, running on multiple CPUs. Two types of strategies: Multiple walk, independent thread Multiple walk, cooperative thread
41 Independent thread Each CPU runs a subset of iterations of GRASP. Best solution of all CPUs is kept. CPUs do not exchange any other info. Linear gain in time. Does not work with intensification strategies and path re-linking
42 Cooperative thread Same principle but CPUs share info. Info can be pool of elites, Alpha bias functions etc. Usually, all shared info is managed by a central processor.
43 Cooperative vs. independent Cooperative is better with many CPUs as we loose 1 CPU for info sharing.
44 Conclusion GRASP is a pretty simple concept to implement Easily modified by changing construction algorithm or local search algorithm Low numbers of hyper parameter to tune Efficient parallel implementation
Greedy randomized adaptive search procedures: Advances, hybridizations, and applications
Greedy randomized adaptive search procedures: Advances, hybridizations, and applications Mauricio G.C. Resende and Celso C. Ribeiro Abstract GRASP is a multi-start metaheuristic for combinatorial optimization
More informationChapter 8 GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES 1 INTRODUCTION. Mauricio G.C. Resende AT&T Labs Research
Chapter 8 GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES Mauricio G.C. Resende AT&T Labs Research E-mail: mgcr@research.att.com Celso C. Ribeiro Catholic University of Rio de Janeiro E-mail: celso@inf.puc-rio.br
More informationAdaptive Large Neighborhood Search
Adaptive Large Neighborhood Search Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) VLSN and LNS By Very Large Scale Neighborhood (VLSN) local search, we
More informationConstructive meta-heuristics
Constructive meta-heuristics Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Improving constructive algorithms For many problems constructive algorithms
More informationn Informally: n How to form solutions n How to traverse the search space n Systematic: guarantee completeness
Advanced Search Applications: Combinatorial Optimization Scheduling Algorithms: Stochastic Local Search and others Analyses: Phase transitions, structural analysis, statistical models Combinatorial Problems
More informationGRASP WITH PATH-RELINKING FOR THE GENERALIZED QUADRATIC ASSIGNMENT PROBLEM
GRASP WITH PATH-RELINKING FOR THE GENERALIZED QUADRATIC ASSIGNMENT PROBLEM GERALDO R. MATEUS, MAURICIO G.C. RESENDE, AND RICARDO M. A. SILVA Abstract. The generalized quadratic assignment problem (GQAP)
More informationA Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems
A Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems AutOrI LAB, DIA, Roma Tre Email: mandal@dia.uniroma3.it January 16, 2014 Outline 1 An example Assignment-I Tips Variants
More informationGRASP WITH PATH-RELINKING FOR THE GENERALIZED QUADRATIC ASSIGNMENT PROBLEM
GRASP WITH PATH-RELINKING FOR THE GENERALIZED QUADRATIC ASSIGNMENT PROBLEM GERALDO R. MATEUS, MAURICIO G.C. RESENDE, AND RICARDO M. A. SILVA Abstract. The generalized quadratic assignment problem (GQAP)
More informationA parallel GRASP for the Steiner problem in graphs using a hybrid local search
A parallel GRASP for the Steiner problem in graphs using a hybrid local search Maurício G. C. Resende Algorithms & Optimization Research Dept. AT&T Labs Research Florham Park, New Jersey mgcr@research.att.com
More informationGRASP and path-relinking: Recent advances and applications
and path-relinking: Recent advances and applications Mauricio G.C. Rese Celso C. Ribeiro April 6, 23 Abstract This paper addresses recent advances and application of hybridizations of greedy randomized
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 informationPARALLEL GRASP WITH PATH-RELINKING FOR JOB SHOP SCHEDULING
PARALLEL GRASP WITH PATH-RELINKING FOR JOB SHOP SCHEDULING R.M. AIEX, S. BINATO, AND M.G.C. RESENDE Abstract. In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set
More informationCHAPTER 3.4 AND 3.5. Sara Gestrelius
CHAPTER 3.4 AND 3.5 Sara Gestrelius 3.4 OTHER EVOLUTIONARY ALGORITHMS Estimation of Distribution algorithms Differential Evolution Coevolutionary algorithms Cultural algorithms LAST TIME: EVOLUTIONARY
More informationA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
Iranian Journal of Operations Research Vol. 6, No. 1, 2015, pp. 65-78 A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem S. Sattari 1, F. Didehvar 2,* The routing cost of a spanning
More informationNon-deterministic Search techniques. Emma Hart
Non-deterministic Search techniques Emma Hart Why do local search? Many real problems are too hard to solve with exact (deterministic) techniques Modern, non-deterministic techniques offer ways of getting
More informationMetaheuristics : from Design to Implementation
Metaheuristics : from Design to Implementation Chap 2 Single-solution based Metaheuristics Wiley, 2009 (596pp) ISBN: 978-0-470-27858-1 Single solution-based metaheuristics Improvement of a single solution
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Single-State Meta-Heuristics Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Recap: Goal is to Find the Optimum Challenges of general optimization
More informationSimple mechanisms for escaping from local optima:
The methods we have seen so far are iterative improvement methods, that is, they get stuck in local optima. Simple mechanisms for escaping from local optima: I Restart: re-initialise search whenever a
More informationNote: In physical process (e.g., annealing of metals), perfect ground states are achieved by very slow lowering of temperature.
Simulated Annealing Key idea: Vary temperature parameter, i.e., probability of accepting worsening moves, in Probabilistic Iterative Improvement according to annealing schedule (aka cooling schedule).
More informationProceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Solving Assembly Line Balancing Problem in the State of Multiple- Alternative
More informationOptimization Techniques for Design Space Exploration
0-0-7 Optimization Techniques for Design Space Exploration Zebo Peng Embedded Systems Laboratory (ESLAB) Linköping University Outline Optimization problems in ERT system design Heuristic techniques Simulated
More informationA GRASP with restarts heuristic for the Steiner traveling salesman problem
MIC/MAEB 2017 id 1 A GRASP with restarts heuristic for the Steiner traveling salesman problem Ruben Interian, Celso C. Ribeiro Institute of Computing, Universidade Federal Fluminense, Niterói, RJ 24210-346,
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 informationa local optimum is encountered in such a way that further improvement steps become possible.
Dynamic Local Search I Key Idea: Modify the evaluation function whenever a local optimum is encountered in such a way that further improvement steps become possible. I Associate penalty weights (penalties)
More informationA GRASP FOR JOB SHOP SCHEDULING
A GRASP FOR JOB SHOP SCHEDULING S. BINATO, W.J. HERY, D.M. LOEWENSTERN, AND M.G.C. RESENDE Abstract. In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines.
More informationPARALLEL GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES
PARALLEL GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES MAURICIO G.C. RESENDE AND CELSO C. RIBEIRO ABSTRACT. A GRASP (Greedy Randomized Adaptive Search Procedure) is a metaheuristic for producing good-quality
More informationLocal search with perturbations for the prize collecting Steiner tree problem in graphs
Local search with perturbations for the prize collecting Steiner tree problem in graphs Celso C. Ribeiro Catholic University of Rio de Janeiro, Brazil (on leave at Algorithms & Optimization Research Dept.,
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 informationAn Ant Colony Optimization Meta-Heuristic for Subset Selection Problems
Chapter I An Ant Colony Optimization Meta-Heuristic for Subset Selection Problems Christine Solnon I.1 Derek Bridge I.2 Subset selection problems involve finding an optimal feasible subset of an initial
More informationTABU search and Iterated Local Search classical OR methods
TABU search and Iterated Local Search classical OR methods tks@imm.dtu.dk Informatics and Mathematical Modeling Technical University of Denmark 1 Outline TSP optimization problem Tabu Search (TS) (most
More informationOutline. TABU search and Iterated Local Search classical OR methods. Traveling Salesman Problem (TSP) 2-opt
TABU search and Iterated Local Search classical OR methods Outline TSP optimization problem Tabu Search (TS) (most important) Iterated Local Search (ILS) tks@imm.dtu.dk Informatics and Mathematical Modeling
More informationMETAHEURISTIC HYBRIDIZATION WITH GRASP
METAHEURISTIC HYBRIDIZATION WITH GRASP MAURICIO G. C. RESENDE Abstract. GRASP or greedy randomized adaptive search procedure is a multi-start metaheuristic that repeatedly applies local search starting
More informationPre-requisite Material for Course Heuristics and Approximation Algorithms
Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
More informationHybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
More informationEffective probabilistic stopping rules for randomized metaheuristics: GRASP implementations
Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations Celso C. Ribeiro Isabel Rosseti Reinaldo C. Souza Universidade Federal Fluminense, Brazil July 2012 1/45 Contents
More informationA Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair and Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology,
More informationGRASP with evolutionary path-relinking for the antibandwidth problem
GRASP with evolutionary path-relinking for the antibandwidth problem VIII Metaheuristics International Conference (MIC 009) Hamburg, Germany July 3-6, 009 Mauricio G. C. Resende AT&T Labs Research Florham
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 informationROBERTO BATTITI, MAURO BRUNATO. The LION Way: Machine Learning plus Intelligent Optimization. LIONlab, University of Trento, Italy, Apr 2015
ROBERTO BATTITI, MAURO BRUNATO. The LION Way: Machine Learning plus Intelligent Optimization. LIONlab, University of Trento, Italy, Apr 2015 http://intelligentoptimization.org/lionbook Roberto Battiti
More informationOutline of the module
Evolutionary and Heuristic Optimisation (ITNPD8) Lecture 2: Heuristics and Metaheuristics Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ Computing Science and Mathematics, School of Natural Sciences University
More informationSCATTER SEARCH AND PATH-RELINKING: FUNDAMENTALS, ADVANCES, AND APPLICATIONS
SCATTER SEARCH AND PATH-RELINKING: FUNDAMENTALS, ADVANCES, AND APPLICATIONS M.G.C. RESENDE, C.C. RIBEIRO, F. GLOVER, AND R. MARTÍ Abstract. Scatter Search is an evolutionary metaheuristic that explores
More informationA Memetic Algorithm for Parallel Machine Scheduling
A Memetic Algorithm for Parallel Machine Scheduling Serafettin Alpay Eskişehir Osmangazi University, Industrial Engineering Department, Eskisehir, Turkiye Abstract - This paper focuses on the problem of
More informationA GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR JOB SHOP SCHEDULING
A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR JOB SHOP SCHEDULING S. BINATO, W.J. HERY, D.M. LOEWENSTERN, AND M.G.C. RESENDE Abstract. In the job shop scheduling problem (JSP), a finite set of jobs
More informationAlgorithm Design (4) Metaheuristics
Algorithm Design (4) Metaheuristics Takashi Chikayama School of Engineering The University of Tokyo Formalization of Constraint Optimization Minimize (or maximize) the objective function f(x 0,, x n )
More informationMETAHEURISTIC. Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal.
METAHEURISTIC Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca March 2015 Overview Heuristic Constructive Techniques: Generate
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 21, 2016 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff Inria Saclay Ile-de-France 2 Exercise: The Knapsack
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 6, 2015 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Lille Nord Europe 2 Exercise: The Knapsack Problem
More informationLOCAL SEARCH WITH PERTURBATIONS FOR THE PRIZE-COLLECTING STEINER TREE PROBLEM IN GRAPHS
LOCAL SEARCH WITH PERTURBATIONS FOR THE PRIZE-COLLECTING STEINER TREE PROBLEM IN GRAPHS S.A. CANUTO, M.G.C. RESENDE, AND C.C. RIBEIRO Abstract. Given an undirected graph with prizes associated with its
More informationVNS-based heuristic with an exponential neighborhood for the server load balancing problem
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 47 (2015) 53 60 www.elsevier.com/locate/endm VNS-based heuristic with an exponential neighborhood for the server load
More informationHYBRID GRASP HEURISTICS
HYBRID GRASP HEURISTICS PAOLA FESTA AND MAURICIO G.C. RESENDE Abstract. Experience has shown that a crafted combination of concepts of different metaheuristics can result in robust combinatorial optimization
More informationunderlying iterative best improvement procedure based on tabu attributes. Heuristic Optimization
Tabu Search Key idea: Use aspects of search history (memory) to escape from local minima. Simple Tabu Search: I Associate tabu attributes with candidate solutions or solution components. I Forbid steps
More informationHeuristis for Combinatorial Optimization
Heuristis for Combinatorial Optimization Luigi De Giovanni Dipartimento di Matematica, Università di Padova Luigi De Giovanni Heuristic for Combinatorial Optimization 1 / 59 Exact and heuristic methods
More informationArtificial Intelligence
Artificial Intelligence Informed Search and Exploration Chapter 4 (4.3 4.6) Searching: So Far We ve discussed how to build goal-based and utility-based agents that search to solve problems We ve also presented
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 informationTwo approaches. Local Search TSP. Examples of algorithms using local search. Local search heuristics - To do list
Unless P=NP, there is no polynomial time algorithm for SAT, MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP,. But we have to solve (instances of) these problems anyway what
More informationRich Vehicle Routing Problems Challenges and Prospects in Exploring the Power of Parallelism. Andreas Reinholz. 1 st COLLAB Workshop
Collaborative Research Center SFB559 Modeling of Large Logistic Networks Project M8 - Optimization Rich Vehicle Routing Problems Challenges and Prospects in Exploring the Power of Parallelism Andreas Reinholz
More informationVariable Neighbourhood Search (VNS)
Variable Neighbourhood Search (VNS) Key dea: systematically change neighbourhoods during search Motivation: recall: changing neighbourhoods can help escape local optima a global optimum is locally optimal
More informationVariable Neighborhood Search
Variable Neighborhood Search Hansen and Mladenovic, Variable neighborhood search: Principles and applications, EJOR 43 (2001) 1 Basic notions of VNS Systematic change of the neighborhood in search Does
More informationScatter search and path-relinking: Fundamentals, advances, and applications
Scatter search and path-relinking: Fundamentals, advances, and applications Mauricio G.C. Resende, Celso C. Ribeiro, Fred Glover, and Rafael Martí Abstract Scatter search is an evolutionary metaheuristic
More informationVariable Neighbourhood Search (VNS)
Variable Neighbourhood Search (VNS) Key dea: systematically change neighbourhoods during search Motivation: recall: changing neighbourhoods can help escape local optima a global optimum is locally optimal
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 informationA HYBRID LAGRANGEAN HEURISTIC WITH GRASP AND PATH-RELINKING FOR SET K-COVERING
A HYBRID LAGRANGEAN HEURISTIC WITH GRASP AND PATH-RELINKING FOR SET K-COVERING LUCIANA S. PESSOA, MAURICIO G. C. RESENDE, AND CELSO C. RIBEIRO Abstract. The set k-covering problem is an extension of the
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 informationIMPLEMENTATION OF A FIXING STRATEGY AND PARALLELIZATION IN A RECENT GLOBAL OPTIMIZATION METHOD
IMPLEMENTATION OF A FIXING STRATEGY AND PARALLELIZATION IN A RECENT GLOBAL OPTIMIZATION METHOD Figen Öztoprak, Ş.İlker Birbil Sabancı University Istanbul, Turkey figen@su.sabanciuniv.edu, sibirbil@sabanciuniv.edu
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 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 informationThe MAX-SAX Problems
STOCHASTIC LOCAL SEARCH FOUNDATION AND APPLICATION MAX-SAT & MAX-CSP Presented by: Wei-Lwun Lu 1 The MAX-SAX Problems MAX-SAT is the optimization variant of SAT. Unweighted MAX-SAT: Finds a variable assignment
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 informationTabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach
Tabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach Carlos A. S. Passos (CenPRA) carlos.passos@cenpra.gov.br Daniel M. Aquino (UNICAMP, PIBIC/CNPq)
More informationHybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems
Hybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems Fabio Parisini Tutor: Paola Mello Co-tutor: Michela Milano Final seminars of the XXIII cycle of the doctorate
More informationA Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem Smail Niar, Arnaud Freville Universitéde Valenciennes, LIMAV Le Mont Houy BP 311-59304 Valenciennes Cedex-France niar, freville@univ-valenciennes.fr
More informationPARALLEL STRATEGIES FOR GRASP WITH PATH-RELINKING
PARALLEL STRATEGIES FOR GRASP WITH PATH-RELINKING RENATA M. AIEX AND MAURICIO G.C. RESENDE ABSTRACT. A Greedy Randomized Adaptive Search Procedure (GRASP) is a metaheuristic for combinatorial optimization.
More informationMETAHEURISTICS Genetic Algorithm
METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca Genetic Algorithm (GA) Population based algorithm
More informationGRASP PAOLA FESTA AND MAURICIO G.C. RESENDE
GRASP PAOLA FESTA AND MAURICIO G.C. RESENDE Abstract. GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for computing good-quality solutions of combinatorial optimization
More informationHeuristis for Combinatorial Optimization
Heuristis for Combinatorial Optimization Luigi De Giovanni Dipartimento di Matematica, Università di Padova Luigi De Giovanni Heuristic for Combinatorial Optimization 1 / 57 Exact and heuristic methods
More informationComputational complexity
Computational complexity Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Definitions: problems and instances A problem is a general question expressed in
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 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 informationA GRASP approach for the delay-constrained multicast routing problem
MISTA 2009 A GRASP approach for the delay-constrained multicast routing problem Ying Xu Rong Qu Abstract The rapid development of real-time multimedia applications requires Quality of Service (QoS) based
More informationChapter 9: Genetic Algorithms
Computational Intelligence: Second Edition Contents Compact Overview First proposed by Fraser in 1957 Later by Bremermann in 1962 and Reed et al in 1967 Popularized by Holland in 1975 Genetic algorithms
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 informationUninformed Search Methods. Informed Search Methods. Midterm Exam 3/13/18. Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall
Midterm Exam Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall Covers topics through Decision Trees and Random Forests (does not include constraint satisfaction) Closed book 8.5 x 11 sheet with notes
More informationThe Heuristic (Dark) Side of MIP Solvers. Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL
The Heuristic (Dark) Side of MIP Solvers Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL 1 Table of content [Lodi], The Heuristic (Dark) Side of MIP Solvers, Hybrid Metaheuristics, 273-284,
More informationAnalysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems
Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems Elad Iwanir and Tami Tamir Abstract Many real-life applications involve systems that change dynamically over time.
More informationPATH-RELINKING INTENSIFICATION METHODS FOR STOCHASTIC LOCAL SEARCH ALGORITHMS
PATH-RELINKING INTENSIFICATION METHODS FOR STOCHASTIC LOCAL SEARCH ALGORITHMS CELSO C. C. RIBEIRO AND MAURICIO G. C. RESENDE Abstract. Path-relinking is major enhancement to heuristic search methods for
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 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 informationGRASP: Greedy Randomized Adaptive Search Procedures A metaheuristic for combinatorial optimization
: Greedy Randomized Adaptive Search Procedures A metaheuristic for combinatorial optimization Maurício G. C. Resende Algorithms & Optimization Research Dept. AT&T Labs Research Florham Park, New Jersey
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 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 informationA Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices
A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices Yaser Alkhalifah Roger L. Wainwright Department of Mathematical Department of Mathematical and Computer Sciences and Computer
More informationA Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem
J Math Model lgor (2008) 7:59 78 DOI 10.1007/s10852-007-9073-6 Particle Swarm Optimization lgorithm with Path Relinking for the Location Routing Problem Yannis Marinakis Magdalene Marinaki Received: 5
More informationGRASP with Path-Relinking for the SONET Ring Assignment Problem
GRASP with Path-Relinking for the SONET Ring Assignment Problem Lucas de O. Bastos Inst. de Computação - UFF Niterói - RJ - Brasil lbastos@ic.uff.br Luiz S. Ochi Inst. de Computação - UFF Niterói - RJ
More informationA Tabu Search solution algorithm
Chapter 5 A Tabu Search solution algorithm The TS examines a trajectory sequence of solutions and moves to the best neighbor of the current solution. To avoid cycling, solutions that were recently examined
More informationTABU SEARCH FOR MIXED INTEGER PROGRAMMING
Chapter 11 TABU SEARCH FOR MIXED INTEGER PROGRAMMING João Pedro Pedroso Departamento de Ciência de Computadores, Faculdade de Ciências da Universidade do Porto, Rua do Campo Alegre, 823 4150-180 Porto,
More informationRANDOMIZED HEURISTICS FOR THE MAX-CUT PROBLEM
RANDOMIZED HEURISTICS FOR THE MAX-CUT PROBLEM P. FESTA a, P. M. PARDALOS b, M. G. C. RESENDE c, and C. C. RIBEIRO d a University of Napoli FEDERICO II, Napoli, Italy; b University of Florida, Gainesville,
More informationConflict-based Statistics
Conflict-based Statistics Tomáš Müller 1, Roman Barták 1 and Hana Rudová 2 1 Faculty of Mathematics and Physics, Charles University Malostranské nám. 2/25, Prague, Czech Republic {muller bartak}@ktiml.mff.cuni.cz
More information3. Genetic local search for Earth observation satellites operations scheduling
Distance preserving recombination operator for Earth observation satellites operations scheduling Andrzej Jaszkiewicz Institute of Computing Science, Poznan University of Technology ul. Piotrowo 3a, 60-965
More informationA GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
Intl. Trans. in Op. Res. 24 (2017) 1 18 DOI: xx.xxxx/itor.xxxxx INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman
More informationArtificial Intelligence Methods (G52AIM)
Artificial Intelligence Methods (G52AIM) Dr Rong Qu rxq@cs.nott.ac.uk Variable Neighborhood Search Idea of VNS So far on our local search based approaches, only one neighbourhood is employed To escape
More information