Advertisement

Neighborhood Synthesis from an Ensemble of MIP and CP Models

  • Tommaso Adamo
  • Tobia Calogiuri
  • Gianpaolo Ghiani
  • Antonio Grieco
  • Emanuela Guerriero
  • Emanuele ManniEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10079)

Abstract

In this paper we describe a procedure that automatically synthesizes a neighborhood from an ensemble of Mixed Integer Programming (MIP) and/or Constraint Programming (CP) models. We move on from a recent paper by Adamo et al. (2015) in which a neighborhood structure is automatically designed from a (single) MIP model through a three-step approach: (1) a semantic feature extraction from the MIP model; (2) the derivation of neighborhood design mechanisms based on these features; (3) an automatic configuration phase to find the “proper mix” of such mechanisms taking into account the instance distribution. Here, we extend the previous work in order to generate a suitable neighborhood from an ensemble of MIP and/or CP models of a given combinatorial optimization problem. Computational results show relevant improvements over the approach considering a single model.

Keywords

Combinatorial optimization Neighborhood search Automatic neighborhood design Feature extraction 

References

  1. Adamo, T., Ghiani, G., Grieco, A., Guerriero, E., Manni, E.: MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration. Comput. Oper. Res. (2015, submitted). http://www.emanuelemanni.unisalento.it/Sito/Papers/MIPneighSynth.pdf
  2. Cordeau, J.-F., Laporte, G., Savelsbergh, M.W., Vigo, D.: Vehicle routing. In: Barnhart C., Laporte, G. (eds.) Transportation. Handbook in OR & MS, vol. 14, pp. 367–428 (2006)Google Scholar
  3. Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Prog. Ser. A 102, 71–90 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. Fischetti, M., Lodi, A.: Local branching. Math. Prog. Ser. B. 98, 23–47 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  5. Fischetti, M., Salazar-González, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45, 378–394 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  6. Ghiani, G., Laporte, G., Manni, E.: Model-based automatic neighborhood design by unsupervised learning. Comput. Oper. Res. 54, 108–116 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  7. Hutter, F., Hoos, H., H., Stützle, T.: Automatic algorithm configuration based on local search. In: Proceedings of AAAI-07, vol. 22, pp. 1152–1157 (2007)Google Scholar
  8. Mouthuy, S., Van Hentenryck, P., Deville, Y.: Constraint-based very large-scale neighborhood search. Constraints 17, 87–122 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  9. Parisini, F., Milano, M.: Sliced neighborhood search. Expert Syst. Appl. 39, 5739–5747 (2012)CrossRefGoogle Scholar
  10. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Tommaso Adamo
    • 1
  • Tobia Calogiuri
    • 1
  • Gianpaolo Ghiani
    • 1
  • Antonio Grieco
    • 1
  • Emanuela Guerriero
    • 1
  • Emanuele Manni
    • 1
    Email author
  1. 1.Dipartimento di Ingegneria Dell’InnovazioneUniversità del SalentoLecceItaly

Personalised recommendations