Paper Info
Title
Interactive algorithm for multi-objective constraint optimization
Abstract
Many real world problems involve multiple criteria that should be considered separately and optimized simultaneously. A Multi-Objective Constraint Optimization Problem (MO-COP) is the extension of a mono-objective Constraint Optimization Problem (COP). In a MO-COP, it is required to provide the most preferred solution for a user among many optimal solutions. In this paper, we develop a novel Interactive Algorithm for MO-COP (MO-IA). The characteristics of this algorithm are as follows: (i) it can guarantee to find a Pareto solution, (ii) it narrows a region, in which Pareto front may exist, gradually, (iii) it is based on a pseudo-tree, which is a widely used graph structure in COP algorithms, and (iv) the complexity of this algorithm is determined by the induced width of problem instances. In the evaluations, we use an existing model for representing a utility function, and show empirically the effectiveness of our algorithm. Furthermore, we propose an extension of MO-IA, which can provide the more detailed information for Pareto front.
Year
DOI
Venue
2012
10.1007/978-3-642-33558-7_41
CP
Keywords
Field
DocType
pareto front,detailed information,pareto solution,graph structure,optimal solution,mono-objective constraint optimization problem,multi-objective constraint optimization,interactive algorithm,preferred solution,existing model,multi-objective constraint optimization problem,cop algorithm
Constraint optimization problem,Graph,Interactive algorithm,Mathematical optimization,Multiple criteria,Computer science,Algorithm,Multi-objective optimization,Pareto solution,Difference-map algorithm,Constrained optimization
Conference
Citations 
PageRank 
References 
1
0.35
13
Authors
6
Name
Order
Citations
PageRank
Tenda Okimoto14611.54
Yongjoon Joe2111.51
Atsushi Iwasaki329231.81
Toshihiro Matsui438062.51
Katsutoshi Hirayama547244.79
Makoto Yokoo63632421.99