Improving CP-based local branching via sliced neighborhood search

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2011, Pages 887-892

  Parisini, Fabio ^a   Milano, Michela ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

constraint programming; LDS; local branching; local search; optimization

Indexed keywords

CONSTRAINT PROGRAMMING; CP-TREE; DIVERSIFICATION STRATEGIES; LARGE NEIGHBORHOOD; LDS; LOCAL BRANCHING; LOCAL SEARCH; NEIGHBORHOOD SEARCH; REFERENCE SOLUTION; SEARCH STRATEGIES; TIME WINDOWS; TRAVELLING SALESMAN PROBLEM;

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

TRAVELING SALESMAN PROBLEM;

EID: 79959324088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1982185.1982380     Document Type: Conference Paper

References (16)

1. N. Ascheuer. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD thesis, Technische Universität Berlin, 1995.
2. E. Danna, E. Rothberg, and C. L. Pape. Exploring relaxation induced neighborhoods to improve mip solutions. Mathematical Programming, 102(1):71-90, 2004.
3. J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis. Time constrained routing and scheduling. In Network Routing, pages 35-139, 1995.
4. M. Fischetti and A. Lodi. Local branching. Mathematical Programming, 98:23-47, 2003.
5. F. Focacci, A. Lodi, and M. Milano. A hybrid exact algorithm for the tsptw. Informs Journal on Computing, 14(4):403-417, 2002.
6. F. Focacci, A. Lodi, and M. Milano. Optimization-oriented global constraints. Constraints, 7:351-365, 2002. (Pubitemid 35393798)
7. W. Harvey and M. Ginsberg. Limited discrepancy search. In Proc. of IJCAI-95, pages 607-615. Morgan Kaufmann, 1995.
8. Z. Kiziltan, A. Lodi, M. Milano, and F. Parisini. Cp-based local branching. Proc. of CP-07, LNCS, 4741:847-855, 2007.
9. Z. Kiziltan, A. Lodi, M. Milano, and F. Parisini. Bounding, filtering and diversification in cp-based local branching. Submitted for publication, 2010.
10. M. Luby, A. Sinclair, and D. Zuckerman. Optimal speedup of las vegas algorithms. Information Processing Letters, 47:173-180, 1993.
11. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Minimising conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1):161-205, 1992.
12. F. Parisini, M. Lombardi, and M. Milano. Discrepancy-based sliced neighborhood search. In AIMSA, pages 91-100, 2010.
13. M. Sellman and W. Harvey. 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, pages 191-204, 2002.
14. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. Proc. of CP-98, LNCS, 1520:417-431, 1998.
15. P. Shaw. Integration of ls and tree search. In M. Milano and P. van Hentenryck, editors, Hybrid Optimization. Springer, 2010.
16. P. van Hentenryck and L. Michel. Constraint-based Local Search. MIT Press, 2005.