On the Effects of Window-Limits on the Distance Profiles of Permutation Neighborhood Operators

Local search algorithms, such as simulated annealing, tabu search, and local hill climbers attempt to optimize a solution to a problem by making locally improving modifications to a candidate solution. They rely on a neighborhood operator to restrict the search to a typically small set of possible successor states. The genetic algorithm mutation operator, likewise, enables the exploration of the local neighborhood of candidate solutions within the genetic algorithm's population. In this paper, we profile window-limited variations of several commonly employed neighborhood operators for problems in which candidate solutions are represented as permutations. Window-limited neighborhood operators enable tuning the size of the local neighborhood--e.g., to balance cost of search step against likelihood of getting stuck in a local optima. Window limits potentially can even be adjusted dynamically during search--e.g., to give a stagnated search a "kick." We provide profiles of the distance characteristics of window-limited variations of several of the more common permutation neighborhood operators.

[1]  Rafael Martí,et al.  Context-Independent Scatter and Tabu Search for Permutation Problems , 2005, INFORMS J. Comput..

[2]  Andreas Fink,et al.  Fitness Landscape Analysis for the Resource Constrained Project Scheduling Problem , 2009, LION.

[3]  James E. Smith,et al.  Self-Adaptation of Mutation Operator and Probability for Permutation Representations in Genetic Algorithms , 2010, Evolutionary Computation.

[4]  Christine L. Valenzuela,et al.  A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation , 2001, J. Heuristics.

[5]  Vincent A. Cicirello,et al.  Non-wrapping order crossover: an order preserving crossover operator that respects absolute position , 2006, GECCO.

[6]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[7]  S. Ronald,et al.  More distance functions for order-based encodings , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[8]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[9]  Vincent A. Cicirello,et al.  Profiling the Distance Characteristics of Mutation Operators for Permutation-Based Genetic Algorithms , 2013, FLAIRS Conference.

[10]  Vicente Campos,et al.  Scatter Search vs. Genetic Algorithms , 2002 .

[11]  Dana Shapira,et al.  Edit distance with move operations , 2002, J. Discrete Algorithms.

[12]  Jr. William Paul Swartz Automatic layout of analog and digital mixed macro/standard cell integrated circuits , 1993 .

[13]  Kenneth Sörensen,et al.  Distance measures based on the edit distance for permutation-type representations , 2007, J. Heuristics.

[14]  Vincent A. Cicirello,et al.  On the Design of an Adaptive Simulated Annealing Algorithm , 2007 .

[15]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[16]  Jean-Marc Delosme,et al.  Performance of a new annealing schedule , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..