Evolutionary Computation in Combinatorial Optimization: 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings

284 Pages·2013·4.99 MB·English

by  Ahmed Kheiri

Lecture Notes in Computer Science 7832
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
Martin Middendorf Christian Blum (Eds.)
Evolutionary Computation
in Combinatorial Optimization
13th European Conference, EvoCOP 2013
Vienna, Austria, April 3-5, 2013
Proceedings
1 3
VolumeEditors
MartinMiddendorf
UniversityofLeipzig
DepartmentofComputerScience
Johannisgasse26,04103Leipzig,Germany
E-mail:[email protected]
ChristianBlum
UniversityoftheBasqueCountry
IKERBASQUE,BasqueFoundationforScience
DepartmentofComputerScienceandArtificialIntelligence
PaseoManuelLardizabal1,20018Donostia,Spain
E-mail:[email protected]
FrontcoverEvoStar2013logobyKevinSim,EdinburghNapierUniversity
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-37197-4 e-ISBN978-3-642-37198-1
DOI10.1007/978-3-642-37198-1
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2013933104
CRSubjectClassification(1998):G.1.6,F.2,G.2,F.1,I.2.8
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©Springer-VerlagBerlinHeidelberg2013
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
inistcurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply,
evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws
andregulationsandthereforefreeforgeneraluse.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
Preface
Algorithms from the field of metaheuristics have been shown to be provenly
effective for an ever-broadening range of difficult combinatorial optimization
problems arising in a wide variety of industrial, economic, and scientific do-
mains. Prominent examples of metaheuristics include, but are not liminted to,
ant colony optimization, evolutionary algorithms, greedy randomized adaptive
search procedures, iterated local search, simulated annealing, tabu search, and
variable neighborhood search. Applications of metaheuristics can be found in a
widevarietyoffieldssuchasscheduling,timetabling,networkdesign,transporta-
tion and distribution, vehicle routing, the travelling salesman problem, packing
and cutting, satisfiability, and general mixed integer programming.
The series of EvoCOP workshops/conferences was initiated in 2001 and has
been held annually since then. In fact, EvoCOP is the first event specifically
dedicated to the application of evolutionary computation and related methods
to combinatorial optimization problems. Originally held as a workshop, Evo-
COP became a conference in 2004. Past events gave researchers an excellent
opportunitytopresenttheir latestresearchandtodiscusscurrentdevelopments
and applications. Following the general trend of hybrid metaheuristics and di-
minishing boundaries between different classes of metaheuristics, EvoCOP has
broadened its scope in recent years and has solicited papers on any kind of
metaheuristic for combinatorial optimization.
This volume contains the proceedings of EvoCOP 2013, the 13th European
ConferenceonEvolutionaryComputationinCombinatorialOptimization.Itwas
held in Vienna, Austria, during April 3–5, 2013, jointly with EuroGP 2013, the
16thEuropeanConferenceonGeneticProgramming,EvoBIO2013,the11thEu-
ropean Conference on Evolutionary Computation, Machine Learning and Data
Mining in Bioinformatics, EvoMUSART 2013, the Second International Con-
ference and 11th European Event on Evolutionary and Biologically Inspired
Music, Sound, Art and Design, and EvoApplications 2013 (formerly EvoWork-
shops), which consisted of 12 individual tracks ranging from complex systems
over games to risk management. From 2007, all these events are grouped under
the collective name EvoStar, and constitute Europe’s premier co-located event
on evolutionary computation and metaheuristics.
Accepted papers of previous EvoCOP editions were published by Springer
in the series Lecture Notes in Computer Science (LNCS – Volumes 2037, 2279,
2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022, 6622, 7245). Statistics for each
conference are as follows:
VI Preface
EvoCOP Submitted Accepted AcceptanceRatio
2001 31 23 74.2%
2002 32 18 56.3%
2003 39 19 48.7%
2004 86 23 26.7%
2005 66 24 36.4%
2006 77 24 31.2%
2007 81 21 25.9%
2008 69 24 34.8%
2009 53 21 39.6%
2010 69 24 34.8%
2011 42 22 52.4%
2012 48 22 45.8%
2013 50 23 46.0%
Therigorous,double-blindreviewingprocessofEvoCOP2013resultedinthe
selection of 23 out of 50 submitted papers; the acceptance rate was 46.0%. It
is worth pointing out that the number of submissions was higher than at last
year’sevent. Giventhe currenttimes ofcrisis, this is a remarkableachievement.
Eachpaperwasreviewedbyasufficientnumberofmembersofthe international
ProgramCommittee.Infact,theirworkisessentialforthecontinuingsuccessof
EvoCOP. Moreover, acceptance/rejection decisions were not only based on the
receivedrefereereportsbutalsoonapersonalevaluationoftheProgramChairs.
At this point we would like to thank all authors for submitting their work to
this EvoCOP edition.
There are various persons and institutions that have contributed to the suc-
cess of the conference and to whom we would like to express our appreciation.
First of all, we thank the local organizers of EvoStar 2013, Gu¨nther R. Raidl,
BinHu, andDorisDicklberger,fromtheViennaUniversityofTechnology.They
didanextraordinaryjob.Furthermore,wewouldliketothankMarcSchoenauer
from INRIA (France) for his continuing support concerning the MyReview con-
ference management system. We also thank Kevin Sim from Edinburgh Napier
University and A. S¸ima Etaner-Uyar from the Istanbul Technical University
for the excellent website and publicity material. Thanks are also due to Jen-
nifer Willies and the Institute for Informatics and Digital Innovation at Napier
UniversityinEdinburgh,Scotland,foradministrativesupportandeventcoordi-
nation. Finally, we gratefully acknowledge the Vienna University of Technology
for its support of EvoStar.
Last,butnotleast,wewouldliketothankCarlosCotta,PeterCowling,Jens
Gottlieb, Jin-KaoHao,JanovanHemert,PeterMerz,andGu¨nther R. Raidlfor
theirhardworkanddedicationatpasteditionsofEvoCOP,whichcontributedto
making this conference one of the reference events in evolutionary computation
and metaheuristics.
April 2013 Martin Middendorf
Christian Blum
Organization
EvoCOP 2013 was organized jointly with EuroGP 2013, EvoBIO 2013, Evo-
MUSART 2013, and EvoApplications 2013.
Organizing Committee
Program Committee Chairs
Martin Middendorf University of Leipzig, Leipzig, Germany
Christian Blum IKERBASQUE, Basque Foundation for
Science, and University of the Basque
Country, San Sebastian, Spain
Local Organization
Gu¨nther R. Raidl Vienna University of Technology, Austria
Bin Hu Vienna University of Technology, Austria
Doris Dicklberger Vienna University of Technology, Austria
Publicity Chair
A. S¸ima Etaner-Uyar Istanbul Technical University, Turkey
EvoCOP Steering Committee
Carlos Cotta Universidad de Ma´laga, Spain
Peter Cowling University of York, UK
Jens Gottlieb SAP AG, Germany
Jin-Kao Hao University of Angers, France
Jano van Hemert University of Edinburgh, UK
Peter Merz University of Applied Sciences and Arts,
Hannover, Germany
Gu¨nther Raidl Vienna University of Technology, Austria
Program Committee
Adnan Acan Eastern Mediterranean University,
Gazimagusa, Turkey
Hern´an Aguirre Shinshu University, Nagano, Japan
Enrique Alba Universidad de Ma´laga, Spain
Mehmet Emin Aydin University of Bedfordshire, UK
VIII Organization
Ruibin Bai University of Nottingham, UK
Thomas Bartz-Beielstein Cologne University of Applied Sciences,
Germany
Maria Blesa Universitat Polit`ecnica de Catalunya, Spain
Christian Blum IKERBASQUE and University of the
Basque Country, Spain
Rafael Caballero University of M´alaga, Spain
Alexandre Caminada UTBM, France
Pedro Castillo Universidad de Granada, Spain
Jos´e Francisco Chicano Garcia Universidad de M´alaga, Spain
Carlos Coello Coello CINVESTAV-IPN, Mexico
Peter Cowling University of York, UK
Keshav Dahal University of Bradford, UK
Karl Doerner Universit¨at Wien, Austria
Benjamin Doerr Max-Planck-Institut fu¨r Informatik,
Germany
Anton V. Eremeev Omsk Branch of Sobolev Institute of
Mathematics, Russia
Antonio J. Fern´andez Universidad de M´alaga, Spain
Francisco Fern´andez de Vega University of Extremadura, Spain
Bernd Freisleben University of Marburg, Germany
Philippe Galinier Ecole Polytechnique de Montreal, Canada
Jens Gottlieb SAP, Germany
Walter Gutjahr University of Vienna, Austria
Jin-Kao Hao University of Angers, France
Geir Hasle SINTEF Applied Mathematics, Norway
Istva´n Juhos University of Szeged, Hungary
Graham Kendall University of Nottingham, UK
Joshua Knowles University of Manchester, UK
Mario K¨oppen Kyushu Institute of Technology, Japan
Jozef Kratica University of Belgrade, Serbia
Rhyd Lewis Cardiff University, UK
Arnaud Liefooghe Universit´e des Sciences et Technologies de
Lille, France
Arne Løkketangen Molde College, Norway
Jos´e Antonio Lozano University of the Basque Country, Spain
Zhipeng Lu HUST, China
Penousal Machado University of Coimbra, Portugal
Dirk C. Mattfeld University of Braunschweig, Germany
Barry McCollum Queen’s University Belfast, UK
Juan Julia´n Merelo University of Granada, Spain
Peter Merz University of Applied Sciences and Arts,
Hannover, Germany
Martin Middendorf Universit¨at Leipzig, Germany
Julian Molina University of M´alaga, Spain
Organization IX
Pablo Moscato The University of Newcastle, Australia
Christine L. Mumford Cardiff University, UK
Nysret Musliu Vienna University of Technology, Austria
Yuichi Nagata Tokyo Institute of Technology, Japan
Giuseppe Nicosia University of Catania, Italy
Mario Pavone University of Catania, Italy
Francisco J. B. Pereira Universidade de Coimbra, Portugal
Daniel Cosmin Porumbel University of Artois, France
Jakob Puchinger Arsenal Research, Vienna, Austria
Gu¨nther Raidl Vienna University of Technology, Austria
Marcus Randall Bond University, Queensland, Australia
Marc Reimann Warwick Business School, UK
Andrea Roli Universita` degli Studi di Bologna, Italy
Eduardo Rodriguez-Tello CINVESTAV-Tamaulipas, Mexico
Patrick Siarry Universit´e Paris-EstCr´eteil Val-de-Marne,
France
Jim Smith University of the West of England, UK
Giovanni Squillero Politecnico di Torino, Italy
Thomas Stu¨tzle Universit´e Libre de Bruxelles, Belgium
El-ghazali Talbi Universit´edesSciencesetTechnologiesdeLille,
France
Kay Chen Tan National University of Singapore, Singapore
Jorge Tavares MIT, USA
Jano van Hemert University of Edinburgh, UK
Sebastien Verel Universit´e de Nice Sophia Antipolis, France
Takeshi Yamada NTT Communication Science Laboratories,
Japan
Shengxiang Yang De Montfort University, UK
Additional Referees
Pablo Garc´ıa-S´anchez Antonio M. Mora
Jean-Philippe Hamiez Mariela Nogueira
Rau´l Lara-Cabrera Martin Zaefferer
Table of Contents
A Hyper-heuristic with a Round Robin Neighbourhood Selection....... 1
Ahmed Kheiri and Ender O¨zcan
A Multiobjective Approach Based on the Law of Gravity and Mass
Interactions for Optimizing Networks............................... 13
A´lvaro Rubio-Largo and Miguel A. Vega-Rodr´ıguez
A Multi-objective Feature Selection Approach Based on Binary
PSO and Rough Set Theory....................................... 25
Liam Cervante, Bing Xue, Lin Shang, and Mengjie Zhang
A New Crossoverfor Solving Constraint Satisfaction Problems......... 37
Reza Abbasian and Malek Mouhoub
A Population-Based Strategic Oscillation Algorithm for Linear
Ordering Problem with Cumulative Costs ........................... 49
Wei Xiao, Wenqing Chu, Zhipeng Lu¨, Tao Ye, Guang Liu, and
Shanshan Cui
A Study of Adaptive Perturbation Strategy for Iterated Local Search... 61
Una Benlic and Jin-Kao Hao
Adaptive MOEA/D for QoS-Based Web Service Composition.......... 73
Mihai Suciu, Denis Pallez, Marcel Cremene, and
Dumitru Dumitrescu
An Analysis of Local Search for the Bi-objective Bidimensional
Knapsack Problem ............................................... 85
Leonardo C.T. Bezerra, Manuel L´opez-Ib´an˜ez, and Thomas Stu¨tzle
An Artificial Immune System Based Approach for Solving the Nurse
Re-rostering Problem............................................. 97
Broos Maenhout and Mario Vanhoucke
Automatic Algorithm Selection for the Quadratic Assignment Problem
Using Fitness Landscape Analysis.................................. 109
Erik Pitzer, Andreas Beham, and Michael Affenzeller
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search
Approach ....................................................... 121
Marian Rainer-Harbach, Petrina Papazek, Bin Hu, and
Gu¨nther R. Raidl
XII Table of Contents
Combinatorial Neighborhood Topology Particle Swarm Optimization
Algorithm for the Vehicle Routing Problem ......................... 133
Yannis Marinakis and Magdalene Marinaki
Dynamic Evolutionary Membrane Algorithm in Dynamic
Environments ................................................... 145
Chuang Liu and Min Han
From Sequential to Parallel Local Search for SAT .................... 157
Alejandro Arbelaez and Philippe Codognet
Generalizing Hyper-heuristics via Apprenticeship Learning ............ 169
Shahriar Asta, Ender O¨zcan, Andrew J. Parkes, and
A. S¸ima Etaner-Uyar
High-Order Sequence Entropies for Measuring Population Diversity in
the Traveling Salesman Problem ................................... 179
Yuichi Nagata and Isao Ono
Investigating Monte-Carlo Methods on the Weak Schur Problem ....... 191
Shalom Eliahou, Cyril Fonlupt, Jean Fromentin,
Virginie Marion-Poty, Denis Robilliard, and Fabien Teytaud
Multi-objective AI Planning: Comparing Aggregation and Pareto
Approaches ..................................................... 202
Mostepha R. Khouadjia, Marc Schoenauer, Vincent Vidal,
Johann Dr´eo, and Pierre Sav´eant
Predicting Genetic Algorithm Performance on the Vehicle Routing
Problem Using Information Theoretic Landscape Measures............ 214
Mario Ventresca, Beatrice Ombuki-Berman, and Andrew Runka
Single Line Train Scheduling with ACO............................. 226
Marc Reimann and Jose Eugenio Leal
Solving Clique Covering in Very Large Sparse Random Graphs by
a Technique Based on k-Fixed Coloring Tabu Search ................. 238
David Chalupa
Solving the Virtual Network Mapping Problem with Construction
Heuristics, Local Search and Variable Neighborhood Descent .......... 250
Johannes Infu¨hr and Gu¨nther R. Raidl
The Generate-and-Solve Framework Revisited: Generating by
Simulated Annealing ............................................. 262
Rommel D. Saraiva, Napolea˜o V. Nepomuceno, and
Pl´acido R. Pinheiro
Author Index.................................................. 275