arrow drop search cross

How to solve your problem with Constraint Programming

Seminar run by Prof. Jean Charles Régin (Nice Sophia Antipolis University, I3S Laboratory)


23/05/2019   :   10h00
Salle des Séminaires MSI, 1361 Route des Lucioles, 06560 Valbonne, France
 Speaker: Prof. Jean-Charles Regin (Nice Sophia Antipolis University, I3S Laboratory)
Publication : 23/05/2019
Partager cet article :

Speaker: Jean-Charles Regin (Nice Sophia Antipolis University, I3S Laboratory)

Abstract: Constraint programming (CP) is a general and powerful method for solving some combinatorial problems. This method has been successfully used to solve a large range of real-life applications (rostering, time-tabling, car manufacturing, scheduling etc.), which can be quite different. CP is on the borderline of Artificial Intelligence (AI) and Operational Research (OR). CP inherits from AI the language aspect (that is the easy way to define a problem), the flexibility (that is the fact that problems can be easily modified) and the possibility to benefit from the knowledge of the application domain to improve the resolution of a problem. Operational Research brings to CP a lot of nice and powerful algorithms, which gives to CP the computational aspect needed to solve some real world problems. After studying the resolution of real world problem in general, we will introduce the general principles of CP and show how it can be used for solving industrial problem. We will compare CP to several other approaches (like MIP, Greedy Algorithm, Local Search etc.) and explain how all these methods are often combined thanks to CP in order to solve real world applications. In other words, we will show that CP can also be viewed as a framework that may integrate any other resolution method. We will discuss about its strength and its weakness. We will consider the requests coming from the industry and their specificities and we will see how CP can answer to them. We will also investigate some recent needs about parallelism and cloud computing and present some results.