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

  • Antonio Bolufé Röhler
  • Marco A. Boschetti
  • Vittorio Maniezzo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6234)


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.


  1. 1.
    Coinmp project page (2010),
  2. 2.
    Berkey, J., Wang, P.: Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38, 423–429 (1987)zbMATHGoogle Scholar
  3. 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. 4.
    Fischetti, M., Lodi, A.: Local branching. Math. Program. B 98, 23–47 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing 11(4), 358–369 (1999)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Antonio Bolufé Röhler
    • 2
  • Marco A. Boschetti
    • 1
  • Vittorio Maniezzo
    • 1
  1. 1.University of BolognaBolognaItaly
  2. 2.University of HabanaHabanaCuba

Personalised recommendations