{"type":"ScholarlyArticle","title":"Learning Sensitivity of RCPSP by Analyzing the Search Process","authors":[{"name":"Marc-André Ménard","slug":"marc-andre-menard","given":"Marc-André","family":"Ménard","affiliation":"Université Laval , Québec , Canada"},{"name":"Claude-Guy Quimper","slug":"claude-guy-quimper","given":"Claude-Guy","family":"Quimper","affiliation":"Université Laval , Québec , Canada"},{"name":"Jonathan Gaudreault","slug":"jonathan-gaudreault","given":"Jonathan","family":"Gaudreault","affiliation":"Université Laval , Québec , Canada"}],"abstract":"Solving the problem is an important part of optimization. An equally important part is the analysis of the solution where several questions can arise. For a scheduling problem, is it possible to obtain a better solution by increasing the capacity of a resource? What happens to the objective value if we start a specific task earlier? Answering such questions is important to provide explanations and increase the acceptability of a solution. A lot of research has been done on sensitivity analysis, but few techniques can be applied to constraint programming. We present a new method for sensitivity analysis applied to constraint programming. It collects information, during the search, about the propagation of the CUMULATIVE constraint, the filtering of the variables, and the solution returned by the solver. Using machine learning algorithms, we predict if increasing/decreasing the capacity of the cumulative resource allows a better solution. We also predict the impact on the objective value of forcing a task to finish earlier. We experimentally validate our method with the RCPSP problem.","doi":"10.24963/ijcai.2020/162","url":"https://ijcai.org/proceedings/2020/162","pdf":"https://ijcai.org/proceedings/2020/0162.pdf","markdown":"https://ijcai.org/proceedings/2020/162.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/162","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Constraints and SAT","track":"Main track","number":162,"pages":{"first":1163,"last":1169},"keywords":["Planning and Scheduling: Scheduling","Constraints and SAT: Constraint Optimization","Constraints and SAT: Constraints and Data Mining ; Constraints and Machine Learning"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24393/file_24393.m3u8","length_sec":291,"provider":"hls"}],"references":[{"position":1,"raw":"[Aggoun and Beldiceanu, 1993] Abderrahmane Aggoun and Nicolas Beldiceanu. Extending chip in order to solve com- plex scheduling and placement problems. Mathematical and Computer Modelling, 17(7):57 -73, 1993.","title":"Abderrahmane Aggoun and Nicolas Beldiceanu. Extending chip in order to solve complex scheduling and placement problems","authors":"Beldiceanu Aggoun","year":"1993","venue":"Mathematical and Computer Modelling","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baptiste and Pape, 2000] Philippe Baptiste and Claude Le Pape. Constraint propagation and decomposition tech- niques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1):119-139, Jan 2000.","title":"Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems","authors":"Pape Baptiste, Philippe Baptiste, Claude Le Pape","year":"2000","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Beldiceanu and Carlsson, 2002] Nicolas Beldiceanu and Mats Carlsson. A new multi-resource cumulatives con- straint with negative heights. In Pascal Van Hentenryck, editor, Principles and Practice of Constraint Program- ming -CP 2002, pages 63-79, Berlin, Heidelberg, 2002. Springer Berlin Heidelberg.","title":"Nicolas Beldiceanu and Mats Carlsson. A new multi-resource cumulatives constraint with negative heights","authors":"Carlsson Beldiceanu","year":"2002","venue":"Principles and Practice of Constraint Programming -CP 2002","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Carlier and Néron, 2003] Jacques Carlier and Emmanuel Néron. On linear lower bounds for the resource con- strained project scheduling problem. European Journal of Operational Research, 149(2):314-324, 2003.","title":"On linear lower bounds for the resource constrained project scheduling problem","authors":"Néron Carlier, Jacques Carlier, Emmanuel Néron","year":"2003","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chu, 2011] Geoffrey Chu. Improving combinatorial opti- mization. PhD thesis, Department of Computing and In- formation Systems, University of Melbourne, 2011.","title":"Improving combinatorial optimization","authors":"Geoffrey Chu","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dantzig, 1963] George B. Dantzig. Linear programming and extensions. Princeton University Press, 1963.","title":"Linear programming and extensions","authors":"George B Dantzig","year":"1963","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dawande and Hooker, 2000] Milind Dawande and John N. Hooker. Inference-based sensitivity analysis for mixed integer/linear programming. Operations Research, 48(4):623-634, 2000.","title":"Inference-based sensitivity analysis for mixed integer/linear programming","authors":"Milind Dawande, John N Hooker","year":"2000","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Geoffrion and Nauss, 1977] Arthur M. Geoffrion and Robert Nauss. Exceptional paper-parametric and postoptimality analysis in integer linear programming. Management Science, 23(5):453-466, 1977.","title":"Exceptional paper-parametric and postoptimality analysis in integer linear programming","authors":"Arthur M Geoffrion, Robert Nauss","year":"1977","venue":"Management Science","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Greenberg, 1998] Harvey J. Greenberg. An Annotated Bib- liography for Post-Solution Analysis in Mixed Integer Pro- gramming and Combinatorial Optimization, pages 97- 147. Springer US, Boston, MA, 1998.","title":"An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization","authors":"J Harvey, Greenberg","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hadzic and Hooker, 2006] Tarik Hadzic and John N. Hooker. Postoptimality analysis for integer programming using binary decision diagrams. In GICOLAG Workshop (Global Optimization: Integrating Convexity, Optimiza- tion, Logic Programming, and Computational Algebraic Geometry), Vienna. Technical report, Carnegie Mellon University, 2006.","title":"Postoptimality analysis for integer programming using binary decision diagrams","authors":"Tarik Hadzic, John N Hooker","year":"2006","venue":"GICOLAG Workshop (Global Optimization: Integrating Convexity, Optimization, Logic Programming, and Computational Algebraic Geometry","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hall and Posner, 2004] Nicholas G. Hall and Marc E. Pos- ner. Sensitivity analysis for scheduling problems. Journal of Scheduling, 7(1):49-83, Jan 2004.","title":"Sensitivity analysis for scheduling problems","authors":"Nicholas G Hall, Marc E Posner","year":"2004","venue":"Journal of Scheduling","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hooker, 1999] John N. Hooker. Inference duality as a basis for sensitivity analysis. Constraints, 4(2):101-112, May 1999.","title":"Inference duality as a basis for sensitivity analysis","authors":"John N Hooker","year":"1999","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hooker, 2006] John N. Hooker. Duality in optimization and constraint satisfaction. In J. Christopher Beck and Barbara M. Smith, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 3-15, Berlin, Heidelberg, 2006. Springer Berlin Heidelberg.","title":"Duality in optimization and constraint satisfaction","authors":"John N Hooker","year":"2006","venue":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kolisch and Sprecher, 1997] Rainer Kolisch and Arno Sprecher. Psplib -a project scheduling problem library: Or software -orsep operations research software exchange program. European Journal of Operational Research, 96(1):205 -216, 1997.","title":"Psplib -a project scheduling problem library: Or software -orsep operations research software exchange program","authors":"Sprecher Kolisch, Rainer Kolisch, Arno Sprecher","year":"1997","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Pedregosa et al., 2011] Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al. Scikit-learn: Machine learning in python. Journal of machine learning research, 12(Oct):2825-2830, 2011.","title":"Scikit-learn: Machine learning in python","authors":"Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg","year":"2011","venue":"Journal of machine learning research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Stuckey et al., 2014] Peter J. Stuckey, Thibaut Feydy, An- dreas Schutt, Guido Tack, and Julien Fischer. The miniz- inc challenge 2008-2013. AI Magazine, 35(2):55-60, Jun. 2014.","title":"The minizinc challenge 2008-2013","authors":"J Peter, Thibaut Stuckey, Andreas Feydy, Guido Schutt, Julien Tack, Fischer","year":"2014","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Stuckey, 2010] Peter J. Stuckey. Lazy clause generation: Combining the power of sat and cp (and mip?) solving. In Andrea Lodi, Michela Milano, and Paolo Toth, editors, In- tegration of AI and OR Techniques in Constraint Program- ming for Combinatorial Optimization Problems, pages 5- 9, Berlin, Heidelberg, 2010. Springer Berlin Heidelberg.","title":"Lazy clause generation: Combining the power of sat and cp (and mip?) solving","authors":"J Peter, Stuckey","year":"2010","venue":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Vilím, 2011] Petr Vilím. Timetable edge finding filtering algorithm for discrete cumulative resources. In Tobias Achterberg and J. Christopher Beck, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 230-245, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg.","title":"Petr Vilím. Timetable edge finding filtering algorithm for discrete cumulative resources","authors":"Vilím","year":"2011","venue":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}