Yet Another Local Search Method for Constraint Solving

AAAI Fall Symposium - Technical Report

Volumn FS-01-04, Issue , 2001, Pages 38-46

  Codognet, Philippe ^a   Diaz, Daniel ^b  

^a SORBONNE UNIVERSITÉ   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; COST FUNCTIONS; PROBLEM SOLVING; TABU SEARCH;

ADAPTIVE MEMORY; ADAPTIVE SEARCH; CONSTRAINT SOLVING; CONSTRAINT-SATISFACTION PROBLEMS; COST-FUNCTION; DOMAIN INDEPENDENTS; LOCAL LOOPS; LOCAL MINIMUMS; LOCAL SEARCH METHOD; NON LINEAR;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84873551385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. E. Aarts and J. Lenstra (Eds). Local Search in Combinatorial Optimization. Wiley, 1997.
2. A. Borning, B. Freeman-Benson and M. Wilson. Constraint Hierarchies. Lisp and Symbolic Computation, vol. 5 no. 3, 1992, pp 223-230.
3. P. Codoguet and D. Diaz. Compiling Constraint in clp(FD). Journal of Logic Programming, Vol. 27, No. 3, June 1996.
4. A. Davenport, E. Tsang, Z. Kangmin and C. Wang. GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement. In proc. AAAI94, AAAIPress, 1994.
5. D. Diaz and P. Codognet. The implementation of GNUProlog. In proe. SAC’O0, 15th ACMSymposium on Applied Computing. Como, Italy, ACM Press 2000.
6. F. Glover and M. Laguna. Tabu Search, Kluwer AcademicPublishers, 1997.
7. P. Gaiinier and J-K. Hao. A General Approach for Constraint Solving by Local Search. draft, 2001.
8. J-K. Hao, P. Gaiinier and M. Habib. Metaheuristiques pour l’optimisation combinatoire et l’affectation sous contraintes. Revue d’Intelligence ArtificieUe, vol.2 no. 13, 1999, pp 283-324.
9. W. Harvey and M. Ginsberg. Limited Discrepancy Search. In proc. IJCAI’95, 11th International Joint Conference on Artificial Intelligence, Montreal, Canada, 1995.
10. S. Lin. Computersolutions of the traveling salesmanproblem. Bell System Technical Journal, vol. 44 (1965), pp 2245-2269.
11. S. Lin and B. Kerninghan. Aneffective heuristic algorithm for the traveling-saiesman problem. Operations Research, vol. 21 (1973), pp 498-516.
12. Z. Michalewiczand D. Fogel. Howto solve it: Modern Heuristics, Springer Verlag 2000.
13. L. Michel and P. Van Hentenryck. Localizer: a modelinglanguage for local search. In proc. CP’97, 3rd International Conference on Principles and Practice of Constraint Programming, Linz, Austria, Springer Verlag 1997.
14. L. Michel and P. Van Hentenryek. Loeaiizer. Constraints, vol. 5 no. l&2, 2000.
15. S. Minton, M. Johnston, A. Philips and P. Laird. Minimizingconflicts: a heuristic repair methodfor constraint satisfaction and scheduling problems. Artificial Intelligence, vol. 58, 1992, pp 161-205.
16. K. Nonobeand T. Ibarald. A tabu search approach to the constraint satisfaction problemas a general problem solver. European Journal of Operational Research, vol. 106, 1998, pp 599-623.
17. G. Pesant and M. Gendreau. A Constraint Programming Framework for Local Search Methods. Journal of Heuristics, vol. 5 no. 3, 1999, pp 255-279.
18. J-F. Puget. A C++ implementation of CLP. In proc. SPICIS’94, Singapore, 1994.
19. V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, G. D. Smith. Modern Heuristic Search Methods. Wiley, 1996.
20. V. Saraswat, P. VanHentenryck et ai. Constraint Programming, A CMComputing Surveys, vol. 28 no. 4, December1996.
21. B. Selman, H. Levesque and D. Mitchell. A new methodfor solving hard satisfiability problems. In proc. AAAI’9, AAAIPress 1992.
22. B. Selman, H. Kautz and B. Cohen. Noise strategies for improving local search. In proc. AAAI’94, AAAI Press 1994.
23. C. Solnon.Solvingpermutation problemsby ant colonyoptimization. Inproe.ECAI’$O00, Berlin, Germany,Wiley,2000.
24. C. "Pruchet, C. AgonandG. Assayag.Recherche Adaptative et Contraintes Musicales. In proc.JF-PLC-O01,Journes b’t’ancophones de Programmation Logique et Programmationpar Contraintes, P. Codognet (Ed.), Hermes, 2001.
25. J.P. Walser. Integer Optimization by Local Search : A Domain-Independent Approach, LNAI 1637, Springer Verlag 1999.