Integer and combinatorial optimization
Integer and combinatorial optimization
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Optimal speedup of Las Vegas algorithms
Information Processing Letters
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Optimization-Oriented Global Constraints
Constraints
A Constraint Programming Framework for Local Search Methods
Journal of Heuristics
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Hybrid Exact Algorithm for the TSPTW
INFORMS Journal on Computing
Exploring relaxation induced neighborhoods to improve MIP solutions
Mathematical Programming: Series A and B
Depth-bounded discrepancy search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Hybrid Metaheuristics: An Emerging Approach to Optimization
Hybrid Metaheuristics: An Emerging Approach to Optimization
The breakout method for escaping from local minima
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Discrepancy-based sliced neighborhood search
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Improved limited discrepancy search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Strong combination of ant colony optimization with constraint programming optimization
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 12.05 |
The integration of tree search and metaheuristic techniques for the solution of combinatorial optimization problems is a research area widely explored in the last decade. We propose a search strategy called Sliced Neighborhood Search, SNS, that iteratively explores slices of large neighborhoods of an incumbent solution by performing constraint programming tree search (along with constraint propagation). SNS encloses concepts from metaheuristic techniques. SNS can be used both as a stand alone search strategy, and embedded in other strategies as intensification and diversification mechanism. We provide an extensive experimental evaluation of SNS on hard instances of the Asymmetric Traveling Salesman Problem with Time Windows. We show the effectiveness of SNS as a stand alone strategy when compared to Limited Discrepancy Search and of SNS when included in a heuristic framework such as the constraint programming based local branching.