Results 1 - 10 of 11,235

Synthesis of constraint-based local search algorithms from high-level models

by Pascal Van Hentenryck, Laurent Michel - IN: AAAI , 2007
"... The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and slows down scientific progress. This paper addresses this important issue: It shows how effective local search pro-cedur ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and slows down scientific progress. This paper addresses this important issue: It shows how effective local search pro

Synthesis of Constraint-Based Local Search Algorithms from High-Level Models

by unknown authors
"... The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and slows down scientific progress. This paper addresses this important issue: It shows how effective local search procedure ..."
Abstract - Add to MetaCart
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and slows down scientific progress. This paper addresses this important issue: It shows how effective local search

A 3-Phase Randomized Constraint Based Local Search Algorithm for Stowing Under Deck Locations of Container Vessel Bays

by Dario Pacino, Rune Møller Jensen , 2010
"... ..."
Abstract - Add to MetaCart
Abstract not found

Performance analysis of parallel constraint-based local search

by Yves Caniou, Daniel Diaz, Florian Richoux, Salvador Abreu - in PPoPP 2012, 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
"... We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results for hard combinatorial optimization problems on two different platforms up to several hundreds of cores. On a variety of classical CSPs bench-marks, speedups are very good for a ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results for hard combinatorial optimization problems on two different platforms up to several hundreds of cores. On a variety of classical CSPs bench-marks, speedups are very good for a

paris1.fr

by Yves Caniou, Daniel Diaz, Salvador Abreu
"... We present a parallel implementation of a constraint-based local search algorithm and investigate its performance re-sults on hardware with several hundreds of processors. 1. ..."
Abstract - Add to MetaCart
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance re-sults on hardware with several hundreds of processors. 1.

Experiments in parallel constraint-based local search

by Yves Caniou, Daniel Diaz, Salvador Abreu - Evolutionary Computation in Combinatorial Optimization - 11th European Conference, EvoCOP 2011
"... Abstract. We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hard-ware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the ”adaptive search ” method, an efficient sequ ..."
Abstract - Cited by 13 (11 self) - Add to MetaCart
Abstract. We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hard-ware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the ”adaptive search ” method, an efficient

Solving the Agricultural Land Allocation Problem by Constraint-Based Local Search

by Quoc Trung Bui, Quang Dung Pham, Yves Deville
"... Abstract. Agricultural land allocation is a problem that exists in most provinces in Vietnam. Each household owns many disconnected parcels, which reduces agricultural development. The solution to the problem is to repartition this agricu-tural land among the households, while satisfying some criter ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
criteria. Historically, this problem has been approached neither using optimization technology nor com-puter science. The present paper describes the formulation of the problem and proposes a constraint-based local search algorithm for solving it. Experimental results on real data in Dong Trung village

Constraint-Based Local Search for Rail Container Service Planning

by Nakorn Indra-payoong, Raymond S K Kwan, Les Proll , 2003
"... This paper considers a rail container service planning problem, in which customer demands are known in advance. The existing rail service optimisation models are complex and not demand responsive. This paper focuses on constructing profitable schedules, in which service supply matches customer dema ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
demands and optimises on booking preferences whilst satisfying regulatory constraints. The constraint satisfaction approach is used, in which optimisation criteria and operational requirements are formulated as soft and hard constraints respectively. We present a constraint-based local search algorithm

TABU SEARCH

by Fred Glover, Rafael Marti
"... Tabu Search is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore the hallm ..."
Abstract - Cited by 822 (48 self) - Add to MetaCart
Tabu Search is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore

A Constraint-based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem

by Alejandro Arbelaez, Deepak Mehta, Luis Quesada, et al.
"... Many network design problems arising in areas as diverse as VLSI circuit design, QoS routing, traffic engineering, and computational sustainability require clients to be connected to a facility under path-length constraints and budget limits. These problems can be mod-elled as Rooted Distance-Const ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
-disjoint RDCMST (ERDCMST). Previous works on RDCMST have focused on dedicated algorithms which are hard to extend with side constraints, and there-fore these algorithms cannot be extended for solving ERDCMST. We present a constraint-based local search algorithm for which we present two efficient local move
Results 1 - 10 of 11,235