Interactive algorithm for multi-objective constraint optimization

Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 aMO-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 finds several Pareto solutions so that we can provide a narrower region, in which Pareto front may exist, i.e., our extended algorithm can provide the more detailed information for Pareto front.

Original languageEnglish
Pages (from-to)57-66
Number of pages10
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume28
Issue number1
DOIs
Publication statusPublished - Jan 1 2013

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

Interactive algorithm for multi-objective constraint optimization. / Okimoto, Tenda; Joe, Yongjoon; Iwasaki, Atsushi; Yokoo, Makoto.

In: Transactions of the Japanese Society for Artificial Intelligence, Vol. 28, No. 1, 01.01.2013, p. 57-66.

Research output: Contribution to journalArticle

@article{bb81856cb9314d32b6a71714778a0967,
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 aMO-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 finds several Pareto solutions so that we can provide a narrower region, in which Pareto front may exist, i.e., our extended algorithm can provide the more detailed information for Pareto front.",
author = "Tenda Okimoto and Yongjoon Joe and Atsushi Iwasaki and Makoto Yokoo",
year = "2013",
month = "1",
day = "1",
doi = "10.1527/tjsai.28.57",
language = "English",
volume = "28",
pages = "57--66",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "1",

}

TY - JOUR

T1 - Interactive algorithm for multi-objective constraint optimization

AU - Okimoto, Tenda

AU - Joe, Yongjoon

AU - Iwasaki, Atsushi

AU - Yokoo, Makoto

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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 aMO-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 finds several Pareto solutions so that we can provide a narrower region, in which Pareto front may exist, i.e., our extended algorithm can provide the more detailed information for Pareto front.

AB - 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 aMO-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 finds several Pareto solutions so that we can provide a narrower region, in which Pareto front may exist, i.e., our extended algorithm can provide the more detailed information for Pareto front.

UR - http://www.scopus.com/inward/record.url?scp=84946173552&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946173552&partnerID=8YFLogxK

U2 - 10.1527/tjsai.28.57

DO - 10.1527/tjsai.28.57

M3 - Article

AN - SCOPUS:84946173552

VL - 28

SP - 57

EP - 66

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 1

ER -