Scatter Search: Methodology and Applications
|
|
- Jasper Sharp
- 6 years ago
- Views:
Transcription
1 Scatter Search: Methodology and Applications Manuel Laguna University of Colorado Rafael Martí University of Valencia
2 Based on Scatter Search: Methodology and Implementations in C Laguna, M. and R. Martí Kluwer Academic Publishers, Boston,
3 Scatter Search Methodology
4 Metaheuristic A metaheuristic refers to a master strategy that guides and modifies other heuristics to produce solutions beyond those that are normally generated in a quest for local optimality. A metaheuristic is a procedure that has the ability to escape local optimality 4
5 Typical Search Trajectory Objective Function Value Best Value Iteration 5
6 Metaheuristic Classification x/y/z Classification x = A (adaptive memory) or M (memoryless( memoryless) y = N (systematic neighborhood search) or S (random sampling) z = 1 (one current solution) or P (population of solutions) Some Classifications Tabu search (A/N/1) Genetic Algorithms (M/S/P) Scatter Search (M/N/P) 6
7 Scatter Search Diversification Generation Method Repeat until P = PSize P Improvement Method Improvement Method Reference Set Update Method Solution Combination Method Subset Generation Method Stop if no more new solutions RefSet 7
8 Scatter Search with Rebuilding Diversification Generation Method Repeat until P = PSize P Improvement Method Improvement Method Reference Set Update Method Solution Combination Method Stop if MaxIter reached Subset Generation Method Improvement Method No more new solutions RefSet Diversification Generation Method 8
9 Tutorial Unconstrained Nonlinear Optimization Problem Minimize ( 2 ) 2 2 ( ) ( ) 2 x x + x + x x + ( 1 x ) 2 ( ) ( ) ) 2 2 x 1 + x ( x 1)( x 1) Subject to 10 x i 10 for i = 1, K,4 9
10 Diversification Generation Method Subrange 1 Subrange 2 Subrange 3 Subrange Probability of selecting a subrange is proportional to a frequency count 10
11 11 11 Diverse Solutions Diverse Solutions x x x x f(x) Solution
12 Improvement Method Solution x 1 x 2 x 3 x 2 f(x) Nelder and Mead (1965) 12
13 Reference Set Update Method (Initial RefSet) b 1 high-quality solutions Objective function value to measure quality b 2 diverse solutions Max-min criterion and Euclidean distances to measure diversity RefSet of size b 13
14 Initial RefSet High-Quality Solutions Solution number in P x 1 x 2 x 3 x 4 f(x) Diverse Solutions Solution x 1 x 2 x 3 x 4 f(x)
15 Subset Generation Method All pairs of reference solutions that include at least one new solution The method generates (b2-b)/2 b)/2 pairs from the initial RefSet 15
16 Combination Method y 10 9 x 3 = (9,7) r = 2/3 x 3 = x 1 - r(x 2 - x 1 ) x 4 = x 1 + r(x 2 - x 1 ) x 5 = x 2 + r(x 2 - x 1 ) 8 x 1 = (5,7) x 4 = (6.5,5.5) r = 1/2 x 2 = (8,4) 3 2 x 5 = (11,1) r = x 16
17 Alternative Combination Method y x 3 x 1 = (5,7) x 3 = x 1 - r(x 2 - x 1 ) x 4 = x 1 + r(x 2 - x 1 ) x 5 = x 2 + r(x 2 - x 1 ) x 4 x 2 = (8,4) 3 2 x x 17
18 Reference Set Update Method Quality Best Best New trial solution b Worst b Worst RefSet of size b Updated RefSet 18
19 Static Update Pool of new trial solutions Quality Best b Worst RefSet of size b Updated RefSet = Best b from RefSet Pool 19
20 RefSet after Update x 1 x 2 x 3 x 4 f(x)
21 Tutorial 0-11 Knapsack Problem Maximize 10x x 2 + 9x 3 + 8x 4 + 7x 5 + 5x 6 + 9x 7 + 3x 8 S.t. 7x x 2 + 8x 3 + 9x 4 + 8x 5 + 6x x 7 + 5x 8 < 100 x i = { 0, 1} for i = 1,, 8 21
22 Additional Strategies Reference Set Rebuilding Multi-tier tier Subset Generation Subsets of size > 2 Combination Method Variable number of solutions 22
23 Rebuilding RefSet Rebuilt RefSet b 1 b 2 Diversification Generation Method Reference Set Update Method 23
24 2-Tier RefSet Solution Combination Method Improvement Method Try here first RefSet b 1 If it fails, then try here b 2 24
25 3-Tier RefSet Solution Combination Method Improvement Method RefSet Try here first b 1 If it fails, then try here b 2 Try departing solution here b 3 25
26 Subset Generation Subset Type 1: all 2-element 2 subsets. Subset Type 2: 3-element subsets derived from the 2-element 2 subsets by augmenting each 2-element 2 subset to include the best solution not in this subset. Subset Type 3: 4-element subsets derived from the 3-element 3 subsets by augmenting each 3-element 3 subset to include the best solutions not in this subset. Subset Type 4: the subsets consisting of the best i elements, for i = 5 to b. 26
27 Subsets of Size > 2 90% 80% 70% 60% 50% 40% 30% 20% 10% 0% Random Type 1 Type 2 Type 3 Type 4 LOLIB 27
28 Variable Number of Solutions Quality Best Generate 5 solutions Generate 3 solutions Generate 1 solution b Worst RefSet of size b 28
29 Hybrid Approaches Use of Memory Tabu Search mechanisms for intensification and diversification GRASP Constructions Combination Methods GA Operators Path Relinking 29
30 Multiobjective Scatter Search This is a fruitful research area Many multiobjective evolutionary approaches exist (Coello( Coello,, et al. 2002) SS can use similar techniques developed for MOEA (multiobjective( evolutionary approches) 30
31 Multiobjective EA Techniques Independent Sampling Search on f(x) = w i f i (x) Change weights and rerun Criterion Selection Divide reference set into k subsets Admission to i th subset is according to f i (x) 31
32 Scatter Search Applications and Implementations
33 Scatter Search Elements Diversification Generator Method Improvement Method Reference Set Initialization Update Rebuild Subset Generation Method Solution Combination Method Problem Independent 33
34 C Code Objective Illustrate the methods and strategies Use it in different applications Extend the previous version: Modularity Versatility Non experts (use as it is with small changes) Experts (can easily introduce important modifications) Ansi C (different platforms and systems) 34
35 Basic Design Diversification Generation Method Repeat until P = PSize P Improvement Method Improvement Method Reference Set Update Method Solution Combination Method Subset Generation Method Stop if no more new solutions RefSet 35
36 RefSet Data Structure typedef struct REFSET { int b; /* Size */ double **sol; double *ObjVal; /* Solutions */ /** Objective value of solutions */ int *order; /* Order of solutions */ int *iter; /* Entering iteration */ int NewSolutions; /* =1 if new element has been added */ } REFSET; RefSet b sol ObjVal order iter NewSolutions nvar 36
37 Main Function int main(void) { SS *pb* pb; /* Pointer to problem data */ int nvar = 10; /* Number of variables */ int b = 10; /* Size of reference set */ int PSize = 100; /* Size of P */ pb = SSProblem_Definition(nvar,b,PSize (nvar,b,psize); /* Insert here the Scatter Search code */ SSFree_DataStructures(pb (pb); return 0; } 37
38 Basic Design pb = SSProblem_Definition(nvar,b,PSize); SSCreate_P(pb (pb); SSCreate_RefSet(pb (pb); While(pb pb->rs->newsolutions) SSUpdate_RefSet(pb (pb); SSBestSol(pb,sol,&value); SSFree_DataStructures(pb); 38
39 Advanced Design pb = SSProblem_Definition(nvar,b,PSize); SSCreate_P(pb (pb); SSCreate_RefSet(pb (pb); for(iter=1; Iter< ; Iter++) { if(pb->rs rs->newsolutions) SSUpdate_RefSet(pb (pb); else SSRebuild_RefSet(pb (pb); } SSBestSol(pb,sol,&value); SSFree_DataStructures(pb); 39
40 SSCreate_P while(currentpsize <= pb->p >p->psize) { SSGenerate_Sol(pb,sol); obj_val = sol_value(sol); SSImprove_solution(pb,sol,&obj_val (pb,sol,&obj_val); /* Check whether sol is a new solution */ j=1;equal=0; while(j<currentpsize &&!equal) equal=ssequalsol SSEqualSol(sol,pb->p->sol[j++],pb->nvar); /* Add improved solution to P */ if(!equal){ for(j=1;j<=pb pb->nvar;j++) pb->p >p->sol[currentpsize][j]=sol[j]; ]=sol[j]; pb->p >p->objval[currentpsize++] = obj_val; } } 40
41 SSCreate_RefSet /* Order solutions in P */ p_order = SSOrder(pb (pb->p->objval, pb->p >p->psize, pb->opt); b1 = pb->rs rs->b / 2; /* Add the first (best)) b1 solutions in P to RefSet */ /* Compute minimum distances from P to RefSet */ for(i=1;i<=pb pb->p->psize;i++) min_dist[i]= SSDist_RefSet(pb,b1,pb (pb,b1,pb->p->sol[i]); >sol[i]); /* Add b-b1 b b1 diverse solutions to RefSet */ for(i=b1+1;i<=pb pb->rs->b;i++) { a=ssmax_dist_index(pb,min_dist SSMax_dist_index(pb,min_dist); /* Copy sol a from P to Refset */ SSUpdate_distances(pb,min_dist,i (pb,min_dist,i); } /* Compute the order in RefSet: order */ pb->rs rs->newsolutions = 1; pb->currentiter = 1; 41
42 SSUpdate_RefSet pb->rs rs->newsolutions=0; SSCombine_RefSet(pb); pb->currentiter CurrentIter++; for(a=1;a<=pb pb->pool_size;a++) { value=sol_value(pb sol_value(pb->pool[a]); SSImprove_solution(pb,pb->pool[a],&value); SSTryAdd_RefSet(pb,pb->pool[a],value); } pb->pool_size pool_size=0; 42
43 Advanced Designs Reference Set Update Dynamic / Static 2 Tier / 3 Tier Subset Generation Use of Memory Explicit Memory Attributive Memory Path Relinking 43
44 An Example The Linear Ordering Problem Given a matrix of weights E = {e ij } mxm, the LOP consists of finding a permutation p of the columns (and rows) in order to maximize the sum of the weights in the upper triangle Applications Maximize Triangulation for Input-Output Economic Tables. Aggregation of individual preferences Classifications in Sports C ( p)= e E m 1 i= 1 m j=+ i 1 p p i j
45 An Instance p=(1,2,3,4) c E (p)= =37 p*=(3,4,1,2) c E (p*)= =47
46 SS for the LOP Complete the generic code Design specific methods for the problem- dependent elements Diversification Generator Method Improvement Method Combination Method 46
47 Diversification Generator Use of problem structure to create methods in order to achieve a good balance between quality and diversity. Quality Deterministic constructive method Diversity Random Generator Systematic Generators (Glover, 1998) GRASP constructions. The method randomly selects from a short list of the most attractive sectors. Use of Memory Modifying a measure of attractiveness proposed by Becker with a frequency-based memory measure that discourages sectors from occupying positions that they have frequently occupied 47
48 Diversity vs. Quality Compare several diversification generators Create a set of 100 solutions with each one d = Standardized Diversity C = Standardized Quality C+ d d 0.2 C 0.0 DG05 DG04 DG02 DG01 DG09 DG08 DG06 DG03 DG07 DG10 Procedure 48
49 Improvement Method INSERT_MOVE (pj( pj,, i) consist of deleting pj from its current position j to be inserted in position i Apply a first strategy scans the list of sectors in search for the first sector whose movement results in an improvement Ep ( )= MoveValue = C E (p ) - C E (p) CE (p ) = 78 + (1-4) + (6-0) + (2-6) + (13-4) = = 86 49
50 Solution Combination Method The method scans (from left to right) each reference permutation. Each reference permutation votes for its first element that is still s not included in the combined permutation ( incipient element ). The voting determines the next element to enter the first still unassigned position of the combined permutation. The vote of a given reference solution is weighted according to the incipient element s position. Incipient element (3,1,4,2,5) votes for 4 Solution under construction: (1,4,3,5,2) votes for 4 (3,1,2,4,_ ) (2,1,3,5,4) votes for 5 50
51 Experiments with LOLIB 49 Input-Output Economic Tables GD CK CK10 TS SS Optima deviation Number of optima Run time (seconds onds) 0.15% 0.15% 0.02% 0.04% 0.01%
52 Another Example A commercial SS implementation OptQuest Callable Library (by OptTek) As other context-independent methods separates the method and the evaluation. Output Optimization Procedure Input System Evaluator 52
53 OptQuest based Applications Solution Generator OptQuest Callable Library User-written Application Solution Evaluator System Evaluator 53
54 Feasibility and Evaluation User Implementation x x * F(x * ) Constraint Mapping Complex System Evaluator G(x * ) Penalty Function P(x * ) The OptQuest engine generates a new solution Returns to OptQuest 54
55 Comparison with Genocop Test on 28 hard nonlinear instances 1.0E+13 Average objective function value (Logarithmic scale) 1.0E E E E E E E E+05 Genocop OCL 1.0E E Evaluations 55
56 Conclusions The development of metaheuristics usually entails a fair amount of experimentation ( skill comes from practice ). Code objectives: Quick Start Benchmark Advanced Designs Scatter Search provides a flexible framework to develop solving methods. 56
57 Call for Papers European Journal of Operational Research Feature Issue on SCATTER SEARCH METHODS FOR OPTIMIZATION Deadline for submissions: June 30,
58 Questions 58
Chapter 8 SCATTER SEARCH 1. INTRODUCTION
Chapter 8 SCATTER SEARCH Manuel Laguna 1 and Rafael Martí 2 1 Leeds School of Business, University of Colorado at Boulder, laguna@colorado.edu; 2 Dpto. de Estadística e Investigación Operativa, Universidad
More informationHEARIN CENTER FOR ENTERPRISE SCIENCE
Working Paper Series HEARIN CENTER FOR ENTERPRISE SCIENCE HCES-02-99 An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem by Vicente Campos Rafael Martí Fred Glover Manuel Laguna
More informationRegensburger DISKUSSIONSBEITRÄGE zur Wirtschaftswissenschaft
Regensburger DISKUSSIONSBEITRÄGE zur Wirtschaftswissenschaft A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem University of Regensburg Discussion Papers in Economics No. 415, November
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
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 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 informationUnidimensional Search for solving continuous high-dimensional optimization problems
2009 Ninth International Conference on Intelligent Systems Design and Applications Unidimensional Search for solving continuous high-dimensional optimization problems Vincent Gardeux, Rachid Chelouah,
More informationOptimization of Complex Systems with OptQuest
Optimization of Complex Systems with OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Latest revision: April 8,
More informationScatter Search. 1. Introduction. Fred Glover 1, Manuel Laguna 1 and Rafael Martí 2
Scatter Search Fred Glover 1, Manuel Laguna 1 and Rafael Martí 2 1 Leeds School of Business, University of Colorado, Boulder, CO 80309-0419, USA, {Fred.Glover}{Manuel.Laguna}@Colorado.edu 2 Departamento
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 informationScatter Search and Path Relinking: A Tutorial on the Linear Arrangement Problem
International Journal of Swarm Intelligence Research, 2(2), 1-21, April-June 2011 1 Scatter Search and Path Relinking: A Tutorial on the Linear Arrangement Problem Rafael Martí, Universidad de Valencia,
More informationA Hybrid Intelligent Optimization Algorithm for an Unconstrained Single Level Lot-sizing Problem
Send Orders for Reprints to reprints@benthamscience.ae 484 The Open Cybernetics & Systemics Journal, 2014, 8, 484-488 Open Access A Hybrid Intelligent Optimization Algorithm for an Unconstrained Single
More informationGRASP and Path Relinking for the Two-dimensional Two-staged Cutting Stock Problem
GRASP and Path Relinking for the Two-dimensional Two-staged Cutting Stock Problem Ramón Alvarez-Valdes 1, Rafael Martí 1, Antonio Parajón 2 and Jose M. Tamarit 1 1 Departamento de Estadística e I.O. Universidad
More informationMetaheuristics: a quick overview
Metaheuristics: a quick overview Marc Sevaux University of Valenciennes CNRS, UMR 8530, LAMIH / Production systems Marc.Sevaux@univ-valenciennes.fr Marc Sevaux TEW Antwerp 2003 1 Outline Outline Neighborhood
More informationPrinciples of Scatter Search
Principles of Scatter Search RAFAEL MARTÍ Dpto. de Estadística e Investigación Operativa, Facultad de Matemáticas, Universidad de Valencia, Dr. Moliner 50, 4600 Burjassot (Valencia) Spain. Rafael.Marti@uv.es
More informationScatter Search for the Bi-criteria p-median p-dispersion problem
Noname manuscript No. (will be inserted by the editor) Scatter Search for the Bi-criteria p-median p-dispersion problem J. Manuel Colmenar Arild Hoff Rafael Martí Abraham Duarte Received: date / Accepted:
More informationLamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems
Repair and Repair in EMO Algorithms for Multiobjective 0/ Knapsack Problems Shiori Kaige, Kaname Narukawa, and Hisao Ishibuchi Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho,
More informationSCATTER SEARCH BASED METAHEURISTIC FOR ROBUST OPTIMIZATION OF THE DEPLOYING OF DWDM TECHNOLOGY ON OPTICAL NETWORKS WITH SURVIVABILITY
Yugoslav Journal of Operations Research 15 (2005), Number 1, 65-77 SCATTER SEARCH BASED METAHEURISTIC FOR ROBUST OPTIMIZATION OF THE DEPLOYING OF DWDM TECHNOLOGY ON OPTICAL NETWORKS WITH SURVIVABILITY
More informationHeuristics and Meta-Heuristics for 2-Layer Straight Line Crossing Minimization
Heuristics and Meta-Heuristics for 2-Layer Straight Line Crossing Minimization Rafael Martí 1 and Manuel Laguna 2 November 13, 2001 1 Departamento de Estadística e I.O. Universidad de Valencia. Dr. Moliner
More informationAhmed T. Sadiq. Ali Makki Sagheer* Mohammed Salah Ibrahim
Int. J. Reasoning-based Intelligent Systems, Vol. 4, No. 4, 2012 221 Improved scatter search for 4-colour mapping problem Ahmed T. Sadiq Computer Science Department, University of Technology, Baghdad,
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 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 informationAn evolutionary annealing-simplex algorithm for global optimisation of water resource systems
FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water
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 information6. Tabu Search. 6.3 Minimum k-tree Problem. Fall 2010 Instructor: Dr. Masoud Yaghini
6. Tabu Search 6.3 Minimum k-tree Problem Fall 2010 Instructor: Dr. Masoud Yaghini Outline Definition Initial Solution Neighborhood Structure and Move Mechanism Tabu Structure Illustrative Tabu Structure
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 informationA Hybrid Scatter Search / Electromagnetism Meta-Heuristic for Project Scheduling
A Hybrid Scatter Search / Electromagnetism Meta-Heuristic for Project Scheduling Dieter Debels Bert De Reyck Roel Leus 3 Mario Vanhoucke,4 Faculty of Economics and Business Administration, Ghent University,
More informationMA PM: memetic algorithms with population management
Computers & Operations Research 33 (2006) 1214 1225 www.elsevier.com/locate/cor MA PM: memetic algorithms with population management Kenneth Sörensen a,, Marc Sevaux b a University of Antwerp, Faculty
More informationSequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem
Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem Tabitha James a,, Cesar Rego b, and Fred Glover c a Department of Business Information Technology, Pamplin College
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 informationThe Linear Ordering Problem: Instances, Search Space Analysis and Algorithms
The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms Tommaso Schiavinotto and Thomas Stützle Darmstadt University of Technology, Computer Science Department Alexanderstr. 10, 64283
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 informationSimple meta-heuristics using the simplex algorithm for non-linear programming
Simple meta-heuristics using the simplex algorithm for non-linear programming João Pedro Pedroso Technical Report Series: DCC-2007-6 http://www.dcc.fc.up.pt/pubs/ Departamento de Ciência de Computadores
More informationLecture 06 Tabu Search
Lecture 06 Tabu Search s.l. dr. ing. Ciprian-Bogdan Chirila chirila@cs.upt.ro http://www.cs.upt.ro/~chirila Heuristic Methods Outline Introduction The TS framework Example Notation and problem description
More informationVariable Neighborhood Search for Solving the Balanced Location Problem
TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Variable Neighborhood Search for Solving the Balanced Location Problem Jozef Kratica, Markus Leitner, Ivana Ljubić Forschungsbericht
More informationA Genetic Algorithm with Evolutionary Path-relinking for the SONET Ring Assignment Problem
EngOpt 2008 - International Conference on Engineering Optimization Rio de Janeiro, Brazil, 01-05 June 2008. A Genetic Algorithm with Evolutionary Path-relinking for the SONET Ring Assignment Problem Lucas
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 informationA Diversified Multi-Start Algorithm for Unconstrained Binary Quadratic Problems Leveraging the Graphics Processor Unit
A Diversified Multi-Start Algorithm for Unconstrained Binary Quadratic Problems Leveraging the Graphics Processor Unit Mark Lewis Missouri Western State University, Saint Joseph, Missouri 64507, USA mlewis14@missouriwestern.edu
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 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 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 informationTabu Search Method for Solving the Traveling salesman Problem. University of Mosul Received on: 10/12/2007 Accepted on: 4/3/2008
Raf. J. of Comp. & Math s., Vol. 5, No. 2, 2008 Tabu Search Method for Solving the Traveling salesman Problem Isra Natheer Alkallak Ruqaya Zedan Sha ban College of Nursing College of Medicine University
More informationOutline. CS 6776 Evolutionary Computation. Numerical Optimization. Fitness Function. ,x 2. ) = x 2 1. , x , 5.0 x 1.
Outline CS 6776 Evolutionary Computation January 21, 2014 Problem modeling includes representation design and Fitness Function definition. Fitness function: Unconstrained optimization/modeling Constrained
More information6. Tabu Search 6.1 Basic Concepts. Fall 2010 Instructor: Dr. Masoud Yaghini
6. Tabu Search 6.1 Basic Concepts Fall 2010 Instructor: Dr. Masoud Yaghini Outline Tabu Search: Part 1 Introduction Illustrative Problems Search Space Neighborhood Structure Tabus Aspiration Criteria Termination
More informationA Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Problem
A Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Problem Andrew Lim a, Brian Rodrigues b,feixiao c a Department of Industrial Engineering and Engineering Management, Hong Kong University
More informationOverview of Tabu Search
Overview of Tabu Search The word tabu (or taboo) comes from Tongan, a language of Polynesia, where it was used by the aborigines of Tonga island to indicate things that cannot be touched because they are
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 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 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 informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
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 informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
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 informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationEFFICIENT OPTIMISATION OF STRUCTURES USING TABU SEARCH
EFFICIENT OPTIMISATION OF STRUCTURES USING TABU SEARCH Andy M. Connor, Keith A. Seffen, Geoffrey T. Parks and P. John Clarkson Engineering Design Centre, Department of Engineering University of Cambridge,
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 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 informationTabu Search for a Multi-Objective Routing Problem
Tabu Search for a Multi-Objective Routing Problem JOAQUÍN PACHECO Fac. C Económicas y Empresariales. Universidad de Burgos. Plaza Infanta Elena s/n. Burgos 09001, Spain. RAFAEL MARTÍ * Departament d Estadística
More informationAssigning Judges to Competitions Using Tabu Search Approach
Assigning Judges to Competitions Using Tabu Search Approach Amina Lamghari Jacques A. Ferland Computer science and OR dept. University of Montreal Faculty of Information Technology University of Science
More informationTest Cost Optimization Using Tabu Search
J. Software Engineering & Applications, 2010, 3: 477-486 doi:10.4236/jsea.2010.35054 Published Online May 2010 (http://www.scirp.org/journal/jsea) Anu Sharma*, Arpita Jadhav, Praveen Ranjan Srivastava,
More informationTabu Search with Strategic Oscillation for the Quadratic Minimum Spanning Tree
Tabu Search with Strategic Oscillation for the Quadratic Minimum Spanning Tree Manuel Lozano Department of Computer Science and Artificial Intelligence, University of Granada, Granada 18071, Spain, lozano@decsai.ugr.es
More informationScatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem Juan José Pantrigo 1, Abraham Duarte 1, Ángel Sánchez 1, and Raúl Cabido 1 1 Universidad Rey Juan Carlos, c/ Tulipán s/n
More informationCHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION
131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 12, NO. 4, AUGUST
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 12, NO. 4, AUGUST 2008 439 AbYSS: Adapting Scatter Search to Multiobjective Optimization Antonio J. Nebro, Francisco Luna, Student Member, IEEE, Enrique
More informationGreedy 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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationPreliminary Background Tabu Search Genetic Algorithm
Preliminary Background Tabu Search Genetic Algorithm Faculty of Information Technology University of Science Vietnam National University of Ho Chi Minh City March 2010 Problem used to illustrate General
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 informationThe AID Method for Global Optimization
Algorithmic Operations Research Vol.6 (2011) 0 8 The AID Method for Global Optimization Mahamed G. H. Omran a and Fred Glover b a Gulf University for Science and Technology, Kuwait, Kuwait. b OptTek Systems,
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
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 informationNeighborhood Combination for Unconstrained Binary Quadratic Programming
id-1 Neighborhood Combination for Unconstrained Binary Quadratic Programming Zhipeng Lü Fred Glover Jin-Kao Hao LERIA, Université d Angers 2 boulevard Lavoisier, 49045 Angers, France lu@info.univ-angers.fr
More informationInternational Journal of Combinatorial Optimization Problems and Informatics. E-ISSN:
International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@icopi.org International Journal of Combinatorial Optimization Problems and Informatics México Terán
More informationA Guided Cooperative Search for the Vehicle Routing Problem with Time Windows
ISSI-0076-020-1 A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows Alexandre Le Bouthillier Teodor G. Crainic Peter Kropf Centre de recherche sur les transports, Université de
More informationDetecting promising areas by evolutionary clustering search
Detecting promising areas by evolutionary clustering search Alexandre C. M. Oliveira 1, 2 and Luiz A. N. Lorena 2 1 Universidade Federal do Maranhão - UFMA, Departamento de Informática, S. Luís MA, Brasil.
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 informationA tabu search approach for makespan minimization in a permutation flow shop scheduling problems
A tabu search approach for makespan minimization in a permutation flow shop scheduling problems Sawat Pararach Department of Industrial Engineering, Faculty of Engineering, Thammasat University, Pathumthani
More informationHybrid Optimization Coupling Electromagnetism and Descent Search for Engineering Problems
Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2008 13 17 June 2008. Hybrid Optimization Coupling Electromagnetism and Descent Search
More informationMULTI-OBJECTIVE OPTIMIZATION
MULTI-OBJECTIVE OPTIMIZATION Introduction Many real-world problems require the simultaneous optimization of a number of objective functions. Some of these objectives may be in conflict. Example 1:optimal
More informationIntroduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1
Introduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1 Efficiency of optimization methods Robust method Efficiency Specialized method Enumeration or MC kombinatorial
More informationVariable Neighborhood Scatter Search for the Incremental Graph Drawing Problem
Variable Neighborhood Scatter Search for the Incremental Graph Drawing Problem JESÚS SÁNCHEZ-ORO Departamento de Ciencias de la Computación, Universidad Rey Juan Carlos, Spain. jesus.sanchezoro@urjc.es
More informationImproved Scatter Search Using Cuckoo Search
Improved Scatter Search Using Cuckoo Search Ahmed T. Sadiq Al-Obaidi Computer Science Department University of Technology Baghdad, Iraq Abstract The Scatter Search (SS) is a deterministic strategy that
More informationVariable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems
Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems Hongbo Liu 1,2,AjithAbraham 3,1, Okkyung Choi 3,4, and Seong Hwan Moon 4 1 School of Computer
More informationIncorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms
H. Ishibuchi, T. Doi, and Y. Nojima, Incorporation of scalarizing fitness functions into evolutionary multiobjective optimization algorithms, Lecture Notes in Computer Science 4193: Parallel Problem Solving
More informationGRASP WITH PATH-RELINKING FOR THE QUADRATIC ASSIGNMENT PROBLEM
WITH PATH-RELINKING FOR THE QUADRATIC ASSIGNMENT PROBLEM CARLOS A.S. OLIVEIRA, PANOS M. PARDALOS, AND M.G.C. RESENDE Abstract. This paper describes a with path-relinking heuristic for the quadratic assignment
More informationGenetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows
Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows Joanna Karbowska-Chilinska and Pawel Zabielski Faculty of Computer Science Bialystok University of Technology, Poland
More informationA New Heuristic for the Quadratic Assignment Problem
JOURNAL OF APPLIED MATHEMATICS AND DECISION SCIENCES, 6(3), 143 153 Copyright c 2002, Lawrence Erlbaum Associates, Inc. A New Heuristic for the Quadratic Assignment Problem ZVI DREZNER zdrezner@fullerton.edu
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 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 informationTABU SEARCH HEURISTIC FOR POINT-FEATURE CARTOGRAPHIC LABEL PLACEMENT
c GeoInformatica,, 1 11 () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. TABU SEARCH HEURISTIC FOR POINT-FEATURE CARTOGRAPHIC LABEL PLACEMENT MISSAE YAMAMOTO, GILBERTO CAMARA AND
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 informationA New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling
Australian Journal of Basic and Applied Sciences, 5(12): 1578-1585, 211 ISSN 1991-8178 A New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling 1 Mohammad Fathian,
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 informationDiversification Methods for Zero-One Optimization
Diversification Methods for Zero-One Optimization Fred Glover ECEE- College of Engineering and Applied Science University of Colorado - Boulder Boulder, CO, 80309 USA glover@colorado.edu Abstract We introduce
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 informationSolving the C sum Permutation Flowshop Scheduling Problem by Genetic Local Search
ICEC 98 (1998 IEEE International Conference on Evolutionary Computation) pp.230 234 Solving the C sum Permutation Flowshop Scheduling Problem by Genetic Local Search Takeshi Yamada, NTT Communication Science
More informationMulti-Objective Memetic Algorithm using Pattern Search Filter Methods
Multi-Objective Memetic Algorithm using Pattern Search Filter Methods F. Mendes V. Sousa M.F.P. Costa A. Gaspar-Cunha IPC/I3N - Institute of Polymers and Composites, University of Minho Guimarães, Portugal
More informationAn Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem
An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem Yuning Chen a, Jin-Kao Hao a,b,, Fred Glover c a LERIA, Université d Angers, 2 Bd Lavoisier, 49045 Angers, Cedex 01,
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 informationIn addition to hybrid swarm intelligence algorithms, another way for an swarm intelligence algorithm to have balance between an swarm intelligence
xiv Preface Swarm intelligence algorithms are a collection of population-based stochastic optimization algorithms which are generally categorized under the big umbrella of evolutionary computation algorithms.
More information