LocalSolver 1.x: A black-box local-search solver for 0-1 programming. This paper introduces LocalSolver 1.x, a black-box local-search solver for general 0-1 programming. This software allows OR practitioners to focus on the modeling of the problem using a simple formalism, and then to defer its actual resolution to a solver based on efficient and reliable local-search techniques. Started in 2007, the goal of the LocalSolver project is to offer a model-and-run approach to combinatorial optimization problems which are out of reach of existing black-box tree-search solvers (integer or constraint programming). Having outlined the modeling formalism and the main technical features behind LocalSolver, its effectiveness is demonstrated through an extensive computational study. The version 1.1 of LocalSolver can be freely downloaded at url{http://www.localsolver.com} and used for educational, research, or commercial purposes.

References in zbMATH (referenced in 16 articles , 1 standard article )

Showing results 1 to 16 of 16.
Sorted by year (citations)

  1. Björdal, Gustav; Flener, Pierre; Pearson, Justin: Generating compound moves in local search by hybridisation with complete search (2019)
  2. Napoletano, Antonio; Martínez-Gavara, Anna; Festa, Paola; Pastore, Tommaso; Martí, Rafael: Heuristics for the constrained incremental graph drawing problem (2019)
  3. Schewe, Lars; Schmidt, Martin: Computing feasible points for binary MINLPs with MPECs (2019)
  4. da Costa Vieira Rezende, Josiane; Souza, Marcone Jamilson Freitas; Coelho, Vitor Nazário; Martins, Alexandre Xavier: HMS: a hybrid multi-start algorithm for solving binary linear programs (2018)
  5. Adamo, Tommaso; Ghiani, Gianpaolo; Grieco, Antonio; Guerriero, Emanuela; Manni, Emanuele: MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (2017)
  6. Haraguchi, Kazuya: An efficient local search for the constrained symmetric Latin square construction problem (2017)
  7. Lombardi, Michele; Milano, Michela; Bartolini, Andrea: Empirical decision model learning (2017)
  8. Umetani, Shunji: Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (2017)
  9. Haraguchi, Kazuya: Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (2016)
  10. Björdal, Gustav; Monette, Jean-Noël; Flener, Pierre; Pearson, Justin: A constraint-based local search backend for MiniZinc (2015)
  11. Caniou, Yves; Codognet, Philippe; Richoux, Florian; Diaz, Daniel; Abreu, Salvador: Large-scale parallelism for constraint-based local search: the costas array case study (2015)
  12. Haraguchi, Kazuya: An efficient local search for partial Latin square extension problem (2015)
  13. Humeau, J.; Liefooghe, A.; Talbi, E.-G.; Verel, S.: ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (2013)
  14. Jost, V.; Savourey, D.: A 0-1 integer linear programming approach to schedule outages of nuclear power plants (2013)
  15. Benoist, Thierry; Estellon, Bertrand; Gardi, Frédéric; Megel, Romain; Nouioua, Karim: LocalSolver 1.x: A black-box local-search solver for 0-1 programming (2011)
  16. Benoist, Thierry: Characterization and automation of matching-based neighborhoods (2010)