Tuning the interval algorithm for seeking pareto sets of multi-criteria problems

Authors:
Bartłomiej Jacek Kubica;Adam Woźniak
Affiliations:
Institute of Control and Computation Engineering, Warsaw University of Technology, Poland;Institute of Control and Computation Engineering, Warsaw University of Technology, Poland
Venue:
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
Year:
2012

Citing 8
Cited 0

Multidimensional scaling for group memory visualization

Decision Support Systems - From information retrieval to knowledge management: enabling technologies and best practices
New Subinterval Selection Criteria for Interval Global Optimization

Journal of Global Optimization
Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

Journal of Global Optimization
A population and interval constraint propagation algorithm

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Interval methods for computing the Pareto-front of a multicriterial problem

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Using the second-order information in pareto-set computations of a multi-criteria problem

PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
A class of problems that can be solved using interval algorithms

Computing - Special Issue on GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN2010)
Tuning the multithreaded interval method for solving underdetermined systems of nonlinear equations

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents the authors' effort to optimize a previously developed interval method for solving multi-criteria problems [17]. The idea is to apply heuristics presented, e.g., in [27], [22], [26] and some new ones, to the Pareto set seeking method. Numerical experiments are presented and parallelization of the algorithm is considered. Based on the tuned algorithm, we propose a new approach to interactive multiple criteria decision making.