.png){kind=icon}
.png){kind=icon}
Return
Enhanced directed search: a continuation method for mixed-integer multi-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-018-3060-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-objective optimization problems (MOPs) commonly arise in various applications of engineering and management fields. Many real-world MOPs are mixed-integer multiobjective 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.
Keywords:
Multiple criteria decision
Multi-objective optimization
Pareto optimum
Continuation based heuristics
Numerical algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
