Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Annals of Operations Research - Special issue on Tabu search
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Constraint Programming and Operations Research: Comments from an Operations Researcher
Journal of Heuristics
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
Journal of Heuristics
Yet Another Local Search Method for Constraint Solving
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Meta-heuristics: The State of the Art
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Local Probing Applied to Scheduling
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A unified framework for partial and hybrid search methods in constraint programming
Computers and Operations Research
On-line resources allocation for ATM networks with rerouting
Computers and Operations Research
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
A framework for constructing complete algorithms based on local search
AI Communications - Constraint Programming for Planning and Scheduling
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
Hybrid algorithms in constraint programming
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
New model and heuristics for safety stock placement in general acyclic supply chain networks
Computers and Operations Research
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Expert Systems with Applications: An International Journal
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Engineering Applications of Artificial Intelligence
Bounding, filtering and diversification in CP-based local branching
Journal of Heuristics
Hybrid metaheuristics in combinatorial optimization: a tutorial
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
| Hi-index | 0.00 |
We propose in this paper a novel integration of local search algorithms within a constraint programming framework for combinatorial optimization problems, in an attempt to gain both the efficiency of local search methods and the flexibility of constraint programming while maintaining a clear separation between the constraints of the problem and the actual search procedure. Each neighborhood exploration is performed by branch-and-bound search, whose potential pruning capabilities open the door to more elaborate local moves, which could lead to even better approximate results. Two illustrations of this framework are provided, including computational results for the traveling salesman problem with time windows. These results indicate that it is one order of magnitude faster than the customary constraint programming approach to local search and that it is competitive with a specialized local search algorithm.