Textbook Learning and Intelligent Optimization 10Th International Conference Lion 10 Ischia Italy May 29 June 1 2016 Revised Selected Papers 1St Edition Paola Festa Ebook All Chapter PDF

Learning and Intelligent Optimization
10th International Conference LION 10

Ischia Italy May 29 June 1 2016 Revised
Selected Papers 1st Edition Paola Festa
Visit to download the full and correct content document:
https://textbookfull.com/product/learning-and-intelligent-optimization-10th-international
-conference-lion-10-ischia-italy-may-29-june-1-2016-revised-selected-papers-1st-editi
on-paola-festa/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Learning and Intelligent Optimization 8th International

Conference Lion 8 Gainesville FL USA February 16 21
2014 Revised Selected Papers 1st Edition Panos M.
Pardalos
https://textbookfull.com/product/learning-and-intelligent-
optimization-8th-international-conference-lion-8-gainesville-fl-
usa-february-16-21-2014-revised-selected-papers-1st-edition-
panos-m-pardalos/
Learning and Intelligent Optimization 14th

International Conference LION 14 Athens Greece May 24
28 2020 Revised Selected Papers Lecture Notes in
Computer Science 12096 1st Edition Ilias S. Kotsireas
(Editor)
https://textbookfull.com/product/learning-and-intelligent-
optimization-14th-international-conference-lion-14-athens-greece-
may-24-28-2020-revised-selected-papers-lecture-notes-in-computer-
science-12096-1st-edition-ilias-s-kotsireas/
Swarm Intelligence Based Optimization Second

International Conference ICSIBO 2016 Mulhouse France
June 13 14 2016 Revised Selected Papers 1st Edition
Patrick Siarry
https://textbookfull.com/product/swarm-intelligence-based-
optimization-second-international-conference-
icsibo-2016-mulhouse-france-june-13-14-2016-revised-selected-
papers-1st-edition-patrick-siarry/
E Learning and Games 10th International Conference

Edutainment 2016 Hangzhou China April 14 16 2016
Revised Selected Papers 1st Edition Abdennour El
Rhalibi
https://textbookfull.com/product/e-learning-and-games-10th-
international-conference-edutainment-2016-hangzhou-china-
april-14-16-2016-revised-selected-papers-1st-edition-abdennour-
Structural Information and Communication Complexity
20th International Colloquium SIROCCO 2013 Ischia Italy
July 1 3 2013 Revised Selected Papers 1st Edition
Andrea Clementi
https://textbookfull.com/product/structural-information-and-
communication-complexity-20th-international-colloquium-
sirocco-2013-ischia-italy-july-1-3-2013-revised-selected-
papers-1st-edition-andrea-clementi/
Mobile Secure and Programmable Networking Second

International Conference MSPN 2016 Paris France June 1
3 2016 Revised Selected Papers 1st Edition Selma
Boumerdassi
https://textbookfull.com/product/mobile-secure-and-programmable-
networking-second-international-conference-mspn-2016-paris-
france-june-1-3-2016-revised-selected-papers-1st-edition-selma-
boumerdassi/
Innovative Security Solutions for Information

Technology and Communications 9th International
Conference SECITC 2016 Bucharest Romania June 9 10 2016
Revised Selected Papers 1st Edition Ion Bica
https://textbookfull.com/product/innovative-security-solutions-
for-information-technology-and-communications-9th-international-
conference-secitc-2016-bucharest-romania-june-9-10-2016-revised-
selected-papers-1st-edition-ion-bica/
Machine Learning Optimization and Big Data Third

International Conference MOD 2017 Volterra Italy
September 14 17 2017 Revised Selected Papers 1st
Edition Giuseppe Nicosia
https://textbookfull.com/product/machine-learning-optimization-
and-big-data-third-international-conference-mod-2017-volterra-
italy-september-14-17-2017-revised-selected-papers-1st-edition-
giuseppe-nicosia/
Machine Learning and Intelligent Communications First

International Conference MLICOM 2016 Shanghai China
August 27 28 2016 Revised Selected Papers 1st Edition
Huang Xin-Lin (Eds.)
https://textbookfull.com/product/machine-learning-and-
intelligent-communications-first-international-conference-
mlicom-2016-shanghai-china-august-27-28-2016-revised-selected-
Paola Festa
Meinolf Sellmann
Joaquin Vanschoren (Eds.)
LNCS 10079
Learning and
Intelligent Optimization
10th International Conference, LION 10
Ischia, Italy, May 29 – June 1, 2016
Revised Selected Papers
123
Lecture Notes in Computer Science 10079
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zurich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7407
Paola Festa Meinolf Sellmann
•
Joaquin Vanschoren (Eds.)
Learning and
Intelligent Optimization
10th International Conference, LION 10
Ischia, Italy, May 29 – June 1, 2016
Revised Selected Papers
123
Editors
Paola Festa Joaquin Vanschoren
University of Naples Federico II Eindhoven University of Technology
Naples Eindhoven
Italy The Netherlands
Meinolf Sellmann
Thomas J. Wastson Research Center
Yorktown Heights, NY
USA
ISSN 0302-9743 ISSN 1611-3349 (electronic)

Lecture Notes in Computer Science
ISBN 978-3-319-50348-6 ISBN 978-3-319-50349-3 (eBook)
DOI 10.1007/978-3-319-50349-3
Library of Congress Control Number: 2016958517
LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues
© Springer International Publishing AG 2016

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissions that may have been made.
Printed on acid-free paper
This Springer imprint is published by Springer Nature

The registered company is Springer International Publishing AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
The large variety of heuristic algorithms for hard optimization problems raises numerous
interesting and challenging issues. Practitioners are confronted with the burden of
selecting the most appropriate method, in many cases through an expensive algorithm
configuration and parameter tuning process, and subject to a steep learning curve.
Scientists seek theoretical insights and demand a sound experimental methodology for
evaluating algorithms and assessing strengths and weaknesses. A necessary prerequisite
for this effort is a clear separation between the algorithm and the experimenter, who, in
too many cases, is “in the loop” as a crucial intelligent learning component. Both issues
are related to designing and engineering ways of “learning” about the performance of
different techniques, and ways of using past experience about the algorithm behavior to
improve performance in the future. This is the scope of the Learning and Intelligent
Optimization (LION) conference series.
This volume contains the papers presented at LION 10: Learning and Intelligent
Optimization, held during May 29 – June 1, 2016 in Ischia, Italy. This meeting, which
continues the successful series of LION events (see LION 5 in Rome, Italy; LION 6 in
Paris, France; LION 7 in Catania, Italy; LION 8 in Gainesville, USA; and LION 9 in
Lille, France), explores the intersections and uncharted territories between machine
learning, artificial intelligence, mathematical programming, and algorithms for hard
optimization problems. The main purpose of the event is to bring together experts from
these areas to discuss new ideas and methods, challenges, and opportunities in various
application areas, general trends, and specific developments. The International Con-
ference on Learning and Optimization is proud to be the premier conference in the area.
A total of 47 papers were submitted to LION 10: 28 submissions of long papers, 13
submissions of short papers, and six abstracts for oral presentation only. Each manuscript
was independently reviewed by at least three (usually four) members of the Program
Committee. The final decision was made based on a meta-reviewing phase where each
manuscript’s reviews were shown to five other members of the Program Committee, who
then voted to either accept or reject the manuscript. Only long papers that received four or
five votes in favor were accepted as long papers. Papers that received at least three votes
in favor were accepted as short papers (papers submitted as long papers had to be
shortened).
In total, 14 long papers and nine short papers were accepted. The selection rate for
long papers was 34%.
These proceedings also contain two papers submitted to the generalization-based
contest in global optimization (GENOPT). These were reviewed independently by the
GENOPT Organizing Committee.
During the conference, the keynote talk was delivered by Bistra Dilkina, on “Learning
to Branch in Mixed Integer Programming.”
VI Preface
In addition, we were pleased to have two tutorial talks:

• “Learning Algorithms and Bioinformatics,” by Giovanni Felici and Emanuel
Weitschek
• “Automatic Algorithm Configuration,” by Meinolf Sellmann
Finally, we gratefully acknowledge the support of our sponsors and partners in
organizing this conference:
• IBM Research
• University of Naples Federico II, Italy
• Department of Mathematics and Applications “R. Caccioppoli”, University of
Naples Federico II, Italy
We hope that these proceedings may serve you well in your endeavors in learning
and intelligent optimization.
May 2016 Paola Festa

Meinolf Sellmann
Joaquin Vanschoren
Organization
Program Committee
Carlos Ansótegui Universitat de Lleida, Spain
Bernd Bischl LMU Munich, Germany
Christian Blum IKERBASQUE, Basque Foundation for Science, Spain
Mauro Brunato University of Trento, Italy
André Carvalho University of São Paulo, Brazil
John Chinneck Carleton University, Ottawa, Canada
Andre Cire University of Toronto Scarborough, Canada
Luca Di Gaspero University of Udine, Italy
Bistra Dilkina Georgia Institute of Technology, USA
Paola Festa (Co-chair) University of Naples Federico II, Italy
Tias Guns K.U. Leuven, Belgium
Frank Hutter University of Freiburg, Germany
Eyke Hüllermeier Philipps-Universität Marburg, Germany
George Katsirelos INRA, Toulouse, France
Lars Kotthoff University of British Columbia, Canada
Dario Landa-Silva The University of Nottingham, UK
Hoong Chuin Lau Singapore Management University, Singapore
Jimmy Lee The Chinese University of Hong Kong, SAR China
Marie-Eléonore Université Lille 1, France
Marmion
George Nemhauser Georgia Tech/School of ISyE, USA
Barry O’Sullivan 4C, University College Cork, Ireland
Claude-Guy Quimper Université Laval, Canada
Helena Ramalhinho UPF, Spain
Lourenço
Francesca Rossi University of Padova, Italy and Harvard University, USA
Ashish Sabharwal AI2, USA
Horst Samulowitz IBM Research, USA
Marc Schoenauer Projet TAO, Inria Saclay Île-de-France, France
Meinolf Sellmann IBM Research, USA
(Co-chair)
Bart Selman Cornell University, USA
Yaroslav Sergeyev University of Calabria, Italy
Peter J. Stuckey University of Melbourne, Australia
Thomas Stützle Université Libre de Bruxelles (ULB), Belgium
Eric D. Taillard University of Applied Science Western Switzerland,
HEIG-Vd, Switzerland
VIII Organization
Michael Trick Carnegie Mellon, USA

Joaquin Vanschoren Eindhoven University of Technology, The Netherlands
(Co-chair)
Petr Vilím IBM Czech, Czech Republic
Additional Reviewers
Akgun, Ozgur Lindauer, Marius Misir, Mustafa

Cardonha, Carlos Lindawati, Lindawati Teng, Teck-Hou
Gunawan, Aldy Mayer-Eichberger, Yap, Roland
Khalil, Elias Valentin
Klein, Aaron Meseguer, Pedro
Contents
Full Papers
Learning a Stopping Criterion for Local Search . . . . . . . . . . . . . . . . . . . . . 3

Alejandro Arbelaez and Barry O’Sullivan
Surrogate Assisted Feature Computation for Continuous Problems . . . . . . . . 17

Nacim Belkhir, Johann Dréo, Pierre Savéant, and Marc Schoenauer
MO-ParamILS: A Multi-objective Automatic Algorithm

Configuration Framework. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
Aymeric Blot, Holger H. Hoos, Laetitia Jourdan,
Marie-Éléonore Kessaci-Marmion, and Heike Trautmann
Evolving Instances for Maximizing Performance Differences

of State-of-the-Art Inexact TSP Solvers . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
Jakob Bossek and Heike Trautmann
Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population

for Global Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
Mauro Brunato and Roberto Battiti
Bounding the Search Space of the Population Harvest Cutting Problem

with Multiple Size Stock Selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
Laura Climent, Barry O’Sullivan, and Steven D. Prestwich
Designing and Comparing Multiple Portfolios of Parameter Configurations

for Online Algorithm Selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
Aldy Gunawan, Hoong Chuin Lau, and Mustafa Mısır
Portfolios of Subgraph Isomorphism Algorithms . . . . . . . . . . . . . . . . . . . . . 107

Lars Kotthoff, Ciaran McCreesh, and Christine Solnon
Structure-Preserving Instance Generation . . . . . . . . . . . . . . . . . . . . . . . . . . 123

Yuri Malitsky, Marius Merschformann, Barry O’Sullivan,
and Kevin Tierney
Feature Selection Using Tabu Search with Learning Memory:

Learning Tabu Search . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
Lucien Mousin, Laetitia Jourdan, Marie-Eléonore Kessaci Marmion,
and Clarisse Dhaenens
X Contents
The Impact of Automated Algorithm Configuration on the Scaling

Behaviour of State-of-the-Art Inexact TSP Solvers . . . . . . . . . . . . . . . . . . . 157
Zongxu Mu, Holger H. Hoos, and Thomas Stützle
Requests Management for Smartphone-Based Matching Applications

Using a Multi-agent Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
Gilles Simonin and Barry O’Sullivan
Self-organizing Neural Network for Adaptive Operator Selection

in Evolutionary Search. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
Teck-Hou Teng, Stephanus Daniel Handoko, and Hoong Chuin Lau
Quantifying the Similarity of Algorithm Configurations . . . . . . . . . . . . . . . . 203

Lin Xu, Ashiqur R. KhudaBukhsh, Holger H. Hoos,
and Kevin Leyton-Brown
Short Papers
Neighborhood Synthesis from an Ensemble of MIP and CP Models . . . . . . . 221

Tommaso Adamo, Tobia Calogiuri, Gianpaolo Ghiani, Antonio Grieco,
Emanuela Guerriero, and Emanuele Manni
Parallelizing Constraint Solvers for Hard RCPSP Instances. . . . . . . . . . . . . . 227

Roberto Amadini, Maurizio Gabbrielli, and Jacopo Mauro
Characterization of Neighborhood Behaviours in a Multi-neighborhood

Local Search Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234
Nguyen Thi Thanh Dang and Patrick De Causmaecker
Constraint Programming and Machine Learning for Interactive

Soccer Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
Robinson Duque, Juan Francisco Díaz, and Alejandro Arbelaez
A Matheuristic Approach for the p-Cable Trench Problem . . . . . . . . . . . . . . 247

Eduardo Lalla-Ruiz, Silvia Schwarze, and Stefan Voß
An Empirical Study of Per-instance Algorithm Scheduling . . . . . . . . . . . . . . 253

Marius Lindauer, Rolf-David Bergdoll, and Frank Hutter
Dynamic Strategy to Diversify Search Using a History Map

in Parallel Solving. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
Seongsoo Moon and Mary Inaba
Faster Model-Based Optimization Through Resource-Aware

Scheduling Strategies. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 267
Jakob Richter, Helena Kotthaus, Bernd Bischl, Peter Marwedel,
Jörg Rahnenführer, and Michel Lang
Contents XI
Risk-Averse Anticipation for Dynamic Vehicle Routing . . . . . . . . . . . . . . . . 274

Marlin W. Ulmer and Stefan Voß
GENOPT Papers
Solving GENOPT Problems with the Use of ExaMin Solver . . . . . . . . . . . . 283

Konstantin Barkalov, Alexander Sysoyev, Ilya Lebedev,
and Vladislav Sovrasov
Hybridisation of Evolutionary Algorithms Through Hyper-heuristics

for Global Continuous Optimisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296
Eduardo Segredo, Eduardo Lalla-Ruiz, Emma Hart, Ben Paechter,
and Stefan Voß
Subject Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309

Full Papers
Learning a Stopping Criterion for Local Search
Alejandro Arbelaez(B) and Barry O’Sullivan
Insight Centre for Data Analytics, Department of Computer Science,

University College Cork, Cork, Ireland
{alejandro.arbelaez,barry.osullivan}@insight-centre.org
Abstract. Local search is a very effective technique to tackle combi-

natorial problems in multiple areas ranging from telecommunications to
transportations, and VLSI circuit design. A local search algorithm typ-
ically explores the space of solutions until a given stopping criterion is
met. Ideally, the algorithm is executed until a target solution is reached
(e.g., optimal or near-optimal). However, in many real-world problems
such a target is unknown. In this work, our objective is to study the appli-
cation of machine learning techniques to carefully craft a stopping crite-
rion. More precisely, we exploit instance features to predict the expected
quality of the solution for a given algorithm to solve a given problem
instance, we then run the local search algorithm until the expected qual-
ity is reached. Our experiments indicate that the suggested method is
able to reduce the average runtime up to 80% for real-world instances
and up to 97% for randomly generated instances with a minor impact in
the quality of the solutions.
1 Introduction
Local search is a popular technique to solve many combinatorial problems. These

problems can be classified as either decision or optimisation problems. A combi-
natorial decision problem involves finding a solution that satisfies the constraints
of the problem. The satisfiability (SAT) problem is perhaps one of the most
important decision problems and involves determining whether a given Boolean
formula in conjunctive normal form (i.e., conjunction of clauses) is satisfiable or
not. In combinatorial optimisation the goal is to find a solution that satisfies the
constraints and proving that the solution is optimal. For example, the Travelling
Salesman Problem (TSP) is a well-known combinatorial optimisation problem
that involves finding the shortest Hamiltonian circle in a complete graph.
A local search algorithm starts with a given initial solution and iteratively
improves it, little by little, by performing small changes while a given stopping
criterion is not met. In the context of SAT the algorithm typically starts with
a random assignment for the variables and the algorithm flips one variable at a
time until either a solution is obtained or a time limit is reached. Alternatively,
to solve a TSP the algorithm heuristically builds a starting solution and then
applies the k-opt move, i.e., k-links of the current solution are replaced with k
new links by improving the current solution until the optimal solution is reached,

c Springer International Publishing AG 2016
P. Festa et al. (Eds.): LION 2016, LNCS 10079, pp. 3–16, 2016.
DOI: 10.1007/978-3-319-50349-3 1
4 A. Arbelaez and B. O’Sullivan
no improvement is observed after applying the k-opt move, or a given time limit
is reached.
In this paper, we focus our attention in local search to tackle combinatorial
optimisation problems. Ideally the algorithm is executed until a given target
solution is reached, (i.e., optimal or near-optimal). In this paper we exploit the
use of instance features to predict the expected quality of the solution for a given
problem instance. We then execute the local search algorithm until the desired
quality is reached. A proper stopping criterion might considerably reduce the
runtime of the algorithm. Therefore accurate predictions are very important, in
particular with the increasing availability of computational power in cloud sys-
tems, e.g., Amazon Cloud EC2, Google Cloud, and Microsoft Azure. Typically,
these systems charge for usage by processor-hour. Therefore reducing the com-
putational time and still providing high quality solutions is expected to be very
valuable in the near future.
This paper is structured as follows. Sections 2 and 3 provide background
material of the two target problems, i.e., CRP and TSP. Section 4 details the
machine learning methodology to design the stopping criterion. Section 5 reports
on the experimental validation. Related work is discussed in Sect. 6 before final
conclusions are presented in Sect. 7.
2 The Cable Routing Problem
The Cable Routing Problem (CRP) that we are tackling in this paper relates to
the bounded spanning tree problem with side constraints. In particular we focus
on a network design problem arising in optical networks where a bound is given
on the number of carriers. Each selected carrier is connected to a set of clients
using a network that follows a tree topology that respects distance, degree, and
capacity constraints.
A long-reach passive optical network (LR-PON) architecture consists of three
subnetworks: (1) an Optical Distribution Network (ODN) for connecting cus-
tomers to facilities; (2) a backhaul network for connecting facilities to metro-
nodes; and (3) a core network connecting pairs of metro-nodes. We focus our
attention on the ODN part, where the fibre cable is routed from a facility to a
set of customer forming a tree distribution network. A PON is a tree network
associated with each cable and the signal attenuation in a PON is due the num-
ber of customers in the PON and the maximum length of the fibre between the
facility and the customer. Additionally, non-root nodes are limited to maximum
branching of p nodes. In [1] the authors show the relationship between the size
and the maximum length of the PON.
Informally speaking, in the CRP we want to determine a set of spanning
trees with side constraints, i.e., distance, degree, and capacity, such that each
tree is rooted at the facility, each customer is present in exactly one tree and the
total cost of the solution is minimised. The number of trees denotes the number
of optical fibres that run from the exchange-site to the customers. Typically, the
distance is limited to up 10 km, 20 km, and 30 Km for respectively at most 512,
Learning a Stopping Criterion for Local Search 5
256, and 128 customers, and due to hardware constraints the branching factor
is restricted to 32.
Local Search for CRP

In [2] the authors propose a general constraint-based local search algorithm to
tackle bounded minimum spanning tree with side constraints. Broadly speaking,
the algorithm comprises two phases. First, in an intensification phase, the algo-
rithm improves the current solution, little by little, by performing small changes.
It employs a move operator in order to move from one solution to another in the
hope of improving the value of the objective function. Second, in the diversifi-
cation phase, the algorithm perturbs the incumbent solution in order to escape
from difficult regions of the search. The algorithm switches from intensification
to diversification when a local minimum is reached.
The subtree operator (Fig. 1) moves a given node ei and the subtree ema-
nating from ei from the current location to another in the tree. As a result of
this, the predecessor of ei is not connected to ei , and all successors of ei are still
directly connected to the node. ei can be placed as a successor for another node
or in the middle of an existing edge. In order to complete the intensification and
diversification phases, the subtree operator requires four main functions: remov-
ing a subtree; checking whether a given solution is feasible or not; inserting a
subtree; finding the best location of a subtree in the current subtree; and finding
the best location of a subtree in the current network. The general idea of the LS
algorithm in the intensification phase is described as follows:
1. Randomly select a node (ei );

2. Delete the emanating subtree of ei in the current solution;
3. Identify the best location, i.e., a new predecessor ep and a potential successor
es for ei satisfying all constraints;
4. Insert ei as a new successor of ep , and if needed, add es as a new predecessor
of ep .
5
2
3
10 11
4 5
8 9 10 11 6 7
Fig. 1. Example of the subtree move-operator

During the diversification phase the third step performs a random selection
of the new candidate location of ei in the tree. It is worth noticing that the
local search operator has been used in several network design applications such
as [3,4].
A solution is represented by a tree whose root-node is the facility and the
number of immediate successors of the root-node is the number of cables starting
at the facility. Notice that the facility acts as the root-node of each cable tree net-
work. Without loss of generality we add a set of dummy clients (or copies of the
facility) to the original set of clients for the purpose of ease of representation to
distinguish the cable tree-networks. More precisely the set of clients, {v0 , . . . , vn },
is modified to {v0 , v1 , . . . , vm , v1+m . . . , vn+m }. Recall that n is the number of
clients and m is the upper bound on the number of cables that can start at the
facility. In the latter set v0 is the original facility, each vi ∈ {v1 . . . vm } denote
the starting point of a cable tree network, and {v1+m , . . . , vn+m } denote the
original set of clients. We further enforce that each dummy client is connected
to v0 and the distance between the dummy client and the facility is zero, i.e.,
∀1 ≤ i ≤ m, d0i = 0.
Default Stopping Criterion. We use search stagnation as the default stopping

criterion and compute a bound on the solution. In particular, we stop the algo-
rithm whenever no improvement greater than 0.01% in the incumbent solution
has been observed for 30 consecutive seconds.
3 Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is a well-known combinatorial optimisa-

tion problem with applications in multiple areas ranging from transportation to
VLSI circuit design, and bioinformatics. The TSP involves finding the shortest
tour among a predefined list of n cities such that all cities are visited only once.
We focus our attention on the 2D Euclidean TSP in which we are given a set of
points in a plane, and the distance between two points is the Euclidean distance
between their corresponding coordinates.
Local Search for TSP
The Lin-Kernighan heuristic (LKH) [5] is an efficient local search algorithm to

solve TSPs with tens of thousands of cities. Although this is an incomplete
algorithm it is known to provide near-optimal solutions within very short com-
putational time.
The 2-opt operator [6] is one of the first local search move operators to solve
TSP instances. Figure 2 shows an example of the operator by removing (black
dotted lines) edges (a, b) and (c, d) from the current tour and reconstructing
the tour, in the new solution, by connecting a with d and b with c (grey lines).
Notice that after removing the edges in the 2-opt there is only one feasible way
of reconnecting the tour. For instance, in our example adding edges (a, c) and
a b
p q
c d
Fig. 2. Example of the 2-opt operator.
(b, d) will not result in a valid solution. In general, the k-opt move removes k
edges from the current tour; k ranges from two to the number of cities. For k > 2
there are multiple ways of reconstructing the solution, in this case the algorithm
typically uses the one with the shortest tour.
Currently, there are a large variety of heuristics to create the initial tour or
solution such as Nearest Neighbour and Quick-Boruvka; see [7] for a complete
description of the algorithms. However, LKH suggests the use of randomly gen-
erated tours as an initial solution. Other features of the LKH algorithm include
the ability to restrict the use of certain edges within a given distance of a given
city, and efficient data structures to check whether a solution is a valid tour
or not.
Default Stopping Criterion. The algorithm stops when no improvement can be

observed for a given solution, that is, when no neighbouring solution can improve
the current tour. Additionally, we also use a certain time limit to stop the exe-
cution of the algorithm.
4 Machine Learning Methodology

Supervised Machine Learning exploits data labelled by the expert to automat-
ically build hypotheses emulating the expert’s decisions. Formally, a learning
algorithm processes a training set E = {(xi , yi ), xi ∈ Ω, yi ∈ {1, −1}, i = 1 . . . n}
comprising n examples (xi , yi ), where xi is the example description (e.g. a vector
of values, Ω = Rd ) and yi is the associated output. The output can be numeri-
cal (i.e., regression) or a class label (i.e., classification). The learning algorithm
outputs a hypothesis f : Ω → Y associating with each example description x
the output y = f (x). Among ML applications are pattern recognition, ranging
from computer vision to fraud detection [8], predicting protein function [9], game
playing [10], autonomic computing [11], etc.
In Fig. 3 we depict the general methodology to learn a stopping criterion
for a given problem instance. Similar to other machine learning applications,
the learning process takes place offline and involves computing features and the
quality of the solution for each instance in the training set. Later on in the
online testing phase, for each unseen instance, we compute the feature set and
use the ML model to compute the expected outcome (i.e., solution quality) of
the algorithm for the instance.
Fig. 3. ML methodology to learn a stopping criterion
In recent years, machine learning has been used extensively to design port-
folios of algorithms. Informally, a portfolio of algorithms uses machine learning
techniques to identify the most suitable algorithm to solve a given problem
instance; see [12] for a recent survey. SATzilla [13] is probably the most popu-
lar portfolio of algorithms for SAT solving. Informally speaking, SATzilla uses
a set of features to describe a given problem instance, the feature set encodes
general information about the target instance, e.g., number of variables, clauses,
fraction of Horn clauses, number of unit propagations, etc. Similar to our app-
roach, SATzilla employs a training and testing phases. During the training phase
the portfolio requires a set of target instances and a set of SAT solvers. Dur-
ing the testing phase, a set of pre-solvers are executed in a pre-defined manner
for a short period and if no solution is obtained during the pre-solving time,
the algorithm with minimal expected runtime is executed. SATzilla has shown
impressive results during the past SAT competition winning several tracks in
the annual SAT competitions.
Reinforcement learning, another branch of machine learning, has also been
an effective alternative in the development of self-tuning algorithms. In contrast
with the previous portfolio of algorithms approach, here the algorithms have the
ability to adjust the parameters while solving a problem instance. An interesting
application of these algorithms is the reactive search framework described and
analysed in [14] where the authors proposed a mechanism for adjusting the size
of the tabu list by increasing (resp. decreasing) its size according to the progress
of the search.
CRP Instance Features
For each instance we compute two main type of features: basic and initial solution
features. While a few of these features had already been used in the context of
portfolio of algorithms for the TSP problem, many descriptors had to be added to
consider properties of the CRP with distance, degree, and capacity constraints.
Basic Features. These encode general information of a given problem instance:

1. Number of nodes (1 feature);
2. Distance matrix (3 features): mean, median, standard deviation;
3. Distance to root-node (3 features): mean, median, standard deviation;
4. Pairwise distance (3 features): mean, median, standard deviation.
Initial Solution Features. For each instance we compute multiple initial solutions
to extract the following features, and for each of the following five categories we
compute the mean of 5 independent initial solutions:
1. Node out-degree (3 features): mean, median, standard deviation;
2. Root-node out-degree (3 features): mean, median, standard deviation;
3. Max. distance to root (3 features): mean, median, standard deviation;
4. Size of the cable tree networks (3 features): mean, median, standard deviation;
5. Number. of leaf nodes (3 features): mean, median, standard deviation.
TSP Instance Features

In [15] the authors describe 50 descriptors to characterise TSP instances. Com-
puting the full set of features is computationally very expensive. Therefore we
limit our attention to the following twelve features divided in three categories:
1. Problem size features (1 feature): number of cities;
2. Distance matrix features (3 features): mean, variation coefficient, skew;
3. Minimum spanning tree (8 features): after constructing the minimum span-
ning tree there are four features describing the distance (mean, variation
coefficient, skew) and four features describing node degree statistics: mean,
variation coefficient, and skew).
Stopping Criterion
The pseudo-code for a generic local search algorithm with the proposed stopping
criterion is presented in Algorithm 1. The algorithm requires the target instance
I, a regression model m, and a discrepancy d ∈ (0, 1] indicating how far from
Algorithm 1. LocalSearchWithStoppingCriterion(Problem-Instance I, ML-

Model m, Discrepancy d )
1: v ← Compute-features(I)
2: c ← Compute-expected-quality(m, v)
3: target quality ← c + c · d
4: s ← Initial-solution(I)
5: while default stopping criterion is not met and quality(s) > target quality do
6: s ← step(I, s)
7: end while
8: return s
the target solution should be from the expected solution. Certainly, the choice
of a value close to zero for d leads to better solutions at a cost of using more
time to reach the target solution.
The algorithm starts by computing the vector of features v for a given
instance I (line 1), then we use the regression model m to compute the expected
quality of the solution (line 2). Without loss of generality we assume a minimi-
sation problem. Thus, we compute the target quality as the tolerance between
the computed solution and the outcome of the regression model (line 3). Lines
4-7 sketch a general description of local search solvers, computing an initial solu-
tion (line 4), and iteratively moving from one solution to another using a given
move operator, e.g., subtree or k-opt operators. We recall that we use the target
solution in addition to the default stopping criterion of the algorithm. Thus, for
instance, if the algorithm reaches a time limit we also stop the execution.
5 Empirical Evaluation
We consider a collection of 500 real-world CRP instances from a major broad-

band provider in Ireland. For TSP instances we randomly generated a set of 300
instances with the portcgen problem generator varying the number of cites from
500 to 5000.1 We ran each local search algorithm 20 times on each instance (each
time with a different random seed) with a 5-minute time cutoff and report the
average time and solution quality for the instances. All experiments were per-
formed on a 39-node cluster, each node features a Intel Xeon E5430 processors
at 2.66 Ghz and 12 GB of RAM memory.
In order to validate our algorithms we used the traditional 10-fold cross-
validation technique [16], that is, the entire dataset D is divided into 10 disjoint
sets {D1 , D2 , . . . , D10 }. For each dataset Di∈10 , the regression model is learned
with D \ Di and tested with Di . In the following experiments we use the linear
regression implementation available in the Weka toolbox (version 3.6.2) [17].
We use to state-of-the-art local search solvers [2,5] to tackle CRPs and TSPs,
respectively.
We computed the baseline solutions using the default stopping criterion of
each respective local search solver with a time limit of 300 seconds. We use this
criterion as reference to compute the gap of the solutions as follows:
ls-quality(I) − baseline-quality(I)
GAP (I) =
baseline-quality(I)
where baseline-quality and ls-quality indicate respectively the quality of the base-
line solutions and the quality of the local search with the suggested stopping
criterion for a given instance I.
We start our analysis with Table 1 in which we analyse the quality of the
regression model to predict the quality of the baseline solutions. We report the
correlation coefficient (CC) and the root mean-squared error (RMSE) between
1
portcgen is available at http://dimacs.rutgers.edu/Challenges/TSP/codes.tar.
Table 1. Correlation coefficient and Root mean square error of estimations and runtime
for the baseline computation
Problem CC RMSE Runtime (s) Feature time (s)

CRP 0.95 7.2 89.0 2.05
TSP 0.99 6.2 258.2 0.40
250
150
Predicted Cost x 105

200
Predicted Cost
100
150
50 100
0 50
0 50 100 150 50 100 150 200 250
5
Actual Cost Actual Cost x 10
(a) 500 CRP instances (b) 300 TSP instances
Fig. 4. Actual vs. Estimated quality for each CRP and TSP instance
the baseline solutions and our predictions, the average runtime and the average
time for feature computation. As it can be observed the regression model greatly
predicts the quality of the actual baseline solutions with a CC of 0.95 (CRP) and
0.95 (TSP), and RMSE of 7.2 (CRP) and 6.2 (TSP). We also remark that the
average feature computation time is considerably lower than the actual average
runtime of the algorithms. In Fig. 4 we provide a visual comparison of the actual
baseline solution quality and the outcome of the regression model for the entire
dataset. The diagonal line represents a perfect prediction, as it can be observed
the predictions are highly correlated with the baseline results.
Fig. 5 shows the cumulative distribution of the feature computation time for
all instances for both solvers. The feature computation time ranges from 0.6 to
Fig. 5. Feature computation time

Table 2. CRP: statistics varying the discrepancy target to the expected solution
Discrepancy (%) Time (s) GAP(%) KS(%) WRS(%)

avg avg std
0 53.9 3.55 5.79 55.9 20.4
1 49.3 4.30 6.44 36.9 9.63
2 45.3 4.39 6.40 32.9 8.46
3 41.1 4.51 6.36 25.7 7.45
4 37.9 4.63 6.30 22.6 6.44
5 35.1 4.76 6.25 22.6 5.56
10 24.3 5.27 6.01 9.5 2.95
15 17.4 5.62 5.84 6.9 1.91
Table 3. TSP: statistics varying the discrepancy target to the expected solution, the
last entry for the statistical tests are 5.4·10−5 (KS) and 1.8·10−5 (WRS)
Discrepancy (%) Time (s) GAP(%) KS(%) WRS(%)

avg avg std
0 153.4 0.76 1.72 99.9 73.1
1 121.9 1.09 1.91 99.6 59.6
2 84.61 1.54 2.11 84.7 43.9
3 58.7 2.10 2.32 51.7 28.6
4 39.0 2.73 2.48 29.2 16.8
5 22.8 3.43 2.62 14.6 8.52
10 5.5 7.50 3.11 0.01 0.02
15 3.7 11.51 3.62 0.00 0.00
5.7 seconds for CRP instances and from 0.01 to 1.1 seconds for TSP instances. We
would like to recall that we use a subset of the complete feature set described
in [15] for the TSP problem, the complete feature set required up to several
minutes to compute the descriptors.
We now focus our attention on the evaluation of the local search algorithms
with the suggested stopping criterion. To this end, we evaluate eight values for
the minimum desired discrepancy of the target solution (i.e., 0–5%, 10% and
15%). Tables 2 and 3 depict the results showing: the average runtime, the gap
with respect to the baseline solution, and the output of the Kolmogorov-Smirnov
(KS) and Wilcoxon Signed-Rank (WSR) tests to check whether the solution with
the new stopping criterion and the baseline solutions are statistically different
or not. Bold entries indicate that the solution with the new stopping criterion
is not statistically different than the baseline solution. Interestingly, in nearly
all scenarios we observed that the results with the suggested stopping criterion
are statistically the same as the baseline results, only 2 scenarios with KS and
4 scenarios with WSR failed the test with a 5% confidence level.
As expected, there is a trade-off between quality and speed. In our experi-
ments we observed for CRP instances a reduction of up to 80% in the runtime
to reach a solution 5.6% far from the baseline solution. Certainly, the runtime
increases when enforcing better quality solutions, in particular we observed that
for a discrepancy of 0% (i.e., setting as a target solution the predicted quality)
the gap with respect to baseline solution is 3.5% and the runtime reduction
is about 39%. A similar scenario can be observed for TSP instances where we
observe a reduction of 97% (with discrepancy=5%) in the runtime to reach a
solution with a gap of 3.4%, and enforcing the best possible quality we observe a
solution with a gap of 0.7% with a reduction of 40% in the runtime with respect
to the baseline solution.
We conclude our analysis with the cumulative distribution function (CDF)
of the algorithms. Figure 6 describes the probability of a given algorithm to find
a solution for a given instance with time (resp. quality) less than or equal to x.
The x-axis denotes the time (resp. quality) and y-axis denotes the probability
to reach a certain time (resp. quality). Figures 6(b) and (d) visually confirm the
output of the KS and WRS tests, that is, the cost of the solutions are very
close to the baseline for two discrepancy values of the CRP. For the TSP we
Fig. 6. CDF analysis for the baseline solutions vs. discrepancies 0% and 15%
observe that the baseline is very close to the baseline solutions for d=0% and
slightly different for d=15%. Figures 6(a) and (c) show that the baseline stopping
criterion requires more time than the modified version of the algorithm with the
suggested stopping criterion.
6 Related Work
Random restarts are often used to avoid getting trapped in local minima and
search stagnation. Typically, the algorithm is stopped after completing a cer-
tain number of restarts or when a target solution (optimal or near-optimal) is
obtained. However, in many real-world problems such a solution is not known.
In [18] the authors propose a methodology to on-the-fly construct a probabilistic
rule to estimate the probability of finding a solution at least as good as the cur-
rent best solution in future restarts. The methodology starts by approximating
the quality of the solution of the first k restarts with a Normal distribution. This
distribution is then used to estimate the number of high quality solutions that
will be observed in future restarts. The authors present empirical results with
reliable predictions when k is large enough.
Alternatively, [19] uses the empirical distribution to identify the optimal num-
ber of diversification (or exploration) steps required to escape from a local mini-
mum. The idea behind this approach is too avoid using too much computational
time with unnecessary diversification steps, while still providing statistical evi-
dence that future intensification steps will not end up in the same plateau area.
In this paper we propose a stopping criterion to balance the trade-off between
the quality of the solution and its runtime regardless of the methodology to
escape plateaus and local minima, and without particular assumptions on the
objective function.
In the field of continuous optimization several authors have proposed sev-
eral stopping rules for the multistart framework. Here we briefly describe the
basic ideas of a few stopping rules. We refer the reader to [20] for a complete
description.
In [21] stopping rules are proposed based on Bayesian methods to stop as
soon as there is enough evidence that the best value will not change in future
restarts. A Bayesian stopping rule for GRASP is proposed in [22]. The authors
assume that the distribution function is known beforehand and derive explicit
rules for two particular cases.
In [23] the authors estimate the probability p that the best value observed in
last restart is within certain threshold of the global optimum. p is approximated
with the best solutions observed in previous restarts that at within of the
incumbent solution. This approach was extended in [24] by counting the number
of solutions that are within since the last update of the incumbent solution.
We remark that the above stopping rules for continuous optimization assume
that the objective function satisfy certain properties, e.g., continuity, differen-
tiable, Lipshitz condition, or that one should be able to find explicit formulas
for the distribution function.
7 Conclusions
In this work, our objective was to study the application of machine learning tech-
niques to carefully craft a stopping criterion for local search algorithms where the
optimal solution is typically unknown beforehand. In particular, we use instance
features to predict the cost of the solution for a given algorithm to solve a
given problem instance. Interestingly, we have observed that machine learning
can indeed provide very accurate estimations of the expected quality of two effi-
cient local search solvers. We have observed that by using the estimation of the
regression model we can reduce the average runtime by up to 80% for real-world
CRP instances and by up to 97% for randomly generated instances with a minor
impact in the quality of the solutions.
Further research will involve the use of the estimated target solution in the
context of tree-base algorithms to tackle optimisation problems in two main
directions: first reducing the computation time to reach the target solution, and
second, pruning the search space by eliminating candidate solutions as soon as
we are able to detect that no improvement is expected in the target solution.
Acknowledgments. This work was supported by DISCUS (FP7 Grant Agree-

ment 318137) and Science Foundation Ireland (SFI) Grant No. 10/CE/I1853. The
Insight Centre for Data Analytics is also supported by SFI under Grant Number
SFI/12/RC/2289.
References
1. Davey, R., Grossman, D., Rasztovits-Wiech, M., Payne, D., Nesset, D., Kelly,
A., Rafel, A., Appathurai, S., Yang, S.H.: Long-reach passive optical networks.
J. Lightwave Technol. 27(3), 273–291 (2009)
2. Arbelaez, A., Mehta, D., O’Sullivan, B., Quesada, L.: Constraint-based local search
for the distance- and capacity-bounded network design problem. In: ICTAI 2014,
Limassol, Cyprus, November 10–12, 2014, pp. 178–185 (2014)
3. Arbelaez, A., Mehta, D., O’Sullivan, B., Quesada, L.: Constraint-based local search
for edge disjoint rooted distance-constrainted minimum spanning tree problem. In:
CPAIOR 2015, pp. 31–46 (2015)
4. Arbelaez, A., Mehta, D., O’Sullivan, B.: Constraint-based local search for finding
node-disjoint bounded-paths in optical access networks. In: CP 2015, pp. 499–507
(2015)
5. Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman
heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)
6. Croes, G.A.: A method for solving traveling salesman problems. Oper. Res. 6,
791–812 (1958)
7. Hoos, H., Stütze, T.: Stochastic Local Search: Foundations and Applications. Mor-
gan Kaufmann, New York (2005)
8. Larochelle, H., Bengio, Y.: Classification using Discriminative Restricted Boltz-
mann Machines. In: ICML 2008, Helsinki, Finland, ACM 536–543., June 2008
9. Al-Shahib, A., Breitling, R., Gilbert, D.R.: Predicting protein function by machine
learning on amino acid sequences - a critical evaluation. BMC Genomics 8(2), 78
(2007)
10. Gelly, S., Silver, D.: Combining Online and Offline Knowledge in UCT. In: ICML
2007. vol. 227, pp. 273–280. ACM, Corvalis, Oregon, USA, June 2007
11. Rish, I., Brodie, M., Ma, S., et al.: Adaptive diagnosis in distributed dystems.
IEEE Trans. Neural Netw. 16, 1088–1109 (2005)
12. Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI
Mag. 35(3), 48–60 (2014)
13. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: portfolio-based algo-
rithm selection for SAT. J. Artif. Intell. Res. 32, 565–606 (2008)
14. Battiti, R., Tecchiolli, G.: The reactive tabu search. INFORMS J. Comput. 6(2),
126–140 (1994)
15. Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction:
methods & evaluation. Artif. Intell. 206, 79–111 (2014)
16. Kahavi, R.: A study of cross-validation and bootstrap for accuracy estimation and
model selection. In: IJCAI 1995, pp. 1137–1145 (1995)
17. Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The
weka data mining software: an update. SIGKDD Explor. 11, 10–18 (2009)
18. Ribeiro, C.C., Rosseti, I., Souza, R.C.: Effective probabilistic stopping rules for ran-
domized metaheuristics: GRASP Implementations. In: Coello, C.A.C. (ed.) LION
2011. LNCS, vol. 6683, pp. 146–160. Springer, Heidelberg (2011). doi:10.1007/
978-3-642-25566-3 11
19. Bontempi, G.: An optimal stopping strategy for online calibration in local search.
In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 106–115. Springer, Hei-
delberg (2011). doi:10.1007/978-3-642-25566-3 8
20. Pardalos, P.M., Romeijn, H.E.: Handbook of Global Optimization. Springer, Hei-
delberg (2002)
21. Boender, C.G.E., Kan, A.H.G.R.: Bayesian stopping rules for multistart global
optimization methods. Math. Program. 37(1), 59–80 (1987)
22. Orsenigo, C., Vercellis, C.: Bayesian stopping rules for greedy randomized proce-
dures. J. Global Optim. 36(3), 365–377 (2006)
23. Dorea, C.C.Y.: Stopping rules for a random optimization method. SIAM J. Control
Optim. 4, 841–850 (1990)
24. Hart, W.E.: Sequential stopping rules for random optimization methods with appli-
cations to multistart local search. SIAM J. Optim. 9(1), 270–290 (1998)
Surrogate Assisted Feature Computation
for Continuous Problems
Nacim Belkhir1,2(B) , Johann Dréo1 , Pierre Savéant1 , and Marc Schoenauer2

1
Thales Research & Technology, Palaiseau, France
{nacim.belkhir,johann.dreo,pierre.saveant}@thalesgroup.com
2
TAO, Inria Saclay Île-de-France, Orsay, France
marc.schoenauer@inria.fr
Abstract. A possible approach to Algorithm Selection and Configura-

tion for continuous black box optimization problems relies on problem
features, computed from a set of evaluated sample points. However, the
computation of these features requires a rather large number of such
samples, unlikely to be practical for expensive real-world problems. On
the other hand, surrogate models have been proposed to tackle the opti-
mization of expensive objective functions. This paper proposes to use
surrogate models to approximate the values of the features at reasonable
computational cost. Two experimental studies are conducted, using a
continuous domain test bench. First, the effect of sub-sampling is ana-
lyzed. Then, a methodology to compute approximate values for the fea-
tures using a surrogate model is proposed, and validated from the point
of view of the classification of the test functions. It is shown that when
only small computational budgets are available, using surrogate models
as proxies to compute the features can be beneficial.
Keywords: Empirical study · Black-box continuous optimization ·

Surrogate modelling · Problem features
1 Introduction
Different optimization algorithms, or, equivalently, different parameterizations
of the same algorithm, will in general perform non-uniformly on different classes
of optimization problems. Today, it is widely acknowledged in the domain of
optimization at large that the quest for a general optimization algorithm, that
would solve all problems at best, is vain, as proved by different works around
the No Free Lunch theorem [1,12]. Hence, tackling an unknown optimization
problem amounts to choose the best algorithm among a given set of possible
algorithms (algorithm selection), and/or the best parameter set for a given algo-
rithm (algorithm configuration).
Such a choice can be considered as an optimization problem by itself, thus
pertaining to the Programming by Optimization (PbO) paradigm proposed by
[4]: given a new optimization problem instance (an objective function to mini-
mize or maximize), a set of algorithms with domains for their parameters, and

c Springer International Publishing AG 2016
P. Festa et al. (Eds.): LION 2016, LNCS 10079, pp. 17–31, 2016.
DOI: 10.1007/978-3-319-50349-3 2
18 N. Belkhir et al.
a performance measure, find the best1 algorithm or parameter setting to solve

this problem. However, such a meta-optimization problem is in general diffi-
cult to solve (hierarchical search space, multi-modal landscape, . . . ) and thus
requires running different algorithms with different parameterizations, where
each of these runs will in turn call the objective function a large number of
times: in total, the number of calls to the objective function will be huge, mak-
ing such an approach intractable in most real-world situations with expensive
objective functions.
The PbO approach can however be applied to classes of objective functions:
the best algorithm/parameter setting can be learned off-line, once and for all
for a given class of functions, and the optimal setting (algorithm + parameters)
applied to all members of that class. This is the case for instance in operational
contexts, where the same type of problem, but with slightly different settings,
has to be solved again and again. However, in the general case of black-box
optimization problems, very little domain knowledge is known (the type of search
space for sure, maybe some relevant parameters) and such characteristics are not
sufficient to reliably choose an algorithm and its parameters.
Another approach is then to compute some characteristics of objective func-
tions, aka features, without much domain knowledge, and, thanks to a large
example base of algorithms performances on known objective functions, to learn
a performance model of several algorithms and their parameters. A well-known
success in that direction has been obtained in the SAT domain [13], but dozens
of features had been proposed in the literature to describe SAT problems and
try to understand what makes a SAT problem hard for this or that algorithm.
This situation is quite unique, and is an appeal for research regarding the design
and study of features in other domains.
In particular, in the domain of continuous optimization (the search space is
a subspace of IRd , for some d), several recent works [8,9,11] have proposed many
different features to try to understand the landscape of continuous optimization
and, ultimately, solve the Algorithm Selection and/or Configuration problem.
Note that a large body of mathematical programming algorithms exist, and are
proved to be optimal for specific classes of objective functions: Linear Program-
ming should be applied if the function (and the constraints) are linear; gradient-
based algorithms should be applied if the function is convex, twice differentiable
and well-conditioned, etc. But these are rare exceptions in the real world, where
the general problem remains open, and the feature-based approach seems worth
investigating, in particular considering the promising initial results obtained by
[9] (more in Sect. 2).
Unfortunately, the computation of all proposed features is based on many
sample points, i.e., values of the objective function at given (generally ran-
dom) points of the search space. In real-world situations, where the objective
1
The performance measure generally involves time-to-solution (CPU time, or num-
ber of function evaluations) and precision/accuracy of the solution returned by the
algorithm (precision of the solution for continuous optimization problems, number
of constraints violated for Constraint Programming problems, etc.).
Another random document with
no related content on Scribd:
One day I sent her to Tiffany’s, the jewellers. She added only a
mere little trinket to my order, a locket with her monogram set in
diamonds. I received the bill in due course, but she had left me.
Previously she had gone with me to Nice, and had remained there
while I was on the road in the United States. When I returned I
learned that during my absence she had lived at the hotel where I
left her and that her bill, charged to my account, amounted to nearly
6,000 francs.
Presently other invoices arrived from dyers and cleaners, glove
makers, shoemakers, costumiers, modistes, furriers, linendrapers
and finally the bill from Tiffany’s.
But the limit was reached when a student from the Beaux Arts
asked me if I could not return him sixty-six francs which he had lent
me two years before through the medium of my pretty secretary.
Next there came a gentleman from London, one whom I held in too
great esteem to go into details, who asked me for ten pounds
sterling which he had loaned me, again through the medium of my
clever and well-dressed secretary.
But in speaking of my troubles I am liable to forget my lunch with
the Clareties.
As we were about to sit down Mme. Claretie brought in an elderly
woman of very pleasant appearance. I have rarely seen motions
easier, more simple or more harmonious. Leaning against each other
they made a delightful picture. Mme. Claretie presented me to her
mother. I asked how she was.
“Oh, I am very well,” she replied, “my eyes are my only trouble. I
cannot read without glasses, and the glasses annoy me a great
deal.”
She had always been very fond of reading, and could not bring
herself to the idea of reading no more. I sympathised with her and
told her so. Then suddenly it occurred to me to ask her how old she
was.
“Ninety-five years,” she replied.
And she was complaining of not being able to read any longer
without glasses!
We spoke of her grandchildren and her great grandchildren. I
asked her if the happiness of being surrounded by so many
affectionate people did not bring large compensation for the
infirmities of age.
She replied:
“I love my children and my grandchildren, and I live in them. But
that does not restore to me my eyesight. It is terrible not to be able to
see.”
And she was right. Love gave her strength to bear her
misfortune, but she feared that the prison of darkness would claim
her as its prey. Before going to the dining-room she had taken her
daughter’s arm. She had no assistance on the other hand in eating.
Her good humour was unvarying.
She took some knitting from a work-basket, and said in a firm
voice:
“I must work. I can no longer see well enough to be sure that my
knitting is well done, but I have to keep busy, nevertheless.”
Mme. Claretie asked me if I was acquainted with Alexandre
Dumas.
I told her how I had chanced to meet him. Then M. Claretie asked
me numerous questions, which I tried to evade in order not to seem
to talk about myself all the time. Imagine my astonishment when next
morning I read in the Temps an article, a column and a half long,
devoted entirely to our visit at M. Claretie’s and signed by the
gentleman himself.
“Mme. Hanako,” he wrote, “is in town, a little person, delightfully
odd and charming. In her blue or green robes, embroidered with
flowers of many colours, she is like a costly doll, or a prettily
animated idol, which should have a bird’s voice. The sculptor Rodin
may possibly show us her refined features and keen eyes at the next
Salon, for he is occupied just now with a study of her, and I believe a
statue of the comedienne. He has never had a better model. These
Japanese, who are so energetic, leaping into the fray like the ants
upon a tree trunk, are likewise capable of the most complete
immobility and the greatest patience. These divergent qualities
constitute the strength of their race.
“Mme. Hanako, whom I saw and applauded in ‘The Martyr’ at the
Opera, came to see me, through the kindness of Miss Loie Fuller,
who discovered Sada Yacco for us some years ago. It is delightful to
see at close hand and in so attractive a guise this little creature, who
looks so frightful when, with convulsed eyes, she mimics the death
agony. There is a pretty smile on the lips which at the theatre are
curled under the pain of hara-kiri. She made me think of Orestes
exhibiting the funeral urn to Electra: ‘As you see, we bring the little
remnants in a little urn.’
“Loie Fuller, who was a soubrette before being the goddess of
light, an enchantress of strange visions, has become enamoured of
this dramatic Japanese art and has popularised it everywhere,
through Sada Yacco and then through Mme. Hanako. I have always
observed that Loie Fuller has a very keen intelligence. I am not
surprised that Alexandre Dumas said to me: ‘She ought to write out
her impressions and her memories.’ I should like to hear from her
how she first conceived these radiant dances, of which the public
has never grown tired, and which she has just begun again at the
Hippodrome. She is, however, more ready to talk philosophy than
the stage. Gaily, with her blue eye and her faun-like smile, she
replied to my question: ‘It’s just chance. The light came to me. I
didn’t have to go to it.’”
I apologize for reproducing these eulogistic words. I have even
suppressed certain passages, for M. Claretie was very
complimentary. It was, however, absolutely necessary that I should
make this citation, since out of it grew the present book.
M. Claretie had quoted Dumas’ opinion. He returned to the
charge.
Soon after, in fact, I received a letter from M. Claretie urging me
to begin my “memoirs.” Perhaps he was right, but I hardly dared
undertake such a terrible task all alone. It looked so formidable to
write a book, and a book about myself!
One afternoon I called on Mme. Claretie. A number of pleasant
people were there and, after Mme. Claretie had mentioned this
notion of “memoirs” which her husband, following Dumas’ lead, had
favoured, they all began to ask me questions about myself, my art
and the steps by which I had created it. Everyone tried to encourage
me to undertake the work.
A short time after this Mme. Claretie sent me tickets for her box
at the Théâtre-Français. I went there with several friends. There
were twelve of us, among whom was Mrs. Mason, wife of the
American Consul-General, who is the most remarkable statesman I
have ever known, and the best diplomatist of the service.
In return for the Clareties’ kindness I invited them to be present at
one of my rehearsals of ‘Salome.’ They were good enough to accept
my invitation and one evening they arrived at the Théâtre des Arts
while I was at work. Later I came forward to join them. We stood in
the gloom of a dimly lighted hall. The orchestra was rehearsing. All
at once a dispute arose between the musical composer and the
orchestra leader. The composer said:
“They don’t do it that way at the Opera.”
Thereupon the young orchestra leader replied:
“Don’t speak to me of subsidised theatres. There’s nothing more
imbecile anywhere.”
He laid great stress on the words “subsidised” and “imbecile.”
M. Claretie asked me who this young man was. I had not heard
exactly what he said. Nevertheless, as I knew something
embarrassing had occurred, I tried to excuse him, alleging that he
had been rehearsing all day, that half his musicians had deserted to
take positions at the Opera and that they had left him only the
understudies.
M. Claretie, whose good nature is proverbial, paid no attention to
the incident. Several days later, indeed, on November 5, 1907, he
wrote for the Temps a long article, which is more eulogistic than I
deserve, but which I cite because it gives an impression of my work
at a rehearsal.
“The other evening,” he wrote, “I had, as it were, a vision of a
theatre of the future, something of the nature of a feministic theatre.
“Women are more and more taking men’s places. They are
steadily supplanting the so-called stronger sex. The court-house
swarms with women lawyers. The literature of imagination and
observation will soon belong to women of letters. In spite of man’s
declaration that there shall be no woman doctor for him the female
physician continues to pass her examinations and brilliantly. Just
watch and you will see woman growing in influence and power; and
if, as in Gladstone’s phrase, the nineteenth century was the working-
man’s century, the twentieth will be the women’s century.
“I have been at the Théâtre des Arts, Boulevard des Batignolles,
at a private rehearsal, which Miss Loie Fuller invited me to attend.
She is about to present there to-morrow a ‘mute drama’—we used to
call it a pantomime—the Tragedie de Salome, by M. Robert
d’Humières, who has rivalled Rudyard Kipling in translating it. Loie
Fuller will show several new dances there: the dance of pearls, in
which she entwines herself in strings of pearls taken from the coffin
of Herodias; the snake dance, which she performs in the midst of a
wild incantation; the dance of steel, the dance of silver, and the
dance of fright, which causes her to flee, panic-stricken, from the
sight of John’s decapitated head persistently following her and
surveying her with martyred eyes.
THE DANCE OF FEAR FROM “SALOME”
“Loie Fuller has made studies in a special laboratory of all the
effects of light that transform the stage, with the Dead Sea, seen
from a height, and the terraces of Herod’s palace. She has
succeeded, by means of various projections, in giving the actual
appearance of the storm, a glimpse of the moonbeams cast upon the
waves, of the horror of a sea of blood. Of Mount Nebo, where
Moses, dying, hailed the promised land, and the hills of Moab which
border the horizon, fade into each other where night envelops them.
The light in a weird way changes the appearance of the picturesque
country. Clouds traverse the sky. Waves break or become smooth as
a surface of mother-of-pearl. The electric apparatus is so arranged
that a signal effects magical changes.
“We shall view miracles of light ere long at the theatre. When M.
Fortuny, son of the distinguished Spanish artist, has realised ‘his
theatre’ we shall have glorious visions. Little by little the scenery
encroaches upon the stage, and perhaps beautiful verses, well
pronounced, will be worthy of all these marvels.
“It is certain that new capacities are developing in theatrical art,
and that Miss Loie Fuller will have been responsible for an important
contribution. I should not venture to say how she has created her
light effects. She has actually been turned out by her landlord
because of an explosion in her apparatus. Had she not been so well
known she would have been taken for an anarchist. At this theatre,
Rue des Batignolles, where I once witnessed the direst of
melodramas that ever made popular audiences shiver, at this
theatre, which has become elegant and sumptuous with its
handsome, modernised decorations, at the Théâtre des Arts, she
has installed her footlights, her electric lamps, all this visual fairyland
which she has invented and perfected, which has made of her a
unique personality, an independent creator, a revolutionist in art.
“There, on that evening when I saw her rehearse Salome in
everyday clothes, without costume, her glasses over her eyes,
measuring her steps, outlining in her dark robe the seductive and
suggestive movements, which she will produce to-morrow in her
brilliant costume, I seemed to be watching a wonderful impresaria,
manager of her troupe as well as mistress of the audience, giving
her directions to the orchestra, to the mechanicians, with an
exquisite politeness, smiling in face of the inevitable nerve-racking
circumstances, always good-natured and making herself obeyed, as
all real leaders do, by giving orders in a tone that sounds like asking
a favour.
“‘Will you be good enough to give us a little more light? Yes. That
is it. Thank you.’
“On the stage another woman in street dress, with a note-book in
her hand, very amiable, too, and very exact in her directions and
questions, took the parts of John the Baptist, half nude, of Herod in
his purple mantle, of Herodias magnificent under her veils, and
assumed the function of regisseur (one cannot yet say regisserice).
And I was struck by the smoothness of all this performance of a
complicated piece, with its movements and various changes. These
two American women, without raising their voices, quietly but with
the absolute brevity of practical people (distrust at the theatre those
who talk too much), these two women with their little hands
fashioned for command were managing the rehearsal as an expert
Amazon drives a restive horse.
“Then I had the immense pleasure of seeing this Salome in
everyday clothes dance her steps without the illusion created by
theatrical costume, with a simple strip of stuff, sometimes red and
sometimes green, for the purpose of studying the reflections on the
moving folds under the electric light. It was Salome dancing, but a
Salome in a short skirt, a Salome with a jacket over her shoulders, a
Salome in a tailor-made dress, whose hands—mobile, expressive,
tender or threatening hands, white hands, hands like the tips of birds’
wings—emerged from the clothes, imparted to them all the poetry of
the dance, of the seductive dance or the dance of fright, the infernal
dance or the dance of delight. The gleam from the footlights reflected
itself on the dancer’s glasses and blazed there like flame, like
fugitive flashes, and nothing could be at once more fantastic and
more charming than these twists of the body, these caressing
motions, these hands, again, these dream hands waving there
before Herod, superb in his theatrical mantle, and observing the
sight of the dance idealised in the everyday costume.
“I can well believe that Loie Fuller’s Salome is destined to add a
Salome unforeseen of all the Salomes that we have been privileged
to see. With M. Florent Schmitt’s music she connects the wonders of
her luminous effects. This woman, who has so profoundly influenced
the modes, the tone of materials, has discovered still further effects,
and I can imagine the picturesqueness of the movements when she
envelops herself with the black serpents which she used the other
evening only among the accessories behind the scenes.”
That evening between the two scenes, M. Claretie again spoke of
my book; and, to sum up, it is thanks to his insistence that I decided
to dip my pen in the inkwell and to begin these “memoirs.” It was a
long task, this book was, long and formidable for me. And so many
little incidents, sometimes comic and sometimes tragic, have already
recurred during the making of this manuscript that they might alone
suffice to fill a second volume.
OLD FAMILY RECORDS
I N the muniment chests of many County Families there exist,

without doubt, papers and records of very great historical and
biographical value. From time to time a book will appear based
upon such material. A preface will explain how the papers that
appear in the volume were brought to light through the industry and
enterprise of some antiquarian or man of letters, and how he had
persuaded their owner to allow to be published what he had thought
possessed interest only for himself and members of his family.
N OT only documents and correspondence relating to literary,

political, or historical matters are likely to prove of interest; but
also family papers that tell of the social or domestic life of a
past century or a bygone generation. Messrs. Herbert Jenkins Ltd.
will be pleased at any time to advise the possessors of Old Diaries,
Manuscripts, Letters, or any other description of Family Papers, as to
their suitability for publication in book form. When deemed desirable
the papers themselves, duly insured against loss or damage during
transit, will, with the consent of the owner, be submitted to experts.
O N all such matters advice will be given without involving the

possessor of the original documents in any expense or liability.
In the first instance a list of the papers upon which advice may
be required should be enclosed, giving some particulars of their
nature (if letters, by whom and to whom written), dates and
approximate extent.
DIRECTORS: ADDRESS:
SIR GEORGE H. CHUBB, BT. HERBERT JENKINS LTD.
ALEX W. HILL, M.A. 12 ARUNDEL PLACE,
HERBERT JENKINS. HAYMARKET, LONDON.
Transcriber’s Notes
Inconsistent word hyphenation and spelling have been
regularized.
Apparent typographical errors have been changed.
*** END OF THE PROJECT GUTENBERG EBOOK FIFTEEN
YEARS OF A DANCER'S LIFE ***
Updated editions will replace the previous one—the old editions

will be renamed.
Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright
in these works, so the Foundation (and you!) can copy and
distribute it in the United States without permission and without
paying copyright royalties. Special rules, set forth in the General
Terms of Use part of this license, apply to copying and
distributing Project Gutenberg™ electronic works to protect the
PROJECT GUTENBERG™ concept and trademark. Project
Gutenberg is a registered trademark, and may not be used if
you charge for an eBook, except by following the terms of the
trademark license, including paying royalties for use of the
Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is
very easy. You may use this eBook for nearly any purpose such
as creation of derivative works, reports, performances and
research. Project Gutenberg eBooks may be modified and
printed and given away—you may do practically ANYTHING in
the United States with eBooks not protected by U.S. copyright
law. Redistribution is subject to the trademark license, especially
commercial redistribution.
START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK
To protect the Project Gutenberg™ mission of promoting the

free distribution of electronic works, by using or distributing this
work (or any other work associated in any way with the phrase
“Project Gutenberg”), you agree to comply with all the terms of
the Full Project Gutenberg™ License available with this file or
online at www.gutenberg.org/license.
Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand,
agree to and accept all the terms of this license and intellectual
property (trademark/copyright) agreement. If you do not agree to
abide by all the terms of this agreement, you must cease using
and return or destroy all copies of Project Gutenberg™
electronic works in your possession. If you paid a fee for
obtaining a copy of or access to a Project Gutenberg™
electronic work and you do not agree to be bound by the terms
of this agreement, you may obtain a refund from the person or
entity to whom you paid the fee as set forth in paragraph 1.E.8.
1.B. “Project Gutenberg” is a registered trademark. It may only

be used on or associated in any way with an electronic work by
people who agree to be bound by the terms of this agreement.
There are a few things that you can do with most Project
Gutenberg™ electronic works even without complying with the
full terms of this agreement. See paragraph 1.C below. There
are a lot of things you can do with Project Gutenberg™
electronic works if you follow the terms of this agreement and
help preserve free future access to Project Gutenberg™
electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright
law in the United States and you are located in the United
States, we do not claim a right to prevent you from copying,
distributing, performing, displaying or creating derivative works
based on the work as long as all references to Project
Gutenberg are removed. Of course, we hope that you will
support the Project Gutenberg™ mission of promoting free
access to electronic works by freely sharing Project
Gutenberg™ works in compliance with the terms of this
agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms
of this agreement by keeping this work in the same format with
its attached full Project Gutenberg™ License when you share it
without charge with others.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.
1.E. Unless you have removed all references to Project

Gutenberg:
1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project
Gutenberg™ work (any work on which the phrase “Project
Gutenberg” appears, or with which the phrase “Project
Gutenberg” is associated) is accessed, displayed, performed,
viewed, copied or distributed:
This eBook is for the use of anyone anywhere in the United

States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it
away or re-use it under the terms of the Project Gutenberg
License included with this eBook or online at
www.gutenberg.org. If you are not located in the United
States, you will have to check the laws of the country where
you are located before using this eBook.
1.E.2. If an individual Project Gutenberg™ electronic work is

derived from texts not protected by U.S. copyright law (does not
contain a notice indicating that it is posted with permission of the
copyright holder), the work can be copied and distributed to
anyone in the United States without paying any fees or charges.
If you are redistributing or providing access to a work with the
phrase “Project Gutenberg” associated with or appearing on the
work, you must comply either with the requirements of
paragraphs 1.E.1 through 1.E.7 or obtain permission for the use
of the work and the Project Gutenberg™ trademark as set forth
in paragraphs 1.E.8 or 1.E.9.
1.E.3. If an individual Project Gutenberg™ electronic work is

posted with the permission of the copyright holder, your use and
distribution must comply with both paragraphs 1.E.1 through
1.E.7 and any additional terms imposed by the copyright holder.
Additional terms will be linked to the Project Gutenberg™
License for all works posted with the permission of the copyright
holder found at the beginning of this work.
1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files
containing a part of this work or any other work associated with
Project Gutenberg™.
1.E.5. Do not copy, display, perform, distribute or redistribute
this electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
with active links or immediate access to the full terms of the
Project Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must, at
no additional cost, fee or expense to the user, provide a copy, a
means of exporting a copy, or a means of obtaining a copy upon
request, of the work in its original “Plain Vanilla ASCII” or other
form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™
works unless you comply with paragraph 1.E.8 or 1.E.9.
1.E.8. You may charge a reasonable fee for copies of or

providing access to or distributing Project Gutenberg™
electronic works provided that:
• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.
• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.E.9. If you wish to charge a fee or distribute a Project

Gutenberg™ electronic work or group of works on different
terms than are set forth in this agreement, you must obtain
permission in writing from the Project Gutenberg Literary
Archive Foundation, the manager of the Project Gutenberg™
trademark. Contact the Foundation as set forth in Section 3
below.
1.F.
1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on,
transcribe and proofread works not protected by U.S. copyright
law in creating the Project Gutenberg™ collection. Despite
these efforts, Project Gutenberg™ electronic works, and the
medium on which they may be stored, may contain “Defects,”
such as, but not limited to, incomplete, inaccurate or corrupt
data, transcription errors, a copyright or other intellectual
property infringement, a defective or damaged disk or other

Textbook Learning and Intelligent Optimization 10Th International Conference Lion 10 Ischia Italy May 29 June 1 2016 Revised Selected Papers 1St Edition Paola Festa Ebook All Chapter PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Textbook Learning and Intelligent Optimization 10Th International Conference Lion 10 Ischia Italy May 29 June 1 2016 Revised Selected Papers 1St Edition Paola Festa Ebook All Chapter PDF

Uploaded by

Copyright:

Available Formats

Learning and Intelligent Optimization

10th International Conference LION 10

Learning and Intelligent Optimization 8th International

Learning and Intelligent Optimization 14th

Swarm Intelligence Based Optimization Second

E Learning and Games 10th International Conference

Mobile Secure and Programmable Networking Second

Innovative Security Solutions for Information

Machine Learning Optimization and Big Data Third

Machine Learning and Intelligent Communications First

Joaquin Vanschoren (Eds.)

ISSN 0302-9743 ISSN 1611-3349 (electronic)

Library of Congress Control Number: 2016958517

LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues

© Springer International Publishing AG 2016

Printed on acid-free paper

This Springer imprint is published by Springer Nature

In addition, we were pleased to have two tutorial talks:

May 2016 Paola Festa

Michael Trick Carnegie Mellon, USA

Akgun, Ozgur Lindauer, Marius Misir, Mustafa

Learning a Stopping Criterion for Local Search . . . . . . . . . . . . . . . . . . . . . 3

Surrogate Assisted Feature Computation for Continuous Problems . . . . . . . . 17

MO-ParamILS: A Multi-objective Automatic Algorithm

Evolving Instances for Maximizing Performance Differences

Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population

Bounding the Search Space of the Population Harvest Cutting Problem

Designing and Comparing Multiple Portfolios of Parameter Configurations

Portfolios of Subgraph Isomorphism Algorithms . . . . . . . . . . . . . . . . . . . . . 107

Structure-Preserving Instance Generation . . . . . . . . . . . . . . . . . . . . . . . . . . 123

Feature Selection Using Tabu Search with Learning Memory:

The Impact of Automated Algorithm Configuration on the Scaling

Requests Management for Smartphone-Based Matching Applications

Self-organizing Neural Network for Adaptive Operator Selection

Quantifying the Similarity of Algorithm Configurations . . . . . . . . . . . . . . . . 203

Neighborhood Synthesis from an Ensemble of MIP and CP Models . . . . . . . 221

Parallelizing Constraint Solvers for Hard RCPSP Instances. . . . . . . . . . . . . . 227

Characterization of Neighborhood Behaviours in a Multi-neighborhood

Constraint Programming and Machine Learning for Interactive

A Matheuristic Approach for the p-Cable Trench Problem . . . . . . . . . . . . . . 247

An Empirical Study of Per-instance Algorithm Scheduling . . . . . . . . . . . . . . 253

Dynamic Strategy to Diversify Search Using a History Map

Faster Model-Based Optimization Through Resource-Aware

Risk-Averse Anticipation for Dynamic Vehicle Routing . . . . . . . . . . . . . . . . 274

Solving GENOPT Problems with the Use of ExaMin Solver . . . . . . . . . . . . 283

Hybridisation of Evolutionary Algorithms Through Hyper-heuristics

Subject Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309

Alejandro Arbelaez(B) and Barry O’Sullivan

Insight Centre for Data Analytics, Department of Computer Science,

Abstract. Local search is a very eﬀective technique to tackle combi-

Local search is a popular technique to solve many combinatorial problems. These

2 The Cable Routing Problem

Local Search for CRP

1. Randomly select a node (ei );

Fig. 1. Example of the subtree move-operator

Default Stopping Criterion. We use search stagnation as the default stopping

3 Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimisa-

Local Search for TSP

The Lin-Kernighan heuristic (LKH) [5] is an eﬃcient local search algorithm to

Fig. 2. Example of the 2-opt operator.

Default Stopping Criterion. The algorithm stops when no improvement can be