Improving CP-based local branching via sliced neighborhood search

Authors:
Fabio Parisini;Michela Milano
Affiliations:
University of Bologna, Italy;University of Bologna, Italy
Venue:
Proceedings of the 2011 ACM Symposium on Applied Computing
Year:
2011

Citing 10
Cited 1

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
Optimization-Oriented Global Constraints

Constraints
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
Constraint-Based Local Search

Constraint-Based Local Search
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
CP-based local branching

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Discrepancy-based sliced neighborhood search

AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications

Improved bounds for hybrid flow shop scheduling with multiprocessor tasks

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we merge two problem independent search strategies, namely Local Branching and Sliced Neighborhood Search. They both integrate CP tree search with local search concepts, but while local branching is very effective in exploring small neighborhoods, its performances decrease when dealing with diversification and large neighborhood exploration. On the other hand Sliced Neighborhood Search is an effective method for exploring random slices of large neighborhoods and in moving away arbitrarily far from an incumbent solution. For this reason we obtain very good results in improving a reference solution: Local Branching obtains a 35% improvement when SNS is integrated aggressively both in the neighborhood exploration and in the diversification strategy. The tests were conducted on large instances of the Travelling Salesman Problem with Time Windows.