A tabu search approach to the constraint satisfaction problem as a general problem solver

European Journal of Operational Research

Volumn 106, Issue 2-3, 1998, Pages 599-623

  Nonobe, Koji ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Combinatorial problems; Constraint satisfaction problem (CSP); General problem solver; Meta heuristics; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; CRITICAL PATH ANALYSIS; FUNCTIONS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINT SATISFACTION PROBLEM (CSP); META HEURISTICS; TABU SEARCH METHODS;

COMBINATORIAL MATHEMATICS;

EID: 0032045813     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00294-4     Document Type: Article

References (31)

1. D. Avis, A note on some computationally difficult set covering problems, Mathematical Programming 18 (1980) 138-145.
2. E. Balas, A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming 12 (1980) 37-60.
3. R. Battiti, G. Tecchiolli, The reactive tabu search, ORSA Journal on Computing 6 (1994) 126-140.
4. J.E. Beasley, An algorithm for set covering problem, European Journal of Operational Research 31 (1987) 85-93.
5. D.G. Cattrysse, L.N. Van Wassenhove, A survey of algorithms for the generalized assignment problem, European Journal of Operational Research 60 (1992) 260-272.
6. D.G. Cattrysse, M. Salomon, L.N. Van Wassenhove, A set partitioning heuristic for the generalized assignment problem, European Journal of Operational Research 72 (1994) 167-174.
7. P.C. Chu, J.E. Beasley, A genetic algorithm for the generalised assignment problem, Working paper, The Management School, Imperial College, 1995.
8. D. Costa, A tabu search algorithm for computing an operational timetable, European Journal of Operational Research 76 (1994) 98-110.
9. R. Decher, J. Pearl, Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence 34 (1988) 1-38.
10. T.A. Feo, K. Venkatraman, J.F. Bard, A GRASP for a difficult single machine scheduling problem. Computers and Operations Research 18 (1991) 635-643.
11. C. Fleurent, J.A. Ferland, Genetic and hybrid algorithms for graph coloring, in: G. Laporte, I.H. Osman, P.L. Hammer (Eds.), Metaheuristics in Combinatorial Optimization, Annals of Operations Research (1996).
12. E.C. Freuder, A sufficient condition for backtrack-free search. Journal of the Association for computing Machinery 29 (1982) 24-32.
13. E.C. Freuder, Complexity of K-tree structured constraint satisfaction problems, Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI), 1990, pp. 4-9.
14. D.R. Fulkerson, G.L. Nemhauser, L.E. Trotter, Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems, Mathematical Programming Study 2 (1974) 72-81.
15. F. Glover, Tabu search - Part I, ORSA Journal on Computing 1 (1989) 190-206.
16. F. Glover, Tabu search fundamentals and uses, Technical Report, University of Colorado, 1995.
17. J. Gu, Local search for satisfiability (SAT) problem, IEEE Transactions on Systems, Man, and Cybernetics 23 (1993) 1108-1129.
18. A. Hertz, Tabu search for large scale timetabling problems, European Journal of Operational Research 54 (1991) 39-47.
19. A. Ikegami, A. Niwa, M. Ohkura, Nurse scheduling problem in Japan, Communications of the Operations Research Society of Japan 41 (1996) 436-442 in Japanese.
20. M. Laguna, T.A, Feo, H.C. Elrod, A greedy randomized adaptive search procedure for the two-partition problem, Operations Research 42 (1994) 677-687.
21. A. Løkketangen, F. Glover, Probabilistic move selection in tabu search for zero-one mixed integer programming problems, in: I.H. Osman, J.P. Kelly (Eds.), Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Boston, Ch. 28, 1996, pp. 467-487.
22. L.A.N. Lorena, F. Belo Lopes, A surrogate heuristic for set covering problems, European Journal of Operational Research 79 (1994) 138-150.
23. C. Mannino, A. Sassano, Solving hard set covering problems, Operations Research Letters 18 (1995) 1-5.
24. S. Minton, M.D. Johnston, A.B. Philips, P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58 (1992) 166-205.
25. S. Miyazaki, K. Iwama, Y. Kambayashi, Database queries as combinatorial optimization problems, Proceedings of International Symposium on Cooperative Database Systems for Advanced Applications, 1996, pp. 448-454.
26. I.H. Osman, Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches, OR Spektrum 17 (1995) 211-225.
27. S.U. Randhawa, D. Sitompul, A heuristic-based computerized nurse scheduling system, Computers and Operations Research 20 (1993) 837-844.
28. A. Schaerf, Tabu search techniques for large high-school timetabling problems, Proceedings of the thirteenth National Conference on Artificial Intelligence (AAAI) and the eighth Innovate Applications of Artificial Intelligence (IAAI), 1996, pp. 363-368.
29. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI), 1992, pp. 440-446.
30. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, London, 1993.
31. M. Yoshikawa, K. Kaneko, T. Yamanouchi, M. Watanabe, A constraint-based high school scheduling system, IEEE Expert 11 (1996) 63-72.