New variable neighbourhood search based 0-1 MIP heuristics

Yugoslav Journal of Operations Research

Volumn 24, Issue 2, 2014, Pages 343-360

  Hanafi, Saïd ^a,b   Lazić, Jasmina ^c   Mladenović, Nenad ^d   Wilbaut, Christophe ^a,b   Crévits, Igor ^a,b  

^a UNIV LILLE   (France)

^b LAMIH   (France)

^c BRUNEL UNIVERSITY   (United Kingdom)

^d University of Valenicannes   (France)

Author keywords

0 1 Mixed Integer Programming; Convergence; Matheuristics; Pseudo cuts; Variable Neighbourhood Search

Indexed keywords

EID: 84903591973     PISSN: 03540243     EISSN: 23346043     Source Type: Journal    
DOI: 10.2298/YJOR140219014H     Document Type: Article

References (27)

1. Ahuja, R., Ergun, Ö., Orlin, J., and Punnen, A. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 1-3 (2002), 75-102.
2. Ashford, R. Mixed integer programming: A historical perspective with Xpress-MP. Annals of Operations Research 149, 1 (2007), 5-17.
3. Danna, E., Rothberg, E., and Le Pape, C. Exploring relaxation induced neighborhoods to improve mip solutions. Mathematical Programming 102, 1 (2005), 71-90.
4. Fischetti, M., and Lodi, A. Local branching. Mathematical Programming 98, 2 (2003), 23-47.
5. FortMP Manual Release 3. Numerical algorithms group limited, 1999.
6. Garey, M., and Johnson, D. Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman San Francisco, 1979.
7. Glover, F. Adaptive memory projection methods for integer programming. In Metaheuristic OptimizationVia Memory and Evolution, C. Rego and B. Alidaee, Eds. Kluwer Academic Publishers, 2005, pp. 425-440.
8. Glover, F. Parametric Tabu Search for Mixed Integer Programs. Computers and Operations Research 33 (2006), 2449-2494.
9. Glover, F., and Hanafi, S. Metaheuristic search with inequalities and target objectives for mixed binary optimization part i: Exploiting proximity. International Journal of Applied Metaheuristic Computing 1 (2010), 1-15.
10. Glover, F., and Hanafi, S. Metaheuristic search with inequalities and target objectives for mixed binary optimization part ii: Exploiting reaction and resistance. International Journal of Applied Metaheuristic Computing 2 (2010), 1-17.
11. Glover, F., L. L., Plummer, J., Duarte, A., Marti, R., Laguna, M., and Rego, C. Pseudo-cut strategies for global optimization. International Journal of Applied Metaheuristic Computing 2 (2011), 1-12.
12. Gurobi Optimization Inc. Gurobi optimizer reference manual, version 2.0, 2009.
13. Hanafi, S., and Wilbaut, C. Heuristiques convergentes basées sur des relaxations. Presented at ROADEF 2006, Lille (february), 2006.
14. Hanafi, S., and Wilbaut, C. Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Annals of Operations Research 183, 1 (2011), 125-142.
15. Hansen, P., Mladenović, N., and Perez-Britos, D. Variable Neighborhood Decomposition Search. Journal of Heuristics 7, 4 (2001), 335-350.
16. Hansen, P., Mladenović, N., and Urošević, D. Variable neighborhood search and local branching. Computers & Operations Research 33, 10 (2006), 3034-3045.
17. ILOG. Cplex 11.2. user's manual, 2008.
18. Lasdon, L., Duarte, A., Glover, F., Laguna, M., and Marti, R. Adaptive memory programming for constrained global optimization. Computers & OperationsResearch 37 (2010), 1500-1509.
19. Laundy, R., Perregaard, M., Tavares, G., Tipi, H., and Vazacopoulos, A. Solving hard mixed integer programming problems with xpress-mp: A miplib 2003 case study. Tech. Rep. RRR 2-2007, Rutcor Research Report, January 2007.
20. Lazić, J., Hanafi, S., Mladenović, N., and Urošević, D. Variable neighbourhood decomposition search for 0-1 mixed integer programs. Computers and Operations Research 37, 6 (2010), 1055-1067.
21. Lingo Systems Inc. Optimization modeling with lingo, 6th edition, 2006.
22. Maniezzo, V., Stutzle, T., and Voss, S., Eds. Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, vol. 10 of Annals of Information Systems. Springer, 2009.
23. Mladenović, N., and Hansen, P. Variable neighborhood search. Computers & Operations Research 24, 11 (1997), 1097-1100.
24. Shaw, P. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. Lecture Notes in Computer Science (1998), 417-431.
25. Soyster, A., Lev, B., and Slivka, W. Zero-One Programming with Many Variables and Few Constraints. European Journal of Operational Research 2, 3 (1978), 195-201.
26. Wilbaut, C., and Hanafi, S. New convergent heuristics for 0-1 mixed integer programming. European Journal of Operational Research 195 (2009), 62-74.
27. Wilbaut, C., Hanafi, S., Fréville, A., and Balev, S. Tabu search: global intensification using dynamic programming. Control and Cybernetics 35, 3 (2006), 579-598.