Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining Component Caching and Clause Learning for Effective Model Counting. In: SAT (2004)
Balas, E., Saxena, A.: Optimizing over the split closure. Technical Report 2006-E5, Tepper School of Business, CMU (2005)
Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice — closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization: Methods, Theory, and Applications, pp. 19–49. Kluwer Academic Publishers, Dordrecht (2000)
Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Journal Optima 58, 12–15 (1998)
Cook, W., Fukasawa, R., Goycoolea, M.: Choosing the best cuts. In: Workshop on mixed integer programming, MIP (2006)
CPLEX 10.0 Manual, Ilog Inc. (2006)
Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming 102(1), 71–90 (2005)
Dash, S., Günlük, O., Lodi, A.: Separating from the MIR closure of polyhedra. In: Workshop on mixed integer programming, MIP (2006)
Fischetti, M., Lodi, A.: Optimizing over the first Chvàtal closure. In: Jünger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol. 3509, pp. 12–22. Springer, Heidelberg (2005)
Fischetti, M., Lodi, A.: MIP models for MIP separation. In: Workshop on mixed integer programming, MIP (2006)
Glover, F., Løkketangen, A., Woodruff, D.L.: Scatter search to generate diverse MIP solutions. In: Laguna, M., González-Velarde, J.L. (eds.) OR computing tools for modeling, optimization and simulation: interfaces in computer science and operations research, pp. 299–317. Kluwer Academic Publishers, Dordrecht (2000)
Greistorfer, P., Løkketangen, A., Voß, S., Woodruff, D.L.: Experiments concerning sequential versus simultaneous maximization of objective function and distance. Submitted to Journal of Heuristics (2006)
Hoffman, K., Padberg, M.: Improving Representations of Zero-one Linear Programs for Branch-and-Cut. ORSA Journal of Computing 3, 121–134 (1991)
Karamanov, M., Cornuejols, G.: Cutting Planes Selection. In: Workshop on mixed integer programming, MIP (2006)
Lee, S., Phalakornkule, C., Domach, M.M., Grossmann, I.E.: Recursive MILP model for finding all the alternate optima in LP models for metabolic networks. Computers and Chemical Engineering 24, 711–716 (2000)
MIPLIB (2003), http://miplib.zib.de/
Rothberg, E.: It’s a beautiful day in the neighborhood — Local search in mixed integer programming. In: Workshop on mixed integer programming, MIP (2005)
Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. To appear in INFORMS Journal on Computing
Schittekat, P., Sorensen, K.: Coping with unquantifiable criteria by generating structurally different solutions — Applications to a large real-life location-routing problem in the automative industry. In: ISMP (2006)
Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 189–201 (1979)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal of Computing 9, 410–421 (1979)
Wolsey, L.A.: Integer Programming. Wiley, New York (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Danna, E., Fenelon, M., Gu, Z., Wunderling, R. (2007). Generating Multiple Solutions for Mixed Integer Programming Problems. In: Fischetti, M., Williamson, D.P. (eds) Integer Programming and Combinatorial Optimization. IPCO 2007. Lecture Notes in Computer Science, vol 4513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72792-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-72792-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72791-0
Online ISBN: 978-3-540-72792-7
eBook Packages: Computer ScienceComputer Science (R0)