Multi-objective embarrassingly parallel search with upper bound constraints

Optimization plays an important role in various disciplines of engineering. Multi-objective optimization is usually characterized by a Pareto front. In large scale multi-objective optimization problems, determining an optimal Pareto front consumes large time. Thus, parallel computing is used to speed up the search. Constraint programming is one of the logic-based optimization techniques for solving combinatorial optimization problems. In our previous study, we proposed the multi-objective embarrassingly parallel search (MO-EPS) for multi-objective constraint optimization, which combines two strategies: a constraint programming-based strategy to determine Pareto front and a parallel search for constraint programming. In this study, we propose the MO-EPS with upper bound constraints, an extended algorithm of the MO-EPS.

[1]  Sven Apel,et al.  Scaling exact multi-objective combinatorial optimization by parallelization , 2014, ASE.

[2]  Makoto Yokoo,et al.  多目的制約最適化問題における対話型解法の提案;多目的制約最適化問題における対話型解法の提案;Interactive Algorithm for Multi-objective Constraint Optimization , 2013 .

[3]  Makoto Yokoo,et al.  Interactive Algorithm for Multi-Objective Constraint Optimization , 2012, CP.

[4]  Jean-Charles Régin,et al.  Embarrassingly Parallel Search , 2013, CP.

[5]  Toshiyuki Miyamoto,et al.  Multi-objective embarrassingly parallel search for constraint programming , 2015, 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).

[7]  Elia Werczberger,et al.  Multi-objective linear programming with partial ranking of objectives , 1981 .

[8]  Patrice Perny,et al.  Near Admissible Algorithms for Multiobjective Search , 2008, ECAI.

[9]  R. Lyndon While,et al.  A faster algorithm for calculating hypervolume , 2006, IEEE Transactions on Evolutionary Computation.

[10]  F. Wilcoxon Individual Comparisons by Ranking Methods , 1945 .

[11]  R. Gudi,et al.  Efficient optimization strategies with constraint programming , 2009 .

[12]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[13]  H. Ishibuchi,et al.  MOGA: multi-objective genetic algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[14]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[15]  Derek Rayside,et al.  The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization , 2009 .

[16]  Radu Marinescu,et al.  Exploiting Problem Decomposition in Multi-objective Constraint Optimization , 2009, CP.

[17]  Javier Larrosa,et al.  Bucket elimination for multiobjective optimization problems , 2006, J. Heuristics.