Alternating criteria search: A parallel large neighborhood search algorithm for mixed integer programs

Lluís Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Yufen Shao

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


We present a parallel large neighborhood search framework for finding high quality primal solutions for general mixed-integer programs (MIPs). The approach simultaneously solves a large number of sub-MIPs with the dual objective of reducing infeasibility and optimizing with respect to the original objective. Both goals are achieved by solving restricted versions of two auxiliary MIPs, where subsets of the variables are fixed. In contrast to prior approaches, ours does not require a feasible starting solution. We leverage parallelism to perform multiple searches simultaneously, with the objective of increasing the effectiveness of our heuristic. We computationally compare the proposed framework with a state-of-the-art MIP solver in terms of solution quality, scalability, reproducibility, and parallel efficiency. Results show the efficacy of our approach in finding high quality solutions quickly both as a standalone primal heuristic and when used in conjunction with an exact algorithm.

Original languageEnglish (US)
Pages (from-to)1-24
Number of pages24
JournalComputational Optimization and Applications
Issue number1
StatePublished - Jan 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics


  • LNS
  • MIPs
  • Parallel algorithms
  • Primal heuristics


Dive into the research topics of 'Alternating criteria search: A parallel large neighborhood search algorithm for mixed integer programs'. Together they form a unique fingerprint.

Cite this