Permutation distance measures for memetic algorithms with population management
|
|
- Merilyn Parsons
- 6 years ago
- Views:
Transcription
1 MIC2005: The Sixth Metaheuristics International Conference??-1 Permutation distance measures for memetic algorithms with population management Marc Sevaux Kenneth Sörensen University of Valenciennes, CNRS, UMR 8530, LAMIH-SP Le Mont Houy - Bat Jonas 2, F Valenciennes cedex 9, France marc.sevaux@univ-valenciennes.fr University of Antwerp, Faculty of Applied Economics Prinsstraat 13, B 2000 Antwerp, Belgium kenneth.sorensen@ua.ac.be 1 Introduction Most researchers agree that the balance between diversification and intensification strategies is one of the determining factors of the quality of a metaheuristic [3]. One possible way of controlling this balance is to apply population management, such as in the memetic algorithm with population management approach (MA PM) [9]. The basic idea of MA PM is to only allow a new solution into the population if it sufficiently contributes to the diversity of the population. Population management strategies can be developed to actively monitor and control this diversity. MA PM requires a distance measure adapted to the representation of a solution of the problem that is being solved. This distance measure should reflect the difference between a given pair of solutions. Although difficult to prove, it seems natural to conjecture that a distance measure that more accurately reflects the distance between two solutions is preferable to one that does not. For problems of which the solutions are most naturally represented as a binary string, the Hamming distance seems to be the only distance measure to use. For problems represented as real-valued vectors, Euclidean, Manhattan, or Chebychev distance metrics can be used. The Mahalanobis distance is scale-invariant and takes the dispersion of the solutions into account. For permutation problems, a myriad of distance measures has been developed, originating in different domains (statistics, computer science, molecular biology,... ). In this paper, we look at nine of them: the exact match distance, the deviation distance (Spearman s footrule), the squared deviation distance (Spearman s rank correlation coefficient), the A distance, the R distance, the edit distance, the longest common subsequence, the reversal distance and Kendall s tau. We determine the effort required to calculate them and develop a normalized version of each distance measure, that produces a value between 0 and 1. Some of the distance
2 ??-2 MIC2005: The Sixth Metaheuristics International Conference measures can be calculated in approximately linear time, whereas others require approximately quadratic time.we then study experimentally which distance measure works best in a simple MA PM for a single-machine scheduling problem. 2 Assumptions and notation In the following section, we discuss several distance measures that are able to calculate a distance between two given strings of integers. We assume that both strings are permutations without repetition of a given set of integers. As a consequence, both strings are assumed to be of equal length. This underuses the potential of some distance measures. The edit distance, e.g., can calculate the distance between any two strings composed of characters of a given alphabet. Without loss of generality, we assume that both strings are permutations of the set {1,..., n}. The i-th character in a permutation P is represented as P (i). 3 Distance metrics 3.1 The exact match distance The exact match distance [7], also called generalized Hamming distance is defined as the number of times the characters in the same positions in both strings are different. { n 0 if S(i) = T (i) d em (S, T ) = x i where x i = 1 otherwise i=1 A normalized version of the exact match distance can be obtained by dividing the unnormalized version by the maximum exact match distance. The exact match distance is maximal if both strings are different in each of the n positions and is therefore equal to n. The normalized exact match distance is thus ˆd em (S, T ) = 1 n d em. 3.2 The deviation distance The deviation of item k between strings S and T is the absolute difference between the position of the item in string S and its position in T, The deviation distance is the sum of the deviations of all characters 1. n d dev (S, T ) = i j where T (j) = S(i) = k k=1 Ronald [7] proves that the maximum deviation distance occurs between two inverted strings. E.g. the distance between S = [1, 2, 3, 4, 5] and T = [5, 4, 3, 2, 1] is maximal. The value of the maximal distance can be calculated as a function of n. When n is even, the maximal distance is equal to n2 2. When n is odd, it is equal to n Unlike [7], we do not divide by n 1.
3 MIC2005: The Sixth Metaheuristics International Conference??-3 The normalized deviation distance is therefore defined as: 2 ˆd dev (S, T ) = n 2 d dev(s, T ) if n is even 2 n 2 1 d dev(s, T ) if n is odd In statistics, this measure is known as Spearman s footrule. 3.3 The squared deviation distance The squared deviation distance assigns a larger distance when deviations are larger. defined as follows n d sdev (S, T ) = (i j) 2 where T (j) = S(i)k k=1 It is It is easy to show that the maximum squared deviation distance is equal to n3 n 3 ˆd sdev (S, T ) = 3 n 3 n d sdev(s, T ) This distance measure is similar to Spearman s rank correlation coefficient, a metric often used in statistics to calculate the correlation between two rankings. Usually, it is normalized between 1 (strong negative correlation) and 1 (strong positive correlation) [8]. 3.4 The A distance Campos et al. [1] propose the A distance measure, equal to the sum of all absolute differences between the positions of all items in strings S and T. d A (S, T ) = n S(i) T (i). i=1 This distance measure has the (undesirable) property of being dependent on the labeling of the items. Consider e.g. the following: the distance between [1, 2, 3, 4] and [1, 3, 2, 4] is 2 the distance between [2, 1, 4, 3] and [2, 4, 1, 3] is The R distance For so-called R-type permutation problems, i.e. problems for which the relative position of the elements is more important, Campos et al. [1] propose the R distance measure. This distance
4 ??-4 MIC2005: The Sixth Metaheuristics International Conference measure is equal to the number of times S(i 1) does not immediately follow S(i) in T. More formally, { n 1 1 if j : S(i) = T (j) and S(i 1) = T (j 1) d R (S, T ) = y i where y i = 0 otherwise i=1 The maximal value of this distance measure is n 1. Therefore ˆd R (S, T ) = 1 n 1 d R(S, T ) 3.6 The edit distance The most complex of the distances used in this paper is the edit distance. In contrast to the other distance measures, the edit distance can be extensively parametrized. The edit distance between strings S and T is defined as the total cost of elementary edit operations required to transform S into T. Three different elementary edit operations are defined: (1) insertion, (2) deletion and (3) substitution. Each edit operation can be assigned a different cost. If all costs are equal to 1, the edit distance is equal to the minimum number of edit operations required to transform S into T. Example. Assuming all edit operations to have a cost of 1, the edit distance between S = [5, 2, 6, 4, 3, 1, 8, 7] and T = [6, 5, 3, 2, 1, 4, 8, 7] is d edit (S, T ) = 5 (1) To transform S into T in 5 edit operations, remove 3 and 1 from S, change 6 into 1 and then add 6 and 3 in the appropriate locations. 3.7 The longest common subsequence distance A subsequence of a string is an subset of characters that appear in the same order in the string. Example. [3, 5, 7] is a subsequence of [1, 2, 3, 4, 5, 6, 7] The length of the longest subsequence that is shared by two strings is a measure of the similarity between these two strings. The maximum length of the longest common subsequence is equal to n. The minimum length is one. We define the longest common subsequence distance as n minus the length of the longest common subsequence. The longest common subsequence distance lies between 0 and n 1. The longest common subsequence can be calculated in O(n 2 ) by a simple dynamic programming algorithm [4]. The normalized longest common subsequence distance can be calculated by dividing by n 1. ˆd lcs = d lcs n 1 A similar distance metric could be defined by using the longest common substring (in which all characters need to be adjacent).
5 MIC2005: The Sixth Metaheuristics International Conference?? The reversal distance The reversal distance is defined as the minimum number of reversals required to transform a permutation into another one. A reversal is defined as the operation of reversing a substring of the given string. E.g Calculation of the reversal distance is very important in molecular biology, but has been shown to be NP -hard [2]. Because of this, we exclude it from further research, although it has some obvious merits, the most important one being the fact that the well-known 2-opt move is nothing else than a substring reversal. 3.9 Kendall s tau The value of this distance metric [5] is given by { n n 1 if S(i) < S(j) and T (i) > T (j) d τ (S, T ) = z ij where z ij = 0 otherwise i=1 j=1 It can be shown that this value is equal to the number of pairwise adjacent permutations required to transform S into T. A normalized version of this distance metric is given by ˆd τ (S, T ) = 2 d τ (S, T ) n 2 n 4 Preliminary experiment 4.1 The total weighted tardiness single machine scheduling problem A set of n jobs has to be sequenced on a single machine. Preemption is not allowed. Jobs are not available before a release date r j and are processed for p j units of time. For each job, a due date d j and a weight w j is given. If C j denotes the completion time of job j, the tardiness is defined by T j = max(0, C j d j ). The objective is to minimize the total weighted tardiness (1 r j w j T j ). This problem is N P-Hard in a strong sense. In [9], we develop an MA PM for this problem and show that it outperforms a similar memetic algorithm without population management. 4.2 An MA PM for the total weighted tardiness problem The basic idea of MA PM is to not allow any new solutions into the population unless they sufficiently contribute to the diversity. This contribution is measured as the minimal distance of the candidate solution to the population, i.e. to any solution in the population: d P (x c ) = d(x c, x i ) x i P. A candidate solution is allowed into the population if it satisfies the diversity criterion, i.e. if its distance to the population is greater than or equal to the diversity parameter. The value of can be used in a population management strategy to control the diversity of the population. A large value of will increase the diversity, a small value will decrease it.
6 ??-6 MIC2005: The Sixth Metaheuristics International Conference Table 1: Summary of distance metrics Complexity Avg. it. Exact match O(n) A O(n) R O(n) Deviation O(n 2 ) Squared deviation O(n 2 ) Edit O(n 2 ) Longest common subsequence O(n 2 ) Kendall s tau O(n 2 ) Solutions are selected from the population using biased random selection [6]. After crossover using a linear ordered crossover (LOX) operator, they are subjected to local search using adjacent pairwise interchange (API) steepest descent. Solutions that do not satisfy the diversity criterion are mutated using a general pairwise interchange (GPI) mutation operator until their distance to the population is greater than. A new solution replaces a solution randomly chosen from the worst half of the population. The MA PM uses a simple sawtooth population management strategy, alternating periods of intensification with periods of diversification. Initially, is equal to 0.1. Each 3 generations, is multiplied by When it reaches the maximal value of 0.5, it is reset to its initial value of Results The MA PM with the eight different distance measures was tested on twenty 100-job instances of the OR library. For each distance measure, the MA PM was given a maximum time of 5 minutes to find a good solution. Table 1 shows each of the eight distance metrics used and their approximate complexity. We have divided the distance metrics in two classes: those that can be calculated in (approximately) linear time and those that require (approximately) quadratic time. The final column shows the average number of iterations performed by the MA PM in the given 5 minutes. Figure 1 shows a summary of the results for the different distance measures. For each problem set, we record the objective function value f(x ) of the best solution found using any distance measure. We then calculate how much worse the other distance measures perform by calculating for each distance measure the value of f(x i) f(x ) f(x ), where x i is the best solution found using distance measure i. Although the results are very preliminary, they seem to show that the linear distance measures outperform the quadratic distance measures. This can be explained by the fact that the local search operator is very fast, but not very powerful. As a result, population management using the quadratic distance measures takes up a relatively large portion of the time. The number of iterations performed when using the linear distance measures is therefore dramatically higher than when using the quadratic distance measures. This increased number of iterations cannot be compensated by any potential gain achieved by using a more accurate distance measure. This raises the interesting questions whether these results can be generalized, or whether an MA PM that uses a more intensive local search requires a better
7 å QP {z ÏÎ '& ON yx %$ ÍÌ ä æ )( ÑÐ SR ML ËÊ wv ã #" KJ ut ŸžÉÈ â! IH ÇÆ ásr GF kj ¾ Ý šåä à qp ED ih½¼ onãâ ß CB =< cb WV ;: Ö ˆ Š ed Ú ]\ YX /. -, * UT ÁÀ ml Þ Õ [Z Ü _^ ³²»º Û gf a` µ Ò~ } œ Ž ¹ Ù Œ Ø ± Ô ƒ Ó «ª MIC2005: The Sixth Metaheuristics International Conference??-7 Fraction over best-found Edit distance A distance R distance Exact match distance Deviation distance Squared deviation distance Longest common subsequence Kendall s tau Data file Figure 1: Comparison of the MA PM with different distance measures distance measure. Another issue we have not touched upon in this paper is the interplay between the distance measure used and the population management strategy. References [1] V. Campos, M. Laguna, and R. Martí. Context-independent scatter search and tabu search for permutation problems. INFORMS Journal on Computing, 17: , [2] A. Caprara. Sorting permutations by reversals and eulerian cycle decompositions. SIAM Journal on Discrete Mathematics, 12(1):91 110, [3] A. Hertz and M. Widmer. Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research, 151(2): , [4] D. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18: , [5] M. Kendall and J. Dickinson Gibbons. Rank Correlation Methods. Oxford University Press, New York, [6] C.R. Reeves. A genetic algorithm for flowshop sequencing. Computers and Operations Research, 22:5 13, [7] S. Ronald. More distance functions for order-based encodings. In Proceedings of the IEEE Conference on Evolutionary Computation, pages , IEEE Press, New York, 1998.
8 ??-8 MIC2005: The Sixth Metaheuristics International Conference [8] S. Siegel and N. J. Castellan. Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, [9] K. Sörensen and M. Sevaux. MA PM: memetic algorithms with population management. Computers and Operations Research, To appear, 2004.
Permutation distance measures for memetic algorithms with population management
for memetic algorithms with population management for M PM M PM Marc Sevaux 1 2 1 University of Valenciennes, CNS, UM 8530, LMIH-SP Le Mont Houy - Bat Jonas 2, F 59313 Valenciennes cedex 9, France marc.sevaux@univ-valenciennes.fr
More informationA pruning pattern list approach to the permutation flowshop scheduling problem
A pruning pattern list approach to the permutation flowshop scheduling problem Takeshi Yamada NTT Communication Science Laboratories, 2-4 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02, JAPAN E-mail :
More informationLagrangean relaxation for minimizing the weighted number of late jobs on parallel machines p.1/18. PMS 2002 Valencia, Spain
Lagrangean reaxation for iniizing the weighted nuber of ate obs on parae achines PMS 00 Vaencia Spain Stéphane DauzèrePérès and Marc Sevaux dauze@en.fr sevaux@univvaenciennes.fr Ecoe des Mines de Nantes
More informationComputational statistics
Computational statistics Combinatorial optimization Thierry Denœux February 2017 Thierry Denœux Computational statistics February 2017 1 / 37 Combinatorial optimization Assume we seek the maximum of f
More informationSurfaces of Section I
Surfaces of Section I Consider a system with n = 2 degrees of freedom (e.g., planar motion), and with a Hamiltonian H( x, p) = 1 2 (p2 x + p2 y ) + Φ(x, y) Conservation of energy, E = H, restricts the
More informationA parallel metaheuristics for the single machine total weighted tardiness problem with sequence-dependent setup times
A parallel metaheuristics for the single machine total weighted tardiness problem with sequence-dependent setup times Wojciech Bożejko Wroc law University of Technology Institute of Computer Engineering,
More informationFramework for functional tree simulation applied to 'golden delicious' apple trees
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Spring 2015 Framework for functional tree simulation applied to 'golden delicious' apple trees Marek Fiser Purdue University
More informationMetaheuristics and Local Search
Metaheuristics and Local Search 8000 Discrete optimization problems Variables x 1,..., x n. Variable domains D 1,..., D n, with D j Z. Constraints C 1,..., C m, with C i D 1 D n. Objective function f :
More informationOptimal Control of PDEs
Optimal Control of PDEs Suzanne Lenhart University of Tennessee, Knoville Department of Mathematics Lecture1 p.1/36 Outline 1. Idea of diffusion PDE 2. Motivating Eample 3. Big picture of optimal control
More informationLA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce
> ƒ? @ Z [ \ _ ' µ `. l 1 2 3 z Æ Ñ 6 = Ð l sl (~131 1606) rn % & +, l r s s, r 7 nr ss r r s s s, r s, r! " # $ s s ( ) r * s, / 0 s, r 4 r r 9;: < 10 r mnz, rz, r ns, 1 s ; j;k ns, q r s { } ~ l r mnz,
More informationMetaheuristics and Local Search. Discrete optimization problems. Solution approaches
Discrete Mathematics for Bioinformatics WS 07/08, G. W. Klau, 31. Januar 2008, 11:55 1 Metaheuristics and Local Search Discrete optimization problems Variables x 1,...,x n. Variable domains D 1,...,D n,
More informationDistance Metrics and Fitness Distance Analysis for the Capacitated Vehicle Routing Problem
MIC2005. The 6th Metaheuristics International Conference 603 Metrics and Analysis for the Capacitated Vehicle Routing Problem Marek Kubiak Institute of Computing Science, Poznan University of Technology
More informationRedoing the Foundations of Decision Theory
Redoing the Foundations of Decision Theory Joe Halpern Cornell University Joint work with Larry Blume and David Easley Economics Cornell Redoing the Foundations of Decision Theory p. 1/21 Decision Making:
More informationLecture 4 Scheduling 1
Lecture 4 Scheduling 1 Single machine models: Number of Tardy Jobs -1- Problem 1 U j : Structure of an optimal schedule: set S 1 of jobs meeting their due dates set S 2 of jobs being late jobs of S 1 are
More informationLecture H2. Heuristic Methods: Iterated Local Search, Simulated Annealing and Tabu Search. Saeed Bastani
Simulation Lecture H2 Heuristic Methods: Iterated Local Search, Simulated Annealing and Tabu Search Saeed Bastani saeed.bastani@eit.lth.se Spring 2017 Thanks to Prof. Arne Løkketangen at Molde University
More informationQUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS
International Workshop Quarkonium Working Group QUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS ALBERTO POLLERI TU München and ECT* Trento CERN - November 2002 Outline What do we know for sure?
More informationUnsupervised machine learning
Chapter 9 Unsupervised machine learning Unsupervised machine learning (a.k.a. cluster analysis) is a set of methods to assign objects into clusters under a predefined distance measure when class labels
More informationMinimizing the weighted completion time on a single machine with periodic maintenance
Minimizing the weighted completion time on a single machine with periodic maintenance KRIM Hanane University of Valenciennes and Hainaut-Cambrésis LAMIH UMR CNRS 8201 1st year Phd Student February 12,
More informationCSC 4510 Machine Learning
10: Gene(c Algorithms CSC 4510 Machine Learning Dr. Mary Angela Papalaskari Department of CompuBng Sciences Villanova University Course website: www.csc.villanova.edu/~map/4510/ Slides of this presenta(on
More informationLecture 9 Evolutionary Computation: Genetic algorithms
Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic
More informationCompression in the Space of Permutations
Compression in the Space of Permutations Da Wang Arya Mazumdar Gregory Wornell EECS Dept. ECE Dept. Massachusetts Inst. of Technology Cambridge, MA 02139, USA {dawang,gww}@mit.edu University of Minnesota
More informationUnit 1A: Computational Complexity
Unit 1A: Computational Complexity Course contents: Computational complexity NP-completeness Algorithmic Paradigms Readings Chapters 3, 4, and 5 Unit 1A 1 O: Upper Bounding Function Def: f(n)= O(g(n)) if
More informationA tabu search based memetic algorithm for the maximum diversity problem
A tabu search based memetic algorithm for the maximum diversity problem Yang Wang a,b, Jin-Kao Hao b,, Fred Glover c, Zhipeng Lü d a School of Management, Northwestern Polytechnical University, 127 Youyi
More informationhal , version 1-27 Mar 2014
Author manuscript, published in "2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), New York, NY. : United States (2005)" 2 More formally, we denote by
More information! " # $! % & '! , ) ( + - (. ) ( ) * + / 0 1 2 3 0 / 4 5 / 6 0 ; 8 7 < = 7 > 8 7 8 9 : Œ Š ž P P h ˆ Š ˆ Œ ˆ Š ˆ Ž Ž Ý Ü Ý Ü Ý Ž Ý ê ç è ± ¹ ¼ ¹ ä ± ¹ w ç ¹ è ¼ è Œ ¹ ± ¹ è ¹ è ä ç w ¹ ã ¼ ¹ ä ¹ ¼ ¹ ±
More informationAn artificial chemical reaction optimization algorithm for. multiple-choice; knapsack problem.
An artificial chemical reaction optimization algorithm for multiple-choice knapsack problem Tung Khac Truong 1,2, Kenli Li 1, Yuming Xu 1, Aijia Ouyang 1, and Xiaoyong Tang 1 1 College of Information Science
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationImplicit Formae in Genetic Algorithms
Implicit Formae in Genetic Algorithms Márk Jelasity ½ and József Dombi ¾ ¾ ½ Student of József Attila University, Szeged, Hungary jelasity@inf.u-szeged.hu Department of Applied Informatics, József Attila
More informationCombinatorial optimization problems
Combinatorial optimization problems Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Optimization In general an optimization problem can be formulated as:
More informationManifold Regularization
Manifold Regularization Vikas Sindhwani Department of Computer Science University of Chicago Joint Work with Mikhail Belkin and Partha Niyogi TTI-C Talk September 14, 24 p.1 The Problem of Learning is
More informationConstructing c-ary Perfect Factors
Constructing c-ary Perfect Factors Chris J. Mitchell Computer Science Department Royal Holloway University of London Egham Hill Egham Surrey TW20 0EX England. Tel.: +44 784 443423 Fax: +44 784 443420 Email:
More informationGeneralization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms Tadahiko Murata 1, Shiori Kaige 2, and Hisao Ishibuchi 2 1 Department of Informatics, Kansai University 2-1-1 Ryozenji-cho,
More information" #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y
" #$ +. 0. + 4 6 4 : + 4 ; 6 4 < = =@ = = =@ = =@ " #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y h
More informationEnumeration and symmetry of edit metric spaces. Jessie Katherine Campbell. A dissertation submitted to the graduate faculty
Enumeration and symmetry of edit metric spaces by Jessie Katherine Campbell A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY
More informationChapter 8: Introduction to Evolutionary Computation
Computational Intelligence: Second Edition Contents Some Theories about Evolution Evolution is an optimization process: the aim is to improve the ability of an organism to survive in dynamically changing
More informationQuadratic Multiple Knapsack Problem with Setups and a Solution Approach
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Quadratic Multiple Knapsack Problem with Setups and a Solution Approach
More informationAn Ant Colony Optimisation Algorithm for the Set Packing Problem
An Ant Colony Optimisation Algorithm for the Set Packing Problem Xavier GANDIBLEUX 1,2, Xavier DELORME 2 and Vincent T KINDT 3 (1) LINA - Laboratoire d Informatique de Nantes Atlantique Universite de Nantes
More informationSingle Solution-based Metaheuristics
Parallel Cooperative Optimization Research Group Single Solution-based Metaheuristics E-G. Talbi Laboratoire d Informatique Fondamentale de Lille Single solution-based metaheuristics Improvement of a solution.
More informationLocal Search & Optimization
Local Search & Optimization CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2017 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 4 Outline
More informationThe Pickup and Delivery Problem: a Many-objective Analysis
The Pickup and Delivery Problem: a Many-objective Analysis Abel García-Nájera and Antonio López-Jaimes Universidad Autónoma Metropolitana, Unidad Cuajimalpa, Departamento de Matemáticas Aplicadas y Sistemas,
More informationAn Effective Chromosome Representation for Evolving Flexible Job Shop Schedules
An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules Joc Cing Tay and Djoko Wibowo Intelligent Systems Lab Nanyang Technological University asjctay@ntuedusg Abstract As the Flexible
More informationGenetic Algorithms: Basic Principles and Applications
Genetic Algorithms: Basic Principles and Applications C. A. MURTHY MACHINE INTELLIGENCE UNIT INDIAN STATISTICAL INSTITUTE 203, B.T.ROAD KOLKATA-700108 e-mail: murthy@isical.ac.in Genetic algorithms (GAs)
More informationA new ILS algorithm for parallel machine scheduling problems
J Intell Manuf (2006) 17:609 619 DOI 10.1007/s10845-006-0032-2 A new ILS algorithm for parallel machine scheduling problems Lixin Tang Jiaxiang Luo Received: April 2005 / Accepted: January 2006 Springer
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More information$%! & (, -3 / 0 4, 5 6/ 6 +7, 6 8 9/ 5 :/ 5 A BDC EF G H I EJ KL N G H I. ] ^ _ ` _ ^ a b=c o e f p a q i h f i a j k e i l _ ^ m=c n ^
! #" $%! & ' ( ) ) (, -. / ( 0 1#2 ' ( ) ) (, -3 / 0 4, 5 6/ 6 7, 6 8 9/ 5 :/ 5 ;=? @ A BDC EF G H I EJ KL M @C N G H I OPQ ;=R F L EI E G H A S T U S V@C N G H IDW G Q G XYU Z A [ H R C \ G ] ^ _ `
More informationFront-end. Organization of a Modern Compiler. Middle1. Middle2. Back-end. converted to control flow) Representation
register allocation instruction selection Code Low-level intermediate Representation Back-end Assembly array references converted into low level operations, loops converted to control flow Middle2 Low-level
More informationACO Comprehensive Exam October 18 and 19, Analysis of Algorithms
Consider the following two graph problems: 1. Analysis of Algorithms Graph coloring: Given a graph G = (V,E) and an integer c 0, a c-coloring is a function f : V {1,,...,c} such that f(u) f(v) for all
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationReview of Vectors and Matrices
A P P E N D I X D Review of Vectors and Matrices D. VECTORS D.. Definition of a Vector Let p, p, Á, p n be any n real numbers and P an ordered set of these real numbers that is, P = p, p, Á, p n Then P
More informationSensitive Ant Model for Combinatorial Optimization
Sensitive Ant Model for Combinatorial Optimization CAMELIA CHIRA cchira@cs.ubbcluj.ro D. DUMITRESCU ddumitr@cs.ubbcluj.ro CAMELIA-MIHAELA PINTEA cmpintea@cs.ubbcluj.ro Abstract: A combinatorial optimization
More informationA two-phase path-relinking algorithm for the Generalized Assignment Problem
A two-phase path-relinking algorithm for the Generalized Assignment Problem Laurent Alfandari, Agnès Plateau, Pierre Tolla June 2002 Abstract We propose a two-phase Path-Relinking (PR) heuristic for the
More informationComplexity of local search for the p-median problem
Complexity of local search for the p-median problem Ekaterina Alekseeva, Yuri Kochetov, Alexander Plyasunov Sobolev Institute of Mathematics, Novosibirsk {ekaterina2, jkochet, apljas}@math.nsc.ru Abstract
More informationX-MA2C01-1: Partial Worked Solutions
X-MAC01-1: Partial Worked Solutions David R. Wilkins May 013 1. (a) Let A, B and C be sets. Prove that (A \ (B C)) (B \ C) = (A B) \ C. [Venn Diagrams, by themselves without an accompanying logical argument,
More informationMaximal Unbordered Factors of Random Strings arxiv: v1 [cs.ds] 14 Apr 2017
Maximal Unbordered Factors of Random Strings arxiv:1704.04472v1 [cs.ds] 14 Apr 2017 Patrick Hagge Cording 1 and Mathias Bæk Tejs Knudsen 2 1 DTU Compute, Technical University of Denmark, phaco@dtu.dk 2
More informationA MIXED INTEGER QUADRATIC PROGRAMMING MODEL FOR THE LOW AUTOCORRELATION BINARY SEQUENCE PROBLEM. Jozef Kratica
Serdica J. Computing 6 (2012), 385 400 A MIXED INTEGER QUADRATIC PROGRAMMING MODEL FOR THE LOW AUTOCORRELATION BINARY SEQUENCE PROBLEM Jozef Kratica Abstract. In this paper the low autocorrelation binary
More informationAn Introduction to Optimal Control Applied to Disease Models
An Introduction to Optimal Control Applied to Disease Models Suzanne Lenhart University of Tennessee, Knoxville Departments of Mathematics Lecture1 p.1/37 Example Number of cancer cells at time (exponential
More informationScaling Up. So far, we have considered methods that systematically explore the full search space, possibly using principled pruning (A* etc.).
Local Search Scaling Up So far, we have considered methods that systematically explore the full search space, possibly using principled pruning (A* etc.). The current best such algorithms (RBFS / SMA*)
More informationMeta heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date
DOI 10.1186/s40064-015-1559-5 RESEARCH Open Access Meta heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date Zhenzhen Xu, Yongxing
More informationMaximum sum contiguous subsequence Longest common subsequence Matrix chain multiplication All pair shortest path Kna. Dynamic Programming
Dynamic Programming Arijit Bishnu arijit@isical.ac.in Indian Statistical Institute, India. August 31, 2015 Outline 1 Maximum sum contiguous subsequence 2 Longest common subsequence 3 Matrix chain multiplication
More informationRestarting a Genetic Algorithm for Set Cover Problem Using Schnabel Census
Restarting a Genetic Algorithm for Set Cover Problem Using Schnabel Census Anton V. Eremeev 1,2 1 Dostoevsky Omsk State University, Omsk, Russia 2 The Institute of Scientific Information for Social Sciences
More informationUnit 3. Digital encoding
Unit 3. Digital encoding Digital Electronic Circuits (Circuitos Electrónicos Digitales) E.T.S.I. Informática Universidad de Sevilla 9/2012 Jorge Juan 2010, 2011, 2012 You are free to
More informationThe Intractability of Computing the Hamming Distance
The Intractability of Computing the Hamming Distance Bodo Manthey and Rüdiger Reischuk Universität zu Lübeck, Institut für Theoretische Informatik Wallstraße 40, 23560 Lübeck, Germany manthey/reischuk@tcs.uni-luebeck.de
More informationVariable Objective Search
Variable Objective Search Sergiy Butenko, Oleksandra Yezerska, and Balabhaskar Balasundaram Abstract This paper introduces the variable objective search framework for combinatorial optimization. The method
More informationA reactive framework for Ant Colony Optimization
A reactive framework for Ant Colony Optimization Madjid Khichane 1,2, Patrick Albert 1, and Christine Solnon 2 1 ILOG SA, 9 rue de Verdun, 94253 Gentilly cedex, France {mkhichane,palbert}@ilog.fr 2 LIRIS
More informationA Simple Linear Space Algorithm for Computing a Longest Common Increasing Subsequence
A Simple Linear Space Algorithm for Computing a Longest Common Increasing Subsequence Danlin Cai, Daxin Zhu, Lei Wang, and Xiaodong Wang Abstract This paper presents a linear space algorithm for finding
More informationLinkage Identification Based on Epistasis Measures to Realize Efficient Genetic Algorithms
Linkage Identification Based on Epistasis Measures to Realize Efficient Genetic Algorithms Masaharu Munetomo Center for Information and Multimedia Studies, Hokkaido University, North 11, West 5, Sapporo
More informationA General Procedure to Design Good Codes at a Target BER
A General Procedure to Design Good odes at a Target BER Speaker: Xiao Ma 1 maxiao@mail.sysu.edu.cn Joint work with: hulong Liang 1, Qiutao Zhuang 1, and Baoming Bai 2 1 Dept. Electronics and omm. Eng.,
More informationScheduling Parallel Jobs with Linear Speedup
Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl
More informationIntroduction to integer programming III:
Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability
More informationx 2 i 10 cos(2πx i ). i=1
CHAPTER 2 Optimization Written Exercises 2.1 Consider the problem min, where = 4 + 4 x 2 i 1 cos(2πx i ). i=1 Note that is the Rastrigin function see Section C.1.11. a) What are the independent variables
More informationDynamic Programming. Shuang Zhao. Microsoft Research Asia September 5, Dynamic Programming. Shuang Zhao. Outline. Introduction.
Microsoft Research Asia September 5, 2005 1 2 3 4 Section I What is? Definition is a technique for efficiently recurrence computing by storing partial results. In this slides, I will NOT use too many formal
More informationfrom notes written mostly by Dr. Matt Stallmann: All Rights Reserved
CSC 505, Fall 000: Week 0 Objectives: understand problem complexity and classes defined by it understand relationships among decision, witness, evaluation, and optimization problems understand what it
More informationConstructive Decision Theory
Constructive Decision Theory Joe Halpern Cornell University Joint work with Larry Blume and David Easley Economics Cornell Constructive Decision Theory p. 1/2 Savage s Approach Savage s approach to decision
More informationAnt Colony Optimization for Resource-Constrained Project Scheduling
Ant Colony Optimization for Resource-Constrained Project Scheduling Daniel Merkle, Martin Middendorf 2, Hartmut Schmeck 3 Institute for Applied Computer Science and Formal Description Methods University
More informationMore Approximation Algorithms
CS 473: Algorithms, Spring 2018 More Approximation Algorithms Lecture 25 April 26, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 28 Formal definition of approximation
More informationTotally unimodular matrices. Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems
Totally unimodular matrices Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems Martin Branda Charles University in Prague Faculty of Mathematics and
More informationHeuristics for The Whitehead Minimization Problem
Heuristics for The Whitehead Minimization Problem R.M. Haralick, A.D. Miasnikov and A.G. Myasnikov November 11, 2004 Abstract In this paper we discuss several heuristic strategies which allow one to solve
More informationMulti-objective Quadratic Assignment Problem instances generator with a known optimum solution
Multi-objective Quadratic Assignment Problem instances generator with a known optimum solution Mădălina M. Drugan Artificial Intelligence lab, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussels,
More information! Break up problem into several parts. ! Solve each part recursively. ! Combine solutions to sub-problems into overall solution.
Divide-and-Conquer Chapter 5 Divide and Conquer Divide-and-conquer.! Break up problem into several parts.! Solve each part recursively.! Combine solutions to sub-problems into overall solution. Most common
More informationCopyright 2000, Kevin Wayne 1
Divide-and-Conquer Chapter 5 Divide and Conquer Divide-and-conquer. Break up problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution. Most common
More informationAn Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling Problems
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 An Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling
More information(0)
Citation A.Divsalar, P. Vansteenwegen, K. Sörensen, D. Cattrysse (04), A memetic algorithm for the Orienteering problem with hotel selection European Journal of Operational Research, 37, 9-49. Archived
More informationPrincipal Secretary to Government Haryana, Town & Country Planning Department, Haryana, Chandigarh.
1 From To Principal Secretary to Government Haryana, Town & Country Planning Department, Haryana, Chandigarh. The Director General, Town & Country Planning Department, Haryana, Chandigarh. Memo No. Misc-2339
More informationPROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE
Artificial Intelligence, Computational Logic PROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE Lecture 4 Metaheuristic Algorithms Sarah Gaggl Dresden, 5th May 2017 Agenda 1 Introduction 2 Constraint
More informationSingle machine scheduling with forbidden start times
4OR manuscript No. (will be inserted by the editor) Single machine scheduling with forbidden start times Jean-Charles Billaut 1 and Francis Sourd 2 1 Laboratoire d Informatique Université François-Rabelais
More informationGeometric Semantic Genetic Programming (GSGP): theory-laden design of semantic mutation operators
Geometric Semantic Genetic Programming (GSGP): theory-laden design of semantic mutation operators Andrea Mambrini 1 University of Birmingham, Birmingham UK 6th June 2013 1 / 33 Andrea Mambrini GSGP: theory-laden
More informationApplications of Light-Front Dynamics in Hadron Physics
Applications of Light-Front Dynamics in Hadron Physics Chueng-Ryong Ji North Carolina State University 1. What is light-front dynamics (LFD)? 2. Why is LFD useful in hadron physics? 3. Any first principle
More informationGenetic Algorithms and Genetic Programming Lecture 17
Genetic Algorithms and Genetic Programming Lecture 17 Gillian Hayes 28th November 2006 Selection Revisited 1 Selection and Selection Pressure The Killer Instinct Memetic Algorithms Selection and Schemas
More informationString averages and self-organizing maps for strings
String averages and selforganizing maps for strings Igor Fischer, Andreas Zell Universität Tübingen WilhelmSchickardInstitut für Informatik Köstlinstr. 6, 72074 Tübingen, Germany fischer, zell @informatik.unituebingen.de
More informationCSE 421 Weighted Interval Scheduling, Knapsack, RNA Secondary Structure
CSE Weighted Interval Scheduling, Knapsack, RNA Secondary Structure Shayan Oveis haran Weighted Interval Scheduling Interval Scheduling Job j starts at s(j) and finishes at f j and has weight w j Two jobs
More informationLocal Search & Optimization
Local Search & Optimization CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 4 Some
More informationInverting the Burrows-Wheeler Transform
FUNCTIONAL PEARL Inverting the Burrows-Wheeler Transform Richard Bird and Shin-Cheng Mu 1 Programming Research Group, Oxford University Wolfson Building, Parks Road, Oxford, OX1 3QD, UK Abstract The objective
More informationUsing Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis
Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis Juan Aparicio 1 Domingo Giménez 2 Martín González 1 José J. López-Espín 1 Jesús T. Pastor 1 1 Miguel Hernández
More informationPermutation-based Optimization Problems and Estimation of Distribution Algorithms
Permutation-based Optimization Problems and Estimation of Distribution Algorithms Josu Ceberio Supervisors: Jose A. Lozano, Alexander Mendiburu 1 Estimation of Distribution Algorithms Estimation of Distribution
More informationA Bound for Non-Subgraph Isomorphism
A Bound for Non-Sub Isomorphism Christian Schellewald School of Computing, Dublin City University, Dublin 9, Ireland Christian.Schellewald@computing.dcu.ie, http://www.computing.dcu.ie/ cschellewald/ Abstract.
More informationCSE 202 Dynamic Programming II
CSE 202 Dynamic Programming II Chapter 6 Dynamic Programming Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 Algorithmic Paradigms Greed. Build up a solution incrementally,
More informationPolynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents
Journal of the Operational Research Society (2014) 65, 151 157 2014 Operational Research Society Ltd All rights reserved 0160-5682/14 wwwpalgrave-journalscom/jors/ Polynomial time solutions for scheduling
More informationGeneral Neoclassical Closure Theory: Diagonalizing the Drift Kinetic Operator
General Neoclassical Closure Theory: Diagonalizing the Drift Kinetic Operator E. D. Held eheld@cc.usu.edu Utah State University General Neoclassical Closure Theory:Diagonalizing the Drift Kinetic Operator
More information(In)approximability Results for Pattern Matching Problems
(In)approximability Results for Pattern Matching Problems Raphaël Clifford and Alexandru Popa Department of Computer Science University of Bristol Merchant Venturer s Building Woodland Road, Bristol, BS8
More informationZebo Peng Embedded Systems Laboratory IDA, Linköping University
TDTS 01 Lecture 8 Optimization Heuristics for Synthesis Zebo Peng Embedded Systems Laboratory IDA, Linköping University Lecture 8 Optimization problems Heuristic techniques Simulated annealing Genetic
More information