Generating Multiple Solutions for Mixed Integer Programming Problems

摘要

As mixed integer programming (MIP) problems become easier to solve in pratice, they are used in a growing number of applications where producing a unique optimal solution is often not enough to answer the underlying business problem. Examples include problems where some optimization criteria or some constraints are difficult to model, or where multiple solutions are wanted for quick solution repair in case of data changes. In this paper, we address the problem of effectively generating multiple solutions for the same model, concentrating on optimal and near-optimal solutions. We first define the problem formally, study its complexity, and present three different algorithms to solve it. The main algorithm we introduce, the one-tree algorithm, is a modification of the standard branch-and-bound algorithm. Our second algorithm is based on MIP heuristics. The third algorithm generalizes a previous approach that generates solutions sequentially. We then show with extensive computational experiments that the one-tree algorithm significantly outperforms previously known algorithms in terms of the speed to generate multiple solutions, while providing an acceptable level of diversity in the solutions produced.