Parallel quantum evolutionary algorithms with client-server model for multi-objective optimization on discrete problems

研究成果: Conference contribution

1 引用 (Scopus)

抄録

This paper proposes a parallel quantum evolutionary algorithm (PQEA) using Client-Server model for multi-objective optimization problems. Firstly, the PQEA uniformly decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems. All the sub-problems are classified into several groups according to their similarities. Each "Client" processes the evolution for a group of neighbor sub-problems in parallel. There is a quantum individual used to address the sub-problems of a group in a "Client". Since the quantum individual is a probabilistic representation, it can share evolutionary information of the neighbor sub-problems in one group, while the sub-problems are orderly solved using a same q-bit individual. The "Server" maintains non-dominated solutions that are generated by every "Client". The current best solution for each sub-problem can be found in the "Server", when the quantum individual updated its states for evolution. Experimental results have demonstrated that PQEA obviously outperforms the most famous multi-objective optimization algorithms MOEA/D on the bi-objectives. For the more objectives, the PQEA obtains the similar results with MOEA/D, even with the same evaluation times. Furthermore, in this paper, the scalability and sensitivity of PQEA have also been experimentally investigated.

元の言語English
ホスト出版物のタイトル2012 IEEE Congress on Evolutionary Computation, CEC 2012
DOI
出版物ステータスPublished - 2012
イベント2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD
継続期間: 2012 6 102012 6 15

Other

Other2012 IEEE Congress on Evolutionary Computation, CEC 2012
Brisbane, QLD
期間12/6/1012/6/15

Fingerprint

Quantum Algorithms
Client/server
Multiobjective optimization
Multi-objective Optimization
Evolutionary algorithms
Evolutionary Algorithms
Servers
Multiobjective Optimization Problems
Model
Server
Scalability
Nondominated Solutions
Optimization Algorithm
Scalar
Decompose
Optimization
Evaluation
Experimental Results

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

これを引用

Parallel quantum evolutionary algorithms with client-server model for multi-objective optimization on discrete problems. / Wei, Xin; Fujimura, Shigeru.

2012 IEEE Congress on Evolutionary Computation, CEC 2012. 2012. 6252958.

研究成果: Conference contribution

Wei, X & Fujimura, S 2012, Parallel quantum evolutionary algorithms with client-server model for multi-objective optimization on discrete problems. : 2012 IEEE Congress on Evolutionary Computation, CEC 2012., 6252958, 2012 IEEE Congress on Evolutionary Computation, CEC 2012, Brisbane, QLD, 12/6/10. https://doi.org/10.1109/CEC.2012.6252958
@inproceedings{6020c135ddcf4e698f5e8fe46a632676,
title = "Parallel quantum evolutionary algorithms with client-server model for multi-objective optimization on discrete problems",
abstract = "This paper proposes a parallel quantum evolutionary algorithm (PQEA) using Client-Server model for multi-objective optimization problems. Firstly, the PQEA uniformly decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems. All the sub-problems are classified into several groups according to their similarities. Each {"}Client{"} processes the evolution for a group of neighbor sub-problems in parallel. There is a quantum individual used to address the sub-problems of a group in a {"}Client{"}. Since the quantum individual is a probabilistic representation, it can share evolutionary information of the neighbor sub-problems in one group, while the sub-problems are orderly solved using a same q-bit individual. The {"}Server{"} maintains non-dominated solutions that are generated by every {"}Client{"}. The current best solution for each sub-problem can be found in the {"}Server{"}, when the quantum individual updated its states for evolution. Experimental results have demonstrated that PQEA obviously outperforms the most famous multi-objective optimization algorithms MOEA/D on the bi-objectives. For the more objectives, the PQEA obtains the similar results with MOEA/D, even with the same evaluation times. Furthermore, in this paper, the scalability and sensitivity of PQEA have also been experimentally investigated.",
keywords = "Multi-Objective Optimization, Parallel, Pareto Front, Quantum Evolutionary Algorithm",
author = "Xin Wei and Shigeru Fujimura",
year = "2012",
doi = "10.1109/CEC.2012.6252958",
language = "English",
isbn = "9781467315098",
booktitle = "2012 IEEE Congress on Evolutionary Computation, CEC 2012",

}

TY - GEN

T1 - Parallel quantum evolutionary algorithms with client-server model for multi-objective optimization on discrete problems

AU - Wei, Xin

AU - Fujimura, Shigeru

PY - 2012

Y1 - 2012

N2 - This paper proposes a parallel quantum evolutionary algorithm (PQEA) using Client-Server model for multi-objective optimization problems. Firstly, the PQEA uniformly decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems. All the sub-problems are classified into several groups according to their similarities. Each "Client" processes the evolution for a group of neighbor sub-problems in parallel. There is a quantum individual used to address the sub-problems of a group in a "Client". Since the quantum individual is a probabilistic representation, it can share evolutionary information of the neighbor sub-problems in one group, while the sub-problems are orderly solved using a same q-bit individual. The "Server" maintains non-dominated solutions that are generated by every "Client". The current best solution for each sub-problem can be found in the "Server", when the quantum individual updated its states for evolution. Experimental results have demonstrated that PQEA obviously outperforms the most famous multi-objective optimization algorithms MOEA/D on the bi-objectives. For the more objectives, the PQEA obtains the similar results with MOEA/D, even with the same evaluation times. Furthermore, in this paper, the scalability and sensitivity of PQEA have also been experimentally investigated.

AB - This paper proposes a parallel quantum evolutionary algorithm (PQEA) using Client-Server model for multi-objective optimization problems. Firstly, the PQEA uniformly decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems. All the sub-problems are classified into several groups according to their similarities. Each "Client" processes the evolution for a group of neighbor sub-problems in parallel. There is a quantum individual used to address the sub-problems of a group in a "Client". Since the quantum individual is a probabilistic representation, it can share evolutionary information of the neighbor sub-problems in one group, while the sub-problems are orderly solved using a same q-bit individual. The "Server" maintains non-dominated solutions that are generated by every "Client". The current best solution for each sub-problem can be found in the "Server", when the quantum individual updated its states for evolution. Experimental results have demonstrated that PQEA obviously outperforms the most famous multi-objective optimization algorithms MOEA/D on the bi-objectives. For the more objectives, the PQEA obtains the similar results with MOEA/D, even with the same evaluation times. Furthermore, in this paper, the scalability and sensitivity of PQEA have also been experimentally investigated.

KW - Multi-Objective Optimization

KW - Parallel

KW - Pareto Front

KW - Quantum Evolutionary Algorithm

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

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

U2 - 10.1109/CEC.2012.6252958

DO - 10.1109/CEC.2012.6252958

M3 - Conference contribution

AN - SCOPUS:84866856931

SN - 9781467315098

BT - 2012 IEEE Congress on Evolutionary Computation, CEC 2012

ER -