A Lagrangian reconstruction of GENET

@article{Choi2000ALR,
  title={A Lagrangian reconstruction of GENET},
  author={Kenneth M. F. Choi and Jimmy Ho-man Lee and Peter James Stuckey},
  journal={Artif. Intell.},
  year={2000},
  volume={123},
  pages={1-39}
}
Abstract GENET is a heuristic repair algorithm which demonstrates impressive efficiency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this paper, we draw a surprising connection between GENET and discrete Lagrange multiplier methods. Based on the work of Wah and Shang, we propose a discrete Lagrangian-based search scheme LSDL , defining a class of search algorithms for solving CSPs. We show how GENET can be reconstructed from LSDL . The dual… Expand
Progressive stochastic search for solving constraint satisfaction problems
  • Bryan Chi-ho Lam, H. Leung
  • Computer Science
  • Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence
  • 2003
TLDR
The progressive stochastic search (PSS) and its variants for solving binary CSPs, in which a variable always has to choose a new value when it is designated to be repaired, is proposed and significantly outperforms LSDL(GENET) in quasigroup completion problems and increasing permutation generation problems. Expand
ENHANCING GASAT BY USING THE DISCRETE LAGRANGE-MULTIPLIER ALGORITHM
The satisfiability problem (SAT), as one of the six basic core NP-complete problems, has been the deserving object of many studies in the last two decades [3, 2]. GASAT [4, 3, 2] is one of theExpand
Improving GASAT by replacing tabu search by DLM and enhancing the best members
  • Y. Kilani
  • Computer Science
  • Artificial Intelligence Review
  • 2009
TLDR
DGASAT is improved by replacing the tabu search by the discrete lagrange-multiplier algorithm, and it is shown that the performance of the new algorithm, DGASAT, is far better than theperformance of GASAT in solving most of the benchmark instances. Expand
Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems
  • Y. Kilani
  • Mathematics, Computer Science
  • Appl. Soft Comput.
  • 2010
TLDR
It is shown that the performance of the local search-based algorithms: DLM and ESG is better than theperformance of the genetic- based algorithms: GASAT and SAT-WAGA. Expand
Applying GENET to the JSSCSOP
TLDR
The experimental results show that the performance of the method gets competitive when the domain of each variable is not big, even if the size of the problem instances increases. Expand
The island confinement method for reducing search space in local search methods
TLDR
The island confinement method can be incorporated in, and significantly improve, the search performance of two successful local search procedures, DLM and ESG, on SAT problems arising from binary CSPs. Expand
A Local Search Framework for Semiring-Based Constraint Satisfaction Problems
TLDR
This paper presents an efficient local search framework for SCSPs, which adopts problem transformation and soft constraint consistency techniques, and E-GENET local search model as a foundation, resulting in a family of algorithms for various kinds of soft constraint problems. Expand
Reducing search space in local search for constraint satisfaction
TLDR
It is shown in this paper how, for DIMACS translations of binary CSPs, treating some constraints as hard can significantly improve search performance of the DLM local search method. Expand
Using constraints to break value symmetries in constraint satisfaction problems
Many real life problems can naturally be modeled as constraint satisfaction problems (CSPs), which can sometimes contain both variable symmetries and value symmetries. Tree search based CSP solvingExpand
Guided Local Search
Combinatorial explosion is a well-known phenomenon that prevents complete algorithms from solving many real-life combinatorial optimization problems. In many situations, heuristic search methods areExpand
...
1
2
...

References

SHOWING 1-10 OF 53 REFERENCES
A Lagrangian reconstruction of a class of local search methods
TLDR
benchmarking results confirm that the reconstructed GENET has the same fast convergence behavior as other GENET implementations reported in the literature, competing favourably with other state-of-the-art methods on a set of hard graph colouring problems. Expand
A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems
TLDR
This paper derives new approaches for applying Lagrangian methods in discrete space, shows that an equilibrium is reached when a feasible assignment to the original problem is found and presents heuristic algorithms to look for equilibrium points, and proposes a new discrete Lagrange-multiplier-based global-search method (DLM) for solving satisfiability problems. Expand
IMPROVING GENET AND EGENET BY NEW VARIABLE ORDERING STRATEGIES
TLDR
This work compared the efficiency of their improved versions using the conventional or new variable ordering strategies against the original GENET and EGENET on a number of randomly generated and hard instances of binary CSPs. Expand
Solving Linear Pseudo-Boolean Constraint Problems with Local Search
TLDR
It is shown that domain-independent local search for satisfiability (Walksat) can be generalized to handle systems of linear pseudo-Boolean (0-1 integer) constraints, a representation that is widely used in operations research. Expand
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
TLDR
This paper proposes a global search phase in which an aperiodic and bounded trace function is added to the search to first identify promising regions for local search, using a trace to aid in identifying promising regions before committing to local searches. Expand
Towards a More Efficient Stochastic Constraint Solver
TLDR
Modification of E-GENET to overcome the problem of storing too many penalty values in constraint nodes and the min-conflicts heuristic is not efficient enough on some problems and to improve the performance, several modifications are proposed. Expand
An Empirical Study of Greedy Local Search for Satisfiability Testing
TLDR
This paper describes the space traversed by GSAT, and discusses two general, domain-independent extensions that dramatically improve GSAT's performance on structured problems: the use of clause weights, and a way to average in near-solutions when initializing lhe procedure before each try. Expand
Lagrangian techniques for solving a class of zero-one integer linear programs
  • Yao-Jen Chang, B. Wah
  • Mathematics, Computer Science
  • Proceedings Nineteenth Annual International Computer Software and Applications Conference (COMPSAC'95)
  • 1995
TLDR
This work proposes a Lagrangian formulation in the continuous space and develops a gradient search in this space, and shows that 0-1 ILPF problems of reasonable sizes can be solved by an order of magnitude faster than existing methods. Expand
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
TLDR
Although GENET has been designed to be implemented on VLSI hardware, empirical evidence is presented to show that even when simulated on a single processor GENET can outperform existing iterative improvement techniques on hard instances of certain constraint satisfaction problems. Expand
Extending GENET with lazy arc consistency
TLDR
A consistency technique, lazy arc consistency, which is suitable for use within GENET and can improve the efficiency of the GENET search on some instances of binary CSPs, and does not suffer the overhead of full arc consistency. Expand
...
1
2
3
4
5
...