Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming

Volumn 102, Issue 1, 2005, Pages 71-90

  Danna, Emilie ^a,b   Rothberg, Edward ^c   Pape, Claude Le ^a  

^a IBM   (United States)

^b UNIVERSITY OF AVIGNON   (France)

^c ILOG Inc   (United States)

Author keywords

Heuristics; Hybrid algorithms; Local search; Mixed integer programming

Indexed keywords

HEURISTICS; HYBRID ALGORITHMS; LOCAL SEARCH; MIXED INTEGER PROGRAMMING;

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

INTEGER PROGRAMMING;

EID: 12344255882     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0518-7     Document Type: Article

References (35)

1. Aboudi, R., Jörnsten, K.: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic. ORSA J. Comput. 6(1), 82-93 (1994)
2. Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job-Shop Scheduling. Manage. Sci. 34 (3), 391-401 (1988)
3. Anbil, R., Gelman, E., Patty, B., Tanga, R.: Recent advances in crew-pairing optimization at American Airlines. Interfaces 21, 62-74 (1991)
4. Applegate, D., Cook, W.: A Computational Study of the Job-Shop Scheduling Problem. ORSA J. Comput. 3(2), 149-156 (1991)
5. Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: A New Heuristic for Pure 0-1 Programs. Oper. Res. 49 (2), 207-225 (2001)
6. Balas, E., Martin, C.: Pivot and Complement - A Heuristic for 0-1 Programming. Manage. Sci. 26 (1), 86-96 (1980)
7. Baptiste, P., Le Pape, C., Nuijten, W.: Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling. In: Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research, 1995
8. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0 Optima 58, 12-15 (1998)
9. Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice - closing the gap. Kluwer Academic Publishers, 2000, pp. 19-49
10. Caseau, Y., Laburthe, F.: Disjunctive Scheduling with Task Intervals. Technical report, École Normale Supérieure, 1995
11. Caseau, Y., Laburthe, F.: SaLSA Specification language for search algorithms. Technical report, École Normale Supérieure, LIENS-97-11, 1997
12. Chabrier, A., Danna, E., Le Pape, C., Perron, L.: Solving a Network Design Problem. To appear in Annals of Operations Research, Special Issue following CP-AI-OR'2002, 2004
13. Danna, E.: Intégration des techniques de recherche locale à la programmation linéaire en nombres entiers (in French). PhD thesis, Université d'Avignon, 2004
14. Danna, E., Le Pape, C.: Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. Technical Report, ILOG, 03-006, 2003
15. Danna, E., Le Pape, C.: Two generic schemes for efficient and robust cooperative algorithms. Constraint and integer programming, Michela Milano (ed.), Kluwer Academic Publishers, 2003, pp. 33-57
16. Faaland, B.H., Hillier, F.S.: Interior path methods for heuristic integer programming procedures. Oper. Res. 27 (6), 1069-1087 (1979)
17. Fischetti, M., Lodi, A.: Local Branching. Math. Program. Ser. B 98, 23-47 (2003)
18. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, 1997
19. Glover, F., Laguna, M., Martí, F.: Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics 29 (3), 653-684 (2000)
20. Glover, F., Løkketangen, A., Woodruff, D.L.: Scatter Search to Generate Diverse MIP Solutions. In: M. Laguna, J.L. González-Velarde, (eds.), OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer Academic Publishers, 2000, pp. 299-317
21. Hillier, F.S.: Efficient heuristic procedures for integer linear programming with an interior. Oper. Res. 17 (4), 600-637 (1969)
22. Ibaraki, T., Ohashi, T., Mine, H.: A heuristic algorithm for mixed-integer programming problems. Math. Program. Study 2, 115-136 (1974)
23. Junker, U., Nuijten, W.: Preference-based Search for Minimizing Changes in Rescheduling Problems. In: IJCAI-99 Workshop on scheduling and planning meet real-time: Monitoring in a dynamic and uncertain world, 1999, pp. 39-45
24. Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139, 21-45 (2002)
25. Le Pape, C., Baptiste, P.: Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem. J. Heuristics 5 (3), 305-325 (1999)
26. Løkketangen, A., Woodruff, D.L.: Integrating Pivot Based Search with Branch and Bound for Binary MIP's. Control and Cybernetics, Special issue on Tabu Search 29 (3), 741-760 (2001)
27. Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling. Artificial Intelligence 58, 161-205 (1992)
28. Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, 1996
29. Nediak, M., Eckstein, J.: Pivot, cut and dive: A Heuristic for 0-1 Mixed Integer Programming. Technical Report, Rutgers Center for Operations Research, RRR 53-2001, 2001
30. Palpant, M., Artigues, C., Michelon, P.: A heuristic for solving the frequency assignment problem. In: XI Latin-Iberian American Congress of Operations Research (CLAIO), 2002
31. Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP'98), 1998, pp. 417-431
32. Van Hentenryck, P., Le Provost, T.: Incremental Search in Constraint Logic Programming. New Generation Comput. 9 (3), 257-275 (1991)
33. Van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated Annealing: Theory and Practice. Kluwer Academic Publishers, 1987
34. Van Vyve, M.: A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. PhD thesis, Université catholique de Louvain-la-Neuve, 2003
35. Vásquez, M., Whitley, L.D.: A comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), 2000, pp. 1011-1018