Abstract
Many combinatorial optimization problems can be formulated as the search for the best possible permutation of a given set of objects, according to a given objective function. The corresponding MIP formulation is thus typically made of an assignment substructure, plus additional constraints and variables (as needed) to express the objective function. Unfortunately, the permutation structure is generally lost when the model is flattened as a mixed integer program, and state-of-the-art MIP solvers do not take full advantage of it. In the present paper we propose a heuristic procedure to detect permutation problems from their MIP formulation, and show how we can take advantage of this knowledge to speed up the solution process. Computational results on quadratic assignment and single machine scheduling problems show that the technique, when embedded in a state-of-the-art MIP solver, can indeed improve performance.
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
Gent, I.P., Petrie, K.E., Puget, J.F.: Symmetry in constraint programming. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 329–376. Elsevier (2006)
Achterberg, T., Raack, C.: The MCF-separator: detecting and exploiting multi-commodity flow structures in MIPs. Mathematical Programming Computation 2(2), 125–165 (2010)
Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation 1(1), 1–41 (2009)
Fischetti, M., Monaci, M., Salvagnin, D.: Three ideas for the quadratic assignment problem. Operations Research 60(4), 954–964 (2012)
Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: Framework and applications. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, vol. 57, pp. 321–353. Kluwer Academic Publishers (2002)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Černý, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications 45(1), 41–51 (1985)
Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and its Variations, pp. 369–443 (2002)
Stützle, T.: Iterated local search for the quadratic assignment problem. European Journal of Operational Research 174(3), 1519–1539 (2006)
Congram, R.K., Potts, C.N., van de Velde, S.L.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14(1), 52–67 (2002)
Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)
Burkard, R., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM (2009)
Adams, W., Johnson, T.: Improved linear programming-based lower bounds for the quadratic assignment problem. In: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 43–75. American Mathematical Society (1994)
Kaufman, L., Broeckx, F.: An algorithm for the quadratic assignment problem using Benders’ decomposition. European Journal of Operational Research 2, 204–211 (1978)
Xia, Y., Yuan, Y.: A new linearization method for quadratic assignment problem. Optimization Methods and Software 21, 803–816 (2006)
Gilmore, P.: Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM Journal on Applied Mathematics 14, 305–313 (1962)
Lawler, E.: The quadratic assignment problem. Management Science 9, 586–599 (1963)
Burkard, R., Karisch, S., Rendl, F.: QAPLIB – A quadratic assignment problem library. European Journal of Operational Research 55, 115–119 (1991)
Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. Wiley (2009)
Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Keha, A.B., Khowala, K., Fowler, J.W.: Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering 56(1), 357–367 (2009)
Beasley, J.E.: OR-library: distributing test problems by electronic mail (1990)
Hentenryck, P.V., Carillon, J.P.: Generality versus specificity: an experience with AI and OR techniques. In: AAAI 1988 (1988)
IBM ILOG: CPLEX 12.5.1 User’s Manual (2013)
Berthold, T.: Measuring the impact of primal heuristics. Operations Research Letters 41, 611–614 (2013)
Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universität Berlin (2007)
Achterberg, T., Wunderling, R.: Mixed integer programming: Analyzing 12 years of progress. In: Facets of Combinatorial Optimization, pp. 449–481 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Salvagnin, D. (2014). Detecting and Exploiting Permutation Structures in MIPs. In: Simonis, H. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2014. Lecture Notes in Computer Science, vol 8451. Springer, Cham. https://doi.org/10.1007/978-3-319-07046-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-07046-9_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07045-2
Online ISBN: 978-3-319-07046-9
eBook Packages: Computer ScienceComputer Science (R0)