{"type":"ScholarlyArticle","title":"Stratification for Constraint-Based Multi-Objective Combinatorial Optimization","authors":[{"name":"Miguel Terra-Neves","slug":"miguel-terra-neves","given":"Miguel","family":"Terra-Neves","affiliation":"INESC-ID / Instituto Superior Técnico , Universidade de Lisboa , Portugal"},{"name":"Inês Lynce","slug":"ines-lynce","given":"Inês","family":"Lynce","affiliation":"INESC-ID / Instituto Superior Técnico , Universidade de Lisboa , Portugal"},{"name":"Vasco Manquinho","slug":"vasco-manquinho","given":"Vasco","family":"Manquinho","affiliation":"INESC-ID / Instituto Superior Técnico , Universidade de Lisboa , Portugal"}],"abstract":"New  constraint-based  algorithms  have  been  recently proposed to solve Multi-Objective Combinatorial Optimization (MOCO) problems. These new methods are based on Minimal Correction Subsets (MCSs) or P-minimal models and have shown to be successful at solving MOCO instances when the constraint set is hard to satisfy. However, if the constraints are easy to satisfy, constraint-based tools usually do not perform as well as stochastic methods. For solving such instances, algorithms should focus on dealing with the objective functions. This paper proposes the integration of stratification techniques in constraint-based algorithms for MOCO. Moreover, it also shows how to diversify the stratification among the several objective criteria in order to better approximate the Pareto front of MOCO problems.  An extensive experimental evaluation on publicly available MOCO instances shows that the new algorithm is competitive with stochastic methods  and it is much more effective than existing constraint-based methods.","doi":"10.24963/ijcai.2018/191","url":"https://ijcai.org/proceedings/2018/191","pdf":"https://ijcai.org/proceedings/2018/0191.pdf","markdown":"https://ijcai.org/proceedings/2018/191.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/191","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Constraints and SAT","track":"Main track","number":191,"pages":{"first":1376,"last":1382},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Constraints and SAT: Constraint Optimisation","Constraints and SAT: SAT: Solvers and Tools","Constraints and SAT: SAT: Applications"],"videos":[],"references":[{"position":1,"raw":"[Ansótegui et al., 2012] C. Ansótegui, M. L. Bonet, J. Gabàs, and J. Levy. Improving SAT-Based Weighted MaxSAT Solvers. In International Conference on Prin- ciples and Practice of Constraint Programming, pages 86-101, 2012.","title":"Improving SAT-Based Weighted MaxSAT Solvers","authors":"C Ansótegui, M L Bonet, J Gabàs, J Levy","year":"2012","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bailey and Stuckey, 2005] J. Bailey and P. Stuckey. Discov- ery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. In Symposium on Practical As- pects of Declarative Languages, pages 174-186, 2005.","title":"Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization","authors":"J Bailey, P Stuckey","year":"2005","venue":"Symposium on Practical Aspects of Declarative Languages","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Birnbaum and Lozinskii, 2003] E. Birnbaum and E. Lozin- skii. Consistent Subsets of Inconsistent Systems: Structure and Behaviour. Journal of Experimental & Theoretical Ar- tificial Intelligence, 15(1):25-46, 2003.","title":"Consistent Subsets of Inconsistent Systems: Structure and Behaviour","authors":"E Birnbaum, E Lozinskii","year":"2003","venue":"Journal of Experimental & Theoretical Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bjørner et al., 2015] N. Bjørner, A.-D. Phan, and L. Fleck- enstein. νZ -An Optimizing SMT Solver. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 194-199, 2015.","title":"νZ -An Optimizing SMT Solver","authors":"N Bjørner, A.-D Phan, L Fleckenstein","year":"2015","venue":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Boros and Hammer, 2002] E. Boros and P. L. Hammer. Pseudo-Boolean Optimization. Discrete Applied Mathe- matics, 123(1):155-225, 2002.","title":"Pseudo-Boolean Optimization","authors":"E Boros, P L Hammer","year":"2002","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Deb and Sundar, 2006] K. Deb and J. Sundar. Reference Point Based Multi-Objective Optimization Using Evolu- tionary Algorithms. In Genetic and Evolutionary Compu- tation Conference, pages 635-642, 2006.","title":"Reference Point Based Multi-Objective Optimization Using Evolutionary Algorithms","authors":"K Deb, J Sundar","year":"2006","venue":"Genetic and Evolutionary Computation Conference","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Deb et al., 2000] K. Deb, S. Agrawal, A. Pratap, and T. Me- yarivan. A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II. In International Conference on Parallel Problem Solving from Nature, pages 849-858. Springer, 2000.","title":"A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II","authors":"K Deb, S Agrawal, A Pratap, T Meyarivan","year":"2000","venue":"International Conference on Parallel Problem Solving from Nature","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Demirovic and Musliu, 2017] E. Demirovic and N. Mus- liu. MaxSAT-based Large Neighborhood Search for High School Timetabling. Journal of Computers & Operations Research, 78:172-180, 2017.","title":"MaxSAT-based Large Neighborhood Search for High School Timetabling","authors":"E Demirovic, N Musliu","year":"2017","venue":"Journal of Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Felfernig et al., 2012] A. Felfernig, M. Schubert, and C. Ze- hentner. An Efficient Diagnosis Algorithm for Inconsistent Constraint Sets. Artificial Intelligence for Engineering De- sign, Analysis and Manufacturing, 26(1):53-62, 2012.","title":"An Efficient Diagnosis Algorithm for Inconsistent Constraint Sets","authors":"A Felfernig, M Schubert, C Zehentner","year":"2012","venue":"Artificial Intelligence for Engineering Design, Analysis and Manufacturing","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Iturriaga et al., 2017] S. Iturriaga, B. Dorronsoro, and S. Nesmachnow. Multiobjective Evolutionary Algorithms for Energy and Service Level Scheduling in a Federation of Distributed Datacenters. International Transactions in Operational Research, 24(1-2):199-228, 2017.","title":"Multiobjective Evolutionary Algorithms for Energy and Service Level Scheduling in a Federation of Distributed Datacenters","authors":"S Iturriaga, B Dorronsoro, S Nesmachnow","year":"2017","venue":"International Transactions in Operational Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Jackson et al., 2009] D. Jackson, H. Estler, D. Rayside, et al. The Guided Improvement Algorithm for Ex- act, General-Purpose, Many-Objective Combinatorial Op- timization. Technical Report MIT-CSAIL-TR-2009-033, MIT, 2009.","title":"The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization","authors":"D Jackson, H Estler, D Rayside","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Le Berre and Parrain, 2010] D. Le Berre and A. Parrain. The Sat4j Library, Release 2.2. Journal on Satisfiability, Boolean Modeling and Computation, 7(2-3):59-6, 2010.","title":"The Sat4j Library, Release 2.2","authors":"D, Le Berre, A Parrain","year":"2010","venue":"Journal on Satisfiability, Boolean Modeling and Computation","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Marques-Silva et al., 2013] J. Marques-Silva, F. Heras, M. Janota, A. Previti, and A. Belov. On Computing Mini- mal Correction Subsets. In International Joint Conference on Artificial Intelligence, pages 615-622, 2013.","title":"On Computing Minimal Correction Subsets","authors":"Marques-Silva","year":"2013","venue":"International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2013/98"},{"position":14,"raw":"[Mencía et al., 2015] C. Mencía, A. Previti, and J. Marques- Silva. Literal-Based MCS Extraction. In International Joint Conference on Artificial Intelligence, pages 1973- 1979, 2015.","title":"Literal-Based MCS Extraction","authors":"C Mencía, A Previti, J Marques-Silva","year":"2015","venue":"International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/280"},{"position":15,"raw":"[Rothlauf, 2006] Franz Rothlauf. Representations for Ge- netic and Evolutionary Algorithms (2.ed). Springer, 2006.","title":"Representations for Genetic and Evolutionary Algorithms","authors":"Rothlauf","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Soh et al., 2017] T. Soh, M. Banbara, N. Tamura, and D. Le Berre. Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. In International Conference on Principles and Practice of Constraint Programming, pages 596-614. Springer, 2017.","title":"Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation","authors":"T Soh, M Banbara, N Tamura, D Le Berre","year":"2017","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Terra-Neves et al., 2017] M. Terra-Neves, I. Lynce, and V. Manquinho. Introducing Pareto Minimal Correction Subsets. In International Conference on Theory and Appli- cations of Satisfiability Testing, pages 195-211. Springer, 2017.","title":"Introducing Pareto Minimal Correction Subsets","authors":"M Terra-Neves, I Lynce, V Manquinho","year":"2017","venue":"International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Terra-Neves et al., 2018] M. Terra-Neves, I. Lynce, and V. Manquinho. Enhancing Constraint-Based Multi- Objective Combinatorial Optimization. In AAAI Confer- ence on Artificial Intelligence. AAAI Press, 2018.","title":"Enhancing Constraint-Based Multi-Objective Combinatorial Optimization","authors":"M Terra-Neves, I Lynce, V Manquinho","year":"2018","venue":"AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Ulungu and Teghem, 1994] E. L. Ulungu and J. Teghem. Multi-Objective Combinatorial Optimization Problems: A Survey. Journal of Multi-Criteria Decision Analysis, 3(2):83-104, 1994.","title":"Multi-Objective Combinatorial Optimization Problems: A Survey","authors":"E L Ulungu, J Teghem","year":"1994","venue":"Journal of Multi-Criteria Decision Analysis","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Xu and Fortes, 2010] J. Xu and J. Fortes. Multi-Objective Virtual Machine Placement in Virtualized Data Center En- vironments. In International Conference on Green Com- puting and Communications, & International Conference on Cyber, Physical and Social Computing, pages 179-188. IEEE, 2010.","title":"Multi-Objective Virtual Machine Placement in Virtualized Data Center Environments","authors":"J Xu, J Fortes","year":"2010","venue":"International Conference on Green Computing and Communications, & International Conference on Cyber, Physical and Social Computing","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Zhang and Li, 2007] Q. Zhang and H. Li. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decom- position. IEEE Transactions on Evolutionary Computa- tion, 11(6):712-731, 2007.","title":"MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition","authors":"Li ; Zhang, ] Q Zhang, H Li","year":"2007","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zheng et al., 2016] Q. Zheng, R. Li, X. Li, N. Shah, J. Zhang, F. Tian, K.-M. Chao, and J. Li. Virtual Ma- chine Consolidated Placement Based on Multi-Objective Biogeography-Based Optimization. Future Generation Computer Systems, 54, 2016.","title":"Virtual Machine Consolidated Placement Based on Multi-Objective Biogeography-Based Optimization","authors":"Q Zheng, R Li, X Li, N Shah, J Zhang, F Tian, K.-M Chao, J Li","year":"2016","venue":"Future Generation Computer Systems","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Zitzler and Thiele, 1999] E. Zitzler and L. Thiele. Multi- objective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transac- tions on Evolutionary Computation, 3(4):257-271, 1999.","title":"Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach","authors":"Thiele Zitzler, ] E Zitzler, L Thiele","year":"1999","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}