An improved tabu search method for the weighted constraint satisfaction problem

INFOR

Volumn 39, Issue 2, 2001, Pages 131-151

  Nonobe, K ^a   Ibaraki, T ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Combinatorial optimization problem; General problem solver; Scheduling; Tabu search; Weighted constraint satisfaction problem

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

WEIGHTED CONSTRAINT SATISFACTION PROBLEMS (WCSP);

CONSTRAINT THEORY;

EID: 0035334825     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.2001.11732431     Document Type: Article

References (34)

1. A dynamic subgradient-based branch-and-bound procedure for set covering
2. A genetic algorithm for the set covering problem
3. Semiring-based CSPs and valued CSPs: Basic properties and comparison
4. Constraint hierarchies
5. Anytime lower bounds for constraint violation minimization problems
6. A heuristic method for the set covering problem
7. A genetic algorithm for the generalised assignment problem
8. Constraint handling in genetic algorithms: The set partitioning problem
9. Partial constraint satisfaction
10. Tabu search for maximal constraint satisfaction problems
11. A tabu search heuristic for the vehicle routing problem
12. Lagrangian relaxation for integer programming
13. Tabu search - Part I
14. Tabu search - Part II
15. Empirical studies of heuristic local search for constraint solving
16. Validation of subgradient optimization
17. Tabu search for the multilevel generalized assignment problem
18. A new approach for weighted constraint satisfaction: Theoretical and computational results
19. Probabilistic move selection in tabu search for zero-one mixed integer programming problems
20. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
21. Database queries as combinatorial optimization problems
22. A mathematical programming approach to a tightly constrained scheduling problem
23. The breakout method for escaping from local minima
24. A tabu search approach to the constraint satisfaction problem as a general problem solver
25. An integrated formulation of manufacturing cell formation with capacity planning and multiple routings
26. Domain-independent extension to GSAT: Solving large structured satisfiability problems
27. Process selection and tool assignment in automated cellular manufacturing using Genetic Algorithms
28. Heuristic methods for over-constrained constraint satisfaction problems
29. Analysis of heuristic methods for partial constraint satisfaction problems