Demonstrating the Applicability of PAINT to Computationally Expensive Real-life Multiobjective Optimization
Hartikainen, M., & Ojalehto, V. (2011). Demonstrating the Applicability of PAINT to Computationally Expensive Real-life Multiobjective Optimization. arXiv. http://arxiv.org/pdf/1109.3411v1
We demonstrate the applicability of a new PAINT method to speed up iterations of interactive methods in multiobjective optimization. As our test case, we solve a computationally expensive non-linear, five-objective problem of designing and operating a wastewater treatment plant. The PAINT method interpolates between a given set of Pareto optimal outcomes and constructs a computationally inexpensive mixed integer linear surrogate problem for the original problem. We develop an IND-NIMBUS R PAINT module to combine the interactive NIMBUS method and the PAINT method and to find a preferred solution to the original problem. With the PAINT method, the solution process with the NIMBUS method take a comparatively short time even though the original problem is computationally expensive.
Publication in research information system
MetadataShow full item record
Showing items with similar title or keywords.
Tabatabaei, Mohammad; Hartikainen, Markus; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Palgrave Macmillan Ltd., 2019)Many disciplines involve computationally expensive multiobjective optimisation problems. Surrogate-based methods are commonly used in the literature to alleviate the computational cost. In this paper, we develop an interactive ...
A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms Chugh, Tinkle; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2019)Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, ...
Haanpää, Tomi (University of Jyväskylä, 2012)
A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization Chugh, Tinkle; Jin, Yaochu; Miettinen, Kaisa; Hakanen, Jussi; Sindhya, Karthik (Institute of Electrical and Electronics Engineers, 2018)We propose a surrogate-assisted reference vector guided evolutionary algorithm (EA) for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed ...
A Multiple Surrogate Assisted Decomposition Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization Habib, Ahsanul; Singh, Hemant Kumar; Chugh, Tinkle; Ray, Tapabrata; Miettinen, Kaisa (Institute of Electrical and Electronics Engineers, 2019)Many-objective optimization problems (MaOPs) contain four or more conflicting objectives to be optimized. A number of efficient decomposition-based evolutionary algorithms have been developed in the recent years to solve ...