Treffer: Reduce and assign: A Constraint Logic Programming and Local Search integration framework to solve Combinatorial Search problems

Title:
Reduce and assign: A Constraint Logic Programming and Local Search integration framework to solve Combinatorial Search problems
Authors:
GOMES, Nuno, VALE, Zita, RAMOS, Carlos
Source:
CP 2003 : principles and practice of constraint programming (Kinsale, 29 September - 3 October 2003)Lecture notes in computer science. :847-852
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Programmation mathématique, Mathematical programming, Algorithme recherche, Search algorithm, Algoritmo búsqueda, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Optimisation sous contrainte, Constrained optimization, Optimización con restricción, Problème combinatoire, Combinatorial problem, Problema combinatorio, Problème recherche, Search problem, Problema investigación, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation mathématique, Mathematical programming, Programación matemática, Recherche locale, Local search
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
GECAD - Knowledge Engineering and Decision Support Research Group, Polytechnic Institute of Porto / Institute of Engineering, Portugal
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15715653
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.15715653
Database:
PASCAL Archive

Weitere Informationen

Since the early 90's that Constraint Logic Programming (CLP) has been used to solve Combinatorial Search Problems. Generally, CLP has a good performance with highly constrained problems, but it lacks a global perspective of the search space, making the search for the optimal solution more difficult when the problems becomes larger and less constrained. On the other hand, Local Search Methods explore the search space directly through an intelligent construction of solution neighbourhoods, turning these methods suitable for solving less constrained and large search spaces problems. The aim of this paper is to present a hybridisation framework that allows combining Local Search methods with Constraint Logic Programming. The first results demonstrate that while maintaining the CLP strengths it is possible to overcome their weaknesses and improve its search efficiency.