Bounding, filtering and diversification in CP-based local branching

Journal of Heuristics

Volumn 18, Issue 3, 2012, Pages 353-374

  Kiziltan, Zeynep ^a   Lodi, Andrea ^a   Milano, Michela ^a   Parisini, Fabio ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Additive bounding; Constraint Programming; Cost based filtering; Diversification; Local search; Traveling Salesman Problem with Time Windows

Indexed keywords

ASYMMETRIC TRAVELING SALESMAN PROBLEM; CONSTRAINT PROGRAMMING; COST-BASED FILTERING ALGORITHMS; DIVERSIFICATION; DIVERSIFICATION STRATEGIES; EXPERIMENTAL EVALUATION; GENERAL PURPOSE; HARD INSTANCES; LOCAL BRANCHING; LOCAL SEARCH; MIXED-INTEGER PROGRAMMING; SEARCH TREES; TIME WINDOWS; TREE SEARCH;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING;

TRAVELING SALESMAN PROBLEM;

EID: 84862233300     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-011-9190-2     Document Type: Article

References (27)

1. Ascheuer, N.: Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD thesis, Technische Universität Berlin (1995)
2. Baldacci, R., Mingozzi, A., Roberti, R.: New state space relaxations for solving the traveling salesman problem with time windows. Technical Report University of Bologna (2010)
3. Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling. Kluwer Academic, Dordrecht (2001)
4. J.C. Beck 2007 Solution-guided multi-point constructive search for job shop scheduling J. Artif. Intell. Res. 29 49 77 1182.68058 (Pubitemid 47477589)
5. E. Danna E. Rothberg C. Le Pape 2004 Exploring relaxation induced neighborhoods to improve mip solutions Math. Program. 102 71 90 10.1007/s10107-004-0518-7 (Pubitemid 40134692)
6. Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. In: Network Routing, pp. 35-139 (1995)
7. M. Fischetti A. Lodi 2003 Local branching Math. Program. 98 23 47 2019366 1060.90056 10.1007/s10107-003-0395-5
8. M. Fischetti P. Toth 1989 An additive bounding procedure for combinatorial optimization problems Oper. Res. 37 319 328 990611 0676.90049 10.1287/opre.37.2.319
9. F. Focacci A. Lodi M. Milano 2002 Optimization-oriented global constraints Constraints 7 351 365 1943654 1028.68024 10.1023/A:1020589922418 (Pubitemid 35393798)
10. F. Focacci A. Lodi M. Milano 2002 A hybrid exact algorithm for the TSPTW INFORMS J. Comput. 14 403 417 1946298 10.1287/ijoc.14.4.403.2827
11. Harvey, W., Ginsberg, M.L.: Limited discrepancy search. In: Proc. of IJCAI-95, pp. 607-615. Morgan Kaufmann, San Mateo (1995)
12. Hebrard, E., Hnich, B., O'Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: Proc. of AAAI-05, pp. 372-377. AAAI Press/The MIT Press, Cambridge (2005) (Pubitemid 43006804)
13. Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: CPAIOR, pp. 186-202 (2010)
14. Kiziltan, Z., Lodi, A., Milano, M., Parisini, F.: CP-based local branching. In: Proc. of CP-07. LNCS, vol. 4741, pp. 847-855. Springer, Berlin (2007)
15. S. Lin B.W. Kernighan 1973 An effective heuristic algorithm for the traveling-salesman problem Oper. Res. 21 498 516 359742 0256.90038 10.1287/opre.21.2.498
16. Lodi, A., Milano, M., Rousseau, L.M.: Discrepancy based additive bounding for the all different constraint. In: Proc. of CP-03. LNCS, vol. 2833, pp. 510-524. Springer, Berlin (2003)
17. Milano, M.: Constraint and Integer Programming: Toward a Unified Methodology. Kluwer Academic, Dordrecht (2003). Chap. 9.
18. S. Minton M.D. Johnston A.B. Philips P. Laird 1992 Minimising conflicts: a heuristic repair method for constraint satisfaction and scheduling problems Artif. Intell. 58 161 205 1192398 0782.90054 10.1016/0004-3702(92)90007-K
19. N. Mladenovic P. Hansen 1997 Variable neighbourhood search Comput. Oper. Res. 24 1097 1100 1471346 0889.90119 10.1016/S0305-0548(97)00031-2
20. G. Pesant M. Gendreau 1999 A constraint programming framework for local search methods J. Heuristics 5 255 279 1064.90577 10.1023/A:1009694016861 (Pubitemid 30505844)
21. J.C. Regin 2002 Cost-based arc consistency for global cardinality constraints Constraints 7 3-4 387 405 1943656 1028.68157 10.1023/A:1020506526052 (Pubitemid 35393800)
22. E. Rothberg 2007 An evolutionary algorithm for polishing mixed integer programming solutions INFORMS J. Comput. 19 534 541 10.1287/ijoc.1060.0189
23. Sellman, M., Harvey, W.: Heuristic constraint propagation-using local search for incomplete pruning and domain filtering of redundant constraints for the social golfer problem. In: Proc. of CP-AI-OR, pp. 191-204 (2002)
24. M. Sellmann T. Fahle 2003 Constraint programming based Lagrangian relaxation for the automatic recording problem Ann. Oper. Res. 118 17 33 1967979 1026.90510 10.1023/A:1021845304798
25. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Proc. of CP-98. LNCS, vol. 1520, pp. 417-431. Springer, Berlin (1998) (Pubitemid 128151602)
26. Shaw, P.: Constraint programming and local search hybrids. In: Milano, M., van Hentenryck, P. (eds.) Hybrid Optimization: The Ten Years of CPAIOR, pp. 271-304. Springer, Berlin (2011)
27. van Hentenryck, P., Michel, L.: Constraint-based Local Search. MIT Press, Cambridge (2005)