Interactive Nonconvex Pareto Navigator for Multiobjective Optimization
Hartikainen, M., Miettinen, K., & Klamroth, K. (2019). Interactive Nonconvex Pareto Navigator for Multiobjective Optimization. European Journal of Operational Research, 275 (1), 238-251. doi:10.1016/j.ejor.2018.11.038
Published inEuropean Journal of Operational Research
© 2018 Elsevier B.V
We introduce a new interactive multiobjective optimization method operating in the objective space called Nonconvex Pareto Navigator. It extends the Pareto Navigator method for nonconvex problems. An approximation of the Pareto optimal front in the objective space is first generated with the PAINT method using a relatively small set of Pareto optimal outcomes that is assumed to be given or computed prior to the interaction with the decision maker. The decision maker can then navigate on the approximation and direct the search for interesting regions in the objective space. In this way, the decision maker can conveniently learn about the interdependencies between the conflicting objectives and possibly adjust one’s preferences. To facilitate the navigation, we introduce special cones that enable extrapolation beyond the given Pareto optimal outcomes. Besides handling nonconvexity, the new method contains new options for directing the navigation that have been inspired by the classification-based interactive NIMBUS method. The Nonconvex Pareto Navigatormethod is especially well-suited for computationally expensive problems, because the navigation on the approximation is computationally inexpensive. We demonstrate the method with an example. Besides proposing the new method, we characterize interactive navigation based methods in general and discuss desirable properties of navigation methods overall and in particular with respect to Nonconvex Pareto Navigator. ...
MetadataShow full item record
Showing items with similar title or keywords.
Zhou-Kangas, Yue; Miettinen, Kaisa; Sindhya, Karthik (Springer, 2018)In this paper, we introduce the MuRO-NIMBUS method for solving multiobjective optimization problems with uncertain parameters. The concept of set-based minmax robust Pareto optimality is utilized to tackle the uncertainty ...
Potential of interactive multiobjective optimization in supporting the design of a groundwater biodenitrification process Saccani, Giulia; Hakanen, Jussi; Sindhya, Karthi; Ojalehto, Vesa; Hartikainen, Markus; Antonelli, Manuela; Miettinen, Kaisa (Elsevier, 2020)The design of water treatment plants requires simultaneous analysis of technical, economic and environmental aspects, identified by multiple conflicting objectives. We demonstrated the advantages of an interactive ...
Multiobjective shape design in a ventilation system with a preference-driven surrogate-assisted evolutionary algorithm Chugh, Tinkle; Kratky, Tomas; Miettinen, Kaisa; Jin, Yaochu; Makkonen, Pekka (ACM, 2019)We formulate and solve a real-world shape design optimization problem of an air intake ventilation system in a tractor cabin by using a preference-based surrogate-assisted evolutionary multiobjective optimization algorithm. ...
Tabatabaei, Mohammad; Lovison, Alberto; Tan, Matthias; Hartikainen, Markus; Miettinen, Kaisa (Society for Industrial and Applied Mathematics, 2018)Real-world optimization problems may involve a number of computationally expensive functions with a large number of input variables. Metamodel-based optimization methods can reduce the computational costs of evaluating ...
Chugh, Tinkle (University of Jyväskylä, 2017)Multiobjective optimization problems (MOPs) with a large number of conﬂicting objectives are often encountered in industry. Moreover, these problem typically involve expensive evaluations (e.g. time consuming simulations ...