Skip to main content
SpringerLink
Log in
Book cover

International Conference on Swarm Intelligence

ANTS 2010: Swarm Intelligence pp 576–577Cite as

Soft Variable Fixing in Path Relinking: An Application to ACO Codes

  • Conference paper

  • 2791 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6234))

Abstract

Soft variable fixing has emerged as one of the main techniques that the area of matheuristics can contribute to general metaheuristics. Recent years have in fact witnessed a fruitful interplay of methods that were originally proposed as general metaheuristcs with methods rooted in mathematic programming, which can be applied alone or as hybrids for solving combinatorial optimization problems. In this work, we show how one of the most effective matheuristics techniques, namely soft variable fixing, can be hybridized with Ant Colony Optimization. Specifically, we will combine a standard ACO code with a path relinking operator, implemented by means of soft variable fixing.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Coinmp project page (2010), https://projects.coin-or.org/CoinMP

  2. Berkey, J., Wang, P.: Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38, 423–429 (1987)

    MATH  Google Scholar 

  3. Boschetti, M., Maniezzo, V.: Combining exact methods and heuristics. In: Encyclopedia of Operations Research and Management Science. Wiley, Chichester (2010) (to appear)

    Google Scholar 

  4. Fischetti, M., Lodi, A.: Local branching. Math. Program. B 98, 23–47 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing 11(4), 358–369 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bologna, Bologna, Italy

    Marco A. Boschetti & Vittorio Maniezzo

  2. University of Habana, Habana, Cuba

    Antonio Bolufé Röhler

Authors
  1. Antonio Bolufé Röhler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco A. Boschetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vittorio Maniezzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium

    Marco Dorigo

  2. IRIDIA, CoDE, Université Libre de Bruxelles, Av. F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

    Mauro Birattari

  3. ’Dalla Molle’ Institute for Artificial Intelligence (IDSIA), Galleria 2, 6928, Manno-Lugano, Switzerland

    Gianni A. Di Caro

  4. Complex Systems Institute, Paris-Ile-de-France, CREA, Ecole Polytechnique & CNRS, 57-59, rue Lhomond, 75005, Paris, France

    René Doursat

  5. Department of Computer Science, University of Pretoria, 0002, P.O. Box, Pretoria, South Africa

    Andries P. Engelbrecht

  6. EPFL, Laboratory of Intelligent Systems, Lausanne, Switzerland

    Dario Floreano

  7. Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Lugano, Switzerland

    Luca Maria Gambardella

  8. Department of Automatic Control and Systems Engineering, The University of Sheffield, Mappin Street, S1 3JD, Sheffield, UK

    Roderich Groß

  9. KOVAN Research Lab., Department of Computer Engineering, Middle East Technical University, Inonu Bulvari, 06531, Ankara, Turkey

    Erol Şahin

  10. Department of Bioengineering, Binghamton University, State University of New York, 13902-6000, Binghamton NY, USA

    Hiroki Sayama

  11. IRIDIA, CoDE, Université Libre de Bruxelles, Avenue F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

    Thomas Stützle

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Röhler, A.B., Boschetti, M.A., Maniezzo, V. (2010). Soft Variable Fixing in Path Relinking: An Application to ACO Codes. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15461-4_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15461-4_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15460-7

  • Online ISBN: 978-3-642-15461-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation