Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
5752
Thomas Stützle Mauro Birattari Holger H. Hoos (Eds.)
Engineering Stochastic Local Search Algorithms Designing, Implementing and Analyzing Effective Heuristics Second International Workshop, SLS 2009 Brussels, Belgium, September 3-4, 2009 Proceedings
13
Volume Editors Thomas Stützle Mauro Birattari Université Libre de Bruxelles IRIDIA, CoDE Avenue F. Roosevelt 50, CP 194/6, 1050 Brussels, Belgium E-mail: {stuetzle,mbiro}@ulb.ac.be Holger H. Hoos University of British Columbia Computer Science Department 2366 Main Mall, Vancouver, BC, V6T 1Z4, Canada E-mail:
[email protected]
Library of Congress Control Number: 2009932137 CR Subject Classification (1998): E.5, E.2, F.2, I.1.2, I.2.8, F.2.2, H.3.3 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues ISSN ISBN-10 ISBN-13
0302-9743 3-642-03750-X Springer Berlin Heidelberg New York 978-3-642-03750-4 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. springer.com © Springer-Verlag Berlin Heidelberg 2009 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12741809 06/3180 543210
Preface
Stochastic local search (SLS) algorithms are established tools for the solution of computationally hard problems arising in computer science, business administration, engineering, biology, and various other disciplines. To a large extent, their success is due to their conceptual simplicity, br