TY - JOUR
T1 - Enhanced directed search
T2 - a continuation method for mixed-integer multi-objective optimization problems
AU - Wang, Honggang
AU - Laredo, David
AU - Cuate, Oliver
AU - Schütze, Oliver
N1 - Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/8/15
Y1 - 2019/8/15
N2 - Multi-objective optimization problems (MOPs) commonly arise in various applications of engineering and management fields. Many real-world MOPs are mixed-integer multi-objective optimization problems (MMOP), where the solution space consists of real and integer decision variables. The research regarding MMOPs is still scarce due to the mixture nature of the solution space and difficulty of finding the set of trade-off solutions. In this work we propose a continuation based method that efficiently solves MMOP problems. Our method, called Enhanced Directed Search (EDS), is capable of steering the search along a predefined direction along the Pareto front in the objective function space. EDS traces the Pareto front by following closest predictor and corrector solutions in the course of optimization. By searching around the objective function boundary, EDS can solve problems with k> 2 objectives. With five example problems widely studied in the literature, we demonstrate that EDS outperforms the recently developed Direct Zig Zag algorithm and the popular NSGA-II method.
AB - Multi-objective optimization problems (MOPs) commonly arise in various applications of engineering and management fields. Many real-world MOPs are mixed-integer multi-objective optimization problems (MMOP), where the solution space consists of real and integer decision variables. The research regarding MMOPs is still scarce due to the mixture nature of the solution space and difficulty of finding the set of trade-off solutions. In this work we propose a continuation based method that efficiently solves MMOP problems. Our method, called Enhanced Directed Search (EDS), is capable of steering the search along a predefined direction along the Pareto front in the objective function space. EDS traces the Pareto front by following closest predictor and corrector solutions in the course of optimization. By searching around the objective function boundary, EDS can solve problems with k> 2 objectives. With five example problems widely studied in the literature, we demonstrate that EDS outperforms the recently developed Direct Zig Zag algorithm and the popular NSGA-II method.
KW - Continuation based heuristics
KW - Multi-objective optimization
KW - Multiple criteria decision
KW - Numerical algorithms
KW - Pareto optimum
UR - http://www.scopus.com/inward/record.url?scp=85053842674&partnerID=8YFLogxK
U2 - 10.1007/s10479-018-3060-3
DO - 10.1007/s10479-018-3060-3
M3 - Artículo
AN - SCOPUS:85053842674
SN - 0254-5330
VL - 279
SP - 343
EP - 365
JO - Annals of Operations Research
JF - Annals of Operations Research
IS - 1-2
ER -