LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS

Eric Monfroy, Frédéric Saubion, Broderick Crawford, Carlos Castro

Abstract

Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, . . . ). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.

References

  1. Aarts, E. and Lenstra, J. K., editors (1997). Local Search in Combinatorial Optimization. John Wiley & Sons, Inc., New York, NY, USA.
  2. Apt, K. R. (1997). From chaotic iteration to constraint propagation. In Degano, P., Gorrieri, R., and MarchettiSpaccamela, A., editors, ICALP, volume 1256 of Lecture Notes in Computer Science, pages 36-55. Springer.
  3. Apt, K. R. (2003). Principles of Constraint Programming. Cambridge Univ. Press.
  4. Focacci, F., Laburthe, F., and Lodi, A., editors (2002). Local Search and Constraint Programming. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research and Management Science. Kluwer Academic Publishers, Norwell, MA.
  5. Glover, F. and Laguna, F. (1997). Tabu Search. Kluwer Academic Publishers, Norwell, MA, USA.
  6. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
  7. Jaumard, B., Stan, M., and Desrosiers, J. (1996). Tabu search and a quadratic relaxation for the satisfiability problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 26:457-478.
  8. Jussien, N. and Lhomme, O. (2002). Local search with constraint propagation and conflict-based heuristics. Artif. Intell., 139(1):21-45.
  9. Monfroy, E., Saubion, F., Crawford, B., and Castro, C. (2008). Towards a formalization of combinatorial local search. In Proceedings of the International MultiConference of Engineers and Computer Scientists, IMECS, March 19-21, 2008, Hong Kong, China, Lecture Notes in Engineering and Computer Science. Newswood Limited.
  10. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press, London.
Download


Paper Citation


in Harvard Style

Monfroy E., Saubion F., Crawford B. and Castro C. (2008). LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS . In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8111-37-1, pages 431-434. DOI: 10.5220/0001681804310434


in Bibtex Style

@conference{iceis08,
author={Eric Monfroy and Frédéric Saubion and Broderick Crawford and Carlos Castro},
title={LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2008},
pages={431-434},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001681804310434},
isbn={978-989-8111-37-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS
SN - 978-989-8111-37-1
AU - Monfroy E.
AU - Saubion F.
AU - Crawford B.
AU - Castro C.
PY - 2008
SP - 431
EP - 434
DO - 10.5220/0001681804310434