Please use this identifier to cite or link to this item:
|Title:||Understanding complexity in a practical combinatorial problem using mathematical programming and constraint programming|
|Authors:||Maria Antónia Carravilla|
Beatriz Brito Oliveira
|Abstract:||Optimization problems that are motivated by real-world settings are often complex to solve. Bridging the gap between theory and practice in this field starts by understanding the causes of complexity of each problem and measuring its impact in order to make better decisions on approaches and methods. The Job-Shop Scheduling Problem (JSSP) is a well-known complex combinatorial problem with several industrial applications. This problem is used to analyse what makes some instances difficult to solve for a commonly used solution approach – Mathematical Integer Programming (MIP) – and to compare the power of an alternative approach: Constraint Programming (CP). The causes of complexity are analysed and compared for both approaches and a measure of MIP complexity is proposed, based on the concept of load per machine. Also, the impact of problem-specific global constraints in CP modelling is analysed, making proof of the industrial practical interest of commercially available CP models for the JSSP. © Springer International Publishing AG 2018.|
|Appears in Collections:||CEGI - Articles in International Conferences|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.