Sequential Approximation Method in Multi-objective Optimization Using Aspiration Level Approach
One of main issues in multi-objective optimization is to support for choosing a final solution from Pareto frontier which is the set of solution to problem. For generating a part of Pareto optimal solution closest to an aspiration level of decision maker, not the whole set of Pareto optimal solutions, we propose a method which is composed of two steps; i) approximate the form of each objective function by using support vector regression on the basis of some sample data, and ii) generate Pareto frontier to the approximated objective functions based on given the aspiration level. In addition, we suggest to select additional data for approximating sequentially the forms of objective functions by relearning step by step. Finally, the effectiveness of the proposed method will be shown through some numerical examples.
Unable to display preview. Download preview PDF.
- 2.Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)Google Scholar
- 5.Fonseca, C.M., Fleming, P.J.: Genetic Algorithms for Multi-objective Optimization: Formulation, Discussion and Generalization. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 416–426 (1993)Google Scholar
- 7.Nakayama, H., Yun, Y.B.: Support Vector Regression based on Goal Programming and Multiobjective Programming. In: Proceedings of World Congress on Computational Intelligence (2006)Google Scholar
- 9.Schölkopf, B., Smola, A.J.: New Support Vector Algorithms, NeuroCOLT2 Technical report Series, NC2-TR-1998-031 (1998)Google Scholar
- 10.Schölkopf, B., Smola, A.J.: Learning with Kernels. MIT Press, Cambridge (2002)Google Scholar
- 15.Yoon, M., Yun, Y.B., Nakayama, H.: Total Margin Algorithms in Support Vector Machines. IEICE Transactions on Information and Systems E87(5), 1223–1230 (2004)Google Scholar