A Tunable Generator of Instances of Permutation-Based Combinatorial Optimization Problems

In this paper, we propose a tunable generator of instances of permutation-based combinatorial optimization problems. Our approach is based on a probabilistic model for permutations, called the generalized Mallows model. The generator depends on a set of parameters that permits the control of the properties of the output instances. Specifically, in order to create an instance, we solve a linear programming problem in the parameters, where the restrictions allow the instance to have a fixed number of local optima and the linear function encompasses qualitative characteristics of the instance. We exemplify the use of the generator by giving three distinct linear functions that produce three landscapes with different qualitative properties. After that, our generator is tested in two different ways. First, we test the flexibility of the model by producing instances similar to benchmark instances. Second, we account for the capacity of the generator to create different types of instances according to the difficulty for population-based algorithms. We study the influence of the input parameters in the behaviors of these algorithms, giving an example of a property that can be used to analyze their performance.

[1]  E. Hüllermeier,et al.  A Simple Instance-Based Approach to Multilabel Classification Using the Mallows Model , 2009 .

[2]  J. A. Lozano,et al.  Sampling and Learning Mallows and Generalized Mallows Models Under the Cayley Distance , 2018 .

[3]  T. Stützle,et al.  The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms , 2004 .

[4]  John D. Lafferty,et al.  Conditional Models on the Ranking Poset , 2002, NIPS.

[5]  L. Darrell Whitley,et al.  Evaluating Evolutionary Algorithms , 1996, Artif. Intell..

[6]  Adam Prügel-Bennett,et al.  On the Landscape of Combinatorial Optimization Problems , 2014, IEEE Transactions on Evolutionary Computation.

[7]  Xiaodong Li,et al.  A framework for generating tunable test functions for multimodal optimization , 2011, Soft Comput..

[8]  Yi Mao,et al.  Non-parametric Modeling of Partially Ranked Data , 2007, NIPS.

[9]  M. Ayala-Rincón,et al.  Complexity of Cayley distance and other general metrics on permutation groups , 2012, 2012 7th Colombian Computing Congress (CCC).

[10]  Reha Uzsoy,et al.  Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial , 2001, J. Heuristics.

[11]  Alexander Mendiburu,et al.  Introducing the Mallows Model on Estimation of Distribution Algorithms , 2011, ICONIP.

[12]  C. L. Mallows.  NON-NULL RANKING MODELS. I , 1957 .

[13]  Marcus Gallagher,et al.  Fitness Distance Correlation of Neural Network Error Surfaces: A Scalable, Continuous Optimization Problem , 2001, ECML.

[14]  Marina Meila,et al.  Tractable Search for Learning Exponential Models of Rankings , 2009, AISTATS.

[15]  Marcus Gallagher,et al.  When Does Dependency Modelling Help? Using a Randomized Landscape Generator to Compare Algorithms in Terms of Problem Structure , 2010, PPSN.

[16]  Shengxiang Yang,et al.  Evolutionary Computation in Dynamic and Uncertain Environments , 2007, Studies in Computational Intelligence.

[17]  Alexander Mendiburu,et al.  An Evaluation of Methods for Estimating the Number of Local Optima in Combinatorial Optimization Problems , 2013, Evolutionary Computation.

[18]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[19]  Kenneth A. De Jong,et al.  Using Problem Generators to Explore the Effects of Epistasis , 1997, ICGA.

[20]  Weixiong Zhang,et al.  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.

[21]  José A. Gámez,et al.  Tackling the rank aggregation problem with evolutionary algorithms , 2013, Appl. Math. Comput..

[22]  M. Fligner,et al.  Distance Based Ranking Models , 1986 .

[23]  John H. Holland,et al.  Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions , 2000, Evolutionary Computation.

[24]  Marcus Gallagher,et al.  Using Landscape Topology to Compare Continuous Metaheuristics: A Framework and Case Study on EDAs and Ridge Structure , 2012, Evolutionary Computation.

[25]  Ariel D. Procaccia,et al.  When do noisy votes reveal the truth? , 2013, EC '13.

[26]  M. Fligner,et al.  Multistage Ranking Models , 1988 .

[27]  Alexander Mendiburu,et al.  Generating Customized Landscapes in Permutation-Based Combinatorial Optimization Problems , 2013, LION.

[28]  Marcus Gallagher,et al.  A general-purpose tunable landscape generator , 2006, IEEE Transactions on Evolutionary Computation.

[29]  Marcus Gallagher,et al.  On building a principled framework for evaluating and testing evolutionary algorithms: a continuous landscape generator , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..