• Home
  • Search
  • QMAEA: A quantum multi-agent evolutionary algorithm for multi-objective combinatorial optimization
  • Cite Icon14
  • https://doi.org/10.1177/0037549713485894Copy DOI Icon

QMAEA: A quantum multi-agent evolutionary algorithm for multi-objective combinatorial optimization

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Multi-objective combinatorial optimization (MOCO) is an essential concern for the implementation of large-scale distributed modeling and simulation (MS) system. It is more complex than general computing systems, with higher dynamics and stricter demands on real-time performance. The quality and speed of the optimal decision directly decides the efficiency of the simulation. However, few works have been carried out for multi-objective combinatorial optimization MOCO especially in large-scale and service-oriented distributed simulation systems (SoDSSs). The existing algorithms for MOCO in SoDSSs are far from enough owing to their low accuracy or long decision time. To overcome this bottleneck, in this paper, a quantum multi-agent evolutionary algorithm (QMAEA), for addressing MOCO in large-scale SoDSSs is proposed. In QMAEA, the concept and characteristics of agent and quantum encoding are introduced for high intelligent searching. Each agent represented by a quantum bit, called a quantum agent (QAgent), is defined as a candidate solution for a MOCO problem, and each QAgent is assigned an energy, which denotes the fitness or objective function value of the candidate solution represented by it. Each QAgent is connected by four other QAgents nearby, and all QAgents are organized by an annular grid, called a multi-agent grid (MAG). In a MAG system, the population of QAgents can reproduce, perish, compete for survival, observe and communicate with the environment, and make all their decisions autonomously. Several operators, i.e. energy-evaluation-operator, competition-operator, crossover-operator, mutation-operator and trimming-operator, are designed to specify the evolvement of the MAG. The theory of predatory search strategy of animals is introduced in the evolution of QMAEA. Multiple evolutionary strategies, such as local-evolution-strategy, local-mutation-strategy and global-mutation-strategy are designed and used to balance the exploration (global search ability) and the exploitation (local search ability) of QMAEA. The framework and procedures of QMAEA are presented in detail. The simulation and comparison results demonstrate the proposed method is very effective and efficient for addressing MOCO in SoDSSs.

Similar Papers
  • Conference Article
  • Citations3

Memetic algorithms for evolutionary multiobjective combinatorial optimization

  • Jul 01, 2010
  • Hisao Ishibuchi
  • Research Article
  • Citations21

Implementation of Simple Multiobjective Memetic Algorithms and Its Application to Knapsack Problems

  • Sep 13, 2004
  • International Journal of Hybrid Intelligent Systems
  • Hisao Ishibuchi +1
  • Research Article
  • Citations18

Hybridization of Genetic Algorithm with Local Search in Multiobjective Function Optimization: Recommendation of GA then LS

  • Jan 01, 2006
  • Transactions of the Japanese Society for Artificial Intelligence
  • Ken Harada +4
  • Research Article
  • Citations8

A bi-subpopulation coevolutionary immune algorithm for multi-objective combinatorial optimization in multi-UAV task allocation

  • Jan 15, 2025
  • Complex & Intelligent Systems
  • Xi Chen +5
  • Research Article
  • Citations35

An efficient hybrid multi-objective particle swarm optimization with a multi-objective dichotomy line search

  • Dec 08, 2014
  • Journal of Computational and Applied Mathematics
  • Gang Xu +4
  • Conference Article
  • Citations10

A Random Forest-Assisted Decomposition-Based Evolutionary Algorithm for Multi-Objective Combinatorial Optimization Problems

  • Jul 18, 2022
  • Matheus Bernardelli De Moraes +1
  • Conference Article
  • Citations3

A new idea for addressing multi-objective combinatorial optimization: Quantum multi-agent evolutionary algorithms

  • Mar 01, 2009
  • Dongming Zhao +1
  • Research Article
  • Citations69

An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization

  • Jul 01, 2008
  • European Journal of Operational Research
  • Hisao Ishibuchi +3
  • Research Article
  • Citations786

Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

  • Apr 01, 2003
  • IEEE Transactions on Evolutionary Computation
  • H Ishibuchi +2
  • Conference Article
  • Citations1

Performance evaluation of memetic EMO algorithms using dominance relation-based replacement rules on MOO test problems

  • Nov 10, 2003
  • S Kaige +2
  • Research Article
  • Citations22

Memetic algorithm with Preferential Local Search using adaptive weights for multi-objective optimization problems

  • Feb 15, 2015
  • Soft Computing
  • J Bhuvana +1
  • Book Chapter
  • Citations3

Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization

  • Jan 01, 2019
  • Nawal Benabbou +3
  • Research Article

Adaptive Geometry Based Meta-Learning for Multi-Objective Combinatorial Optimization Problems

  • Nov 03, 2025
  • Intelligenza Artificiale
  • Fangzhen Ge +4
  • PDF
  • Book Chapter
  • Citations6

New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization

  • Jan 01, 2023
  • João Cortes +2
  • Conference Article
  • Citations5

Stratification for Constraint-Based Multi-Objective Combinatorial Optimization

  • Jul 01, 2018
  • Miguel Terra-Neves +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.