Evolutionary Computation in Combinatorial Optimization: 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011. Proceedings

273 Pages·2011·5.494 MB·English

by  Sadaf Naseem Jat, Shengxiang Yang (auth.), Peter Merz, Jin-Kao Hao (eds.)

Lecture Notes in Computer Science 6622
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
Peter Merz Jin-Kao Hao (Eds.)
Evolutionary
Computation
in Combinatorial
Optimization
11th European Conference, EvoCOP 2011
Torino, Italy, April 27-29, 2011
Proceedings
1 3
VolumeEditors
PeterMerz
UniversityofAppliedSciencesandArts
DepartmentofBusinessAdministrationandComputerScience
RicklingerStadtweg120,30459Hannover,Germany
E-mail:[email protected]
Jin-KaoHao
UniversityofAngers,FacultyofSciences
2,BoulevardLavoisier,49045AngersCedex01,France
E-mail:[email protected]
Coverillustration:
"Globosphere"byMiguelNicolauandDanCostelloe(2010),
UniversityofDublin,Ireland
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-20363-3 e-ISBN978-3-642-20364-0
DOI10.1007/978-3-642-20364-0
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2011924397
CRSubjectClassification(1998):F.1,C.2,H.4,I.5,I.4,F.2
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©Springer-VerlagBerlinHeidelberg2011
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,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
Metaheuristicscontinuetodemonstratetheireffectivenessforanever-broadening
range of difficult combinatorial optimization problems appearing in a wide va-
riety of industrial, economic, and scientific domains. Prominent examples of
metaheuristics are evolutionary algorithms, tabu search, simulated annealing,
scattersearch,memetic algorithms,variableneighborhoodsearch,iteratedlocal
search, greedy randomized adaptive search procedures, ant colony optimization
and estimation of distribution algorithms. Problems solved successfully include
scheduling,timetabling,networkdesign,transportationanddistribution,vehicle
routing,the travelling salesmanproblem, packing and cutting, satisfiability and
general mixed integer programming.
EvoCOPbegan in 2001 and has been held annually since then. It is the first
event specifically dedicated to the application of evolutionary computation and
methods related to combinatorial optimization problems. Originally held as a
workshop,EvoCOPbecameaconferencein2004.Theeventsgaveresearchersan
excellent opportunity to present their latest research and to discuss current de-
velopments and applications. Following the general trend of hybrid metaheuris-
tics and diminishing boundaries between the different classes of metaheuristics,
EvoCOPhasbroadeneditsscopeinrecentyearsandinvitedsubmissionsonany
kind of metaheuristic for combinatorialoptimization.
This volume contains the proceedings of EvoCOP 2011, the 11th European
ConferenceonEvolutionaryComputationinCombinatorialOptimization.Itwas
held in Torino, Italy, during April 27–29, 2011, jointly with EuroGP 2011, the
14th European Conference on Genetic Programming, EvoBIO 2011, the 9th
European Conference on Evolutionary Computation, Machine Learning and
Data Mining in Bioinformatics, and EvoApplications 2011 (formerly EvoWork-
shops), which consisted of the following 12 individual events: 8th European
Event on the Application of Nature-Inspired Techniques for Telecommunica-
tion Networks and Other Parallel and Distributed Systems (EvoCOMNET),
Second European Event on Evolutionary Algorithms and Complex Systems
(EvoCOMPLEX),5th EuropeanEventon Evolutionaryand NaturalComputa-
tioninFinanceandEconomics(EvoFIN),ThirdEuropeanEventonBio-inspired
AlgorithmsinGames(EvoGAMES),6thEuropeanEventonBio-InspiredHeuris-
tics for Design Automation (EvoHOT), 13th European Event on Evolution-
ary Computation in Image Analysis and Signal Processing (EvoIASP), Second
European Event on Nature-Inspired Methods for Intelligent Systems (EvoIN-
TELLIGENCE),9thEuropeanEventonEvolutionaryandBiologicallyInspired
Music, Sound, Art and Design (EvoMUSART), 4th European Event on Bio-
inspired algorithms for Continuous Parameter Optimization (EvoNUM), 6th
European Event on Nature-inspired Techniques in Scheduling, Planning and
Timetabling (EvoSTIM), 8th European Event on Evolutionary Algorithms in
VI Preface
StochasticandDynamicEnvironments(EvoSTOC),and5thEuropeanEventon
Evolutionary Computation in Transportation and Logistics (EvoTRANSLOG).
Since 2007,allthese events aregrouped under the collectivename EvoStar,and
constitute Europe’s premier co-located meetings on evolutionary computation.
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). Below we report statistics for
each conference:
EvoCOP Submitted Accepted Acceptance ratio
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%
The rigorous, double-blind reviewing process of EvoCOP 2011 resulted in
the selection of 22 out of 42 submitted papers; the acceptance rate was 52.4%.
The number of submissions was considerably lower compared to the previous
event. The submission numbers dropped for most other events of EvoStar, too.
However, the same quality level as that of EvoCop 2010 could be maintained
by carefully selecting the papers for the event. Each paper was reviewed by at
least three members of the international Program Committee. All accepted pa-
perswerepresentedorallyattheconferenceandareincludedinthisproceedings
volume.WewouldliketoacknowledgethemembersofourProgramCommittee:
we are very grateful for their thorough work. EvoCOP 2011 contributions con-
sist of new algorithms together with important new insights into how well these
algorithms can solve prominent test problems from the literature or real-world
problems.We wouldlike toexpressoursinceregratitudeto the twointernation-
ally renownedinvited speakers,who gavekeynote talks at the conference:Craig
ReynoldsfromSonyComputerEntertainment,USAandJean-PierreChangeux,
neuroscientist and professor emeritus from the Pasteur Institute, France.
Thesuccessoftheconferenceresultedfromtheinputofmanypeopletowhom
wewouldliketoexpressourappreciation.Fristofall,weliketothankthe Local
Chair of EvoStar 2011, Mario Giacobini from the University of Torino. He and
his team did an extraordinary job for which we are very grateful. We thank
Marc Schoenauer from INRIA in France for his support with the MyReview
conference management system. We thank Penousal Machado of the University
of Coimbrafor an excellentwebsite and publicity material.Thanks are also due
toJenniferWilliesandtheCentreforEmergentComputingatNapierUniversity
in Edinburgh, Scotland, for administrative support and event coordination. We
Preface VII
gratefully acknowledge sponsorship from the Human Genetics Foundation of
Torino (HuGeF) as well as the University of Torino.
Last,butnotleast,wewouldliketothankCarlosCotta,PeterCowling,Jens
Gottlieb, Jano van Hemert, and Gu¨nther Raidl for their hard work and dedica-
tion in past editions of EvoCOP, which contributed to making this conference
one of the reference events in evolutionary computation and metaheuristics.
April 2011 Peter Merz
Jin-Kao Hao
Organization
EvoCOP 2011 was organized jointly with EuroGP 2011, EvoBIO 2011, and
EvoApplications 2011.
Organizing Committee
Chairs Peter Merz, University of Applied Sciences and
Arts, Hannover, Germany
Jin-Kao Hao, University of Angers,
Angers, France
Local Chair Mario Giacobini, University of Torino, Italy
Publicity Chair Penousal Machado, University of Coimbra,
Portugal
EvoCOP Steering Committee
Carlos Cotta Universidad de Ma´laga, Spain
Peter Cowling University of Bradford, 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 Middle East Technical University, Ankara,
Turkey
Herna´n Aguirre Shinshu University, Nagano, Japan
Enrique Alba Universidad de Ma´laga, Spain
Mehmet Emin Aydin University of Bedfordshire, UK
Thomas Bartz-Beielstein Cologne University of Applied Sciences,
Germany
Maria Blesa Universitat Polit`ecnica de Catalunya, Spain
Christian Blum Universitat Polit`ecnica de Catalunya, Spain
Rafael Caballero University of Ma´laga, Spain
Pedro Castillo Universidad de Granada, Spain
Carlos Coello Coello National Polytechnic Institute, Mexico
Carlos Cotta Universidad de Ma´laga, Spain
Peter Cowling University of Bradford, UK
X Organization
Keshav Dahal University of Bradford, UK
Karl Doerner Universita¨t Wien, Austria
Benjamin Doerr Max-Planck-Institut fu¨r Informatik, Germany
Jeroen Eggermont Leiden University Medical Center,
The Netherlands
Richard F. Hartl University of Vienna, Austria
Antonio J. Ferna´ndez Universidad de Ma´laga, 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
Juhos Istva´n University of Szeged, Hungary
Graham Kendall University of Nottingham, UK
Joshua Knowles University of Manchester, UK
Mario Ko¨ppen Kyushu Institute of Technology, Japan
Jozef Kratica University of Belgrade, Serbia
Rhyd Lewis Cardiff University, UK
Arne Løkketangen Molde College, Norway
Jos´e Antonio Lozano University of the Basque Country, Spain
Dirk C. Mattfeld University of Braunschweig,Germany
Juan Julia´n Merelo University of Granada, Spain
Peter Merz University of Applied Sciences and Arts,
Hannover, Germany
Martin Middendorf Universita¨t Leipzig, Germany
Julian Molina University of Ma´laga, Spain
Jose Marcos Moreno University of La Laguna, Spain
Christine L. Mumford Cardiff University, UK
Yuichi Nagata Tokyo Institute of Technology, Japan
Volker Nissen Technical University of Ilmenau, Germany
Francisco J.B. Pereira Universidade de Coimbra, Portugal
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
Franz Rothlauf University of Mainz, Germany
Michael Sampels Universit´e Libre de Bruxelles, Belgium
Marc Schoenauer INRIA, France
Patrick Siarry Universit´e Paris-EstCr´eteil Val-de-Marne,
France
Jim Smith University of the West of England, UK
Christine Solnon University Lyon 1, France
Organization XI
Giovanni Squillero Politecnico di Torino, Italy
Thomas Stu¨tzle Universit´e Libre de Bruxelles, Belgium
El-ghazaliTalbi Universit´e des Sciences et Technologies de Lille,
France
Kay Chen Tan National University of Singapore, Singapore
Jorge Tavares MIT, USA
Jano van Hemert University of Edinburgh, UK
Jean-PaulWatson Sandia National Laboratories,USA
Fatos Xhafa Universitat Politecnica de Catalunya, Spain
Takeshi Yamada NTT Communication Science Laboratories,
Kyoto
Table of Contents
A Guided Search Non-dominated Sorting Genetic Algorithm for the
Multi-Objective University Course Timetabling Problem.............. 1
Sadaf Naseem Jat and Shengxiang Yang
A Hybrid Dual-Population Genetic Algorithm for the Single Machine
Maximum Lateness Problem ...................................... 14
Veronique Sels and Mario Vanhoucke
A Kolmogorov-TypeStability Measure for Evolutionary Algorithms .... 26
Matthew J. Craven and Henri C. Jimbo
AMatheuristicApproachfortheTotalCompletionTimeTwo-Machines
Permutation Flow Shop Problem................................... 38
Federico Della Croce, Andrea Grosso, and Fabio Salassa
Connectedness and Local Search for Bicriteria Knapsack Problems ..... 48
Arnaud Liefooghe, Lu´ıs Paquete, Marco Simo˜es, and Jos´e R. Figueira
Cutting GraphsUsingCompetingAntColoniesandanEdgeClustering
Heuristic........................................................ 60
Max Hinne and Elena Marchiori
Effective Variable Fixing and Scoring Strategies for Binary Quadratic
Programming.................................................... 72
Yang Wang, Zhipeng Lu¨, Fred Glover, and Jin-Kao Hao
Evolutionary Multiobjective Route Planning in Dynamic Multi-hop
Ridesharing ..................................................... 84
Wesam Herbawi and Michael Weber
Experiments in ParallelConstraint-BasedLocal Search ............... 96
Yves Caniou, Philippe Codognet, Daniel Diaz, and Salvador Abreu
Fitness-Probability Cloud and a Measure of Problem Hardness for
Evolutionary Algorithms.......................................... 108
Guanzhou Lu, Jinlong Li, and Xin Yao
Frequency Distribution Based Hyper-Heuristic for the Bin-Packing
Problem ........................................................ 118
He Jiang, Shuyan Zhang, Jifeng Xuan, and Youxi Wu