Hybrid multi-objective evolutionary algorithms for service placement in the computing continuum: a comparative study with genetic traceability

• URL: http://arxiv.org/abs/2607.13200v1
• Date: Tue, 14 Jul 2026 18:51:25 GMT
• Title: Hybrid multi-objective evolutionary algorithms for service placement in the computing continuum: a comparative study with genetic traceability
• Abstract summary: This paper addresses multi-objective service placement in computing continuum environments through a collaborative hybrid island-model MOEA.<n>The key innovation is not the design of a new general hybrid algorithm, but the systematic application and analysis of heterogeneous hybridization for this specific optimization domain.
• Score: 1.7205106391379026
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper addresses multi-objective service placement in computing continuum environments through a collaborative hybrid island-model MOEA. The key innovation is not the design of a new general hybrid algorithm, but the systematic application and analysis of heterogeneous hybridization for this specific optimization domain through two independent experimental campaigns: a first one with four state-of-the-art MOEAs (NSGA-II, NSGA-III, U-NSGA-III, and SMS-EMOA), and a second one with a complementary hybrid configuration based on NSGA-II, MOEA/TS, and MOCPO, both co-evolving and periodically exchanging solutions. These designs enable complementary search behaviors across islands and are naturally aligned with the distributed edge-fog-cloud architecture of the computing continuum, facilitating scalable parallel execution. To evaluate the approach, we define two research hypotheses: (i) whether hybrid cooperation yields significant performance gains over standalone algorithms, and (ii) whether all constituent algorithms contribute equally to the final outcomes. We combine standard Pareto-front quality indicators (GD, IGD, HV, S, and STE) with a traceability-oriented analysis based on genetic load, which quantifies the contribution of each island to the evolved solutions. Across 30 independent runs, the hybrid method outperforms most of the standalone baselines, and statistical tests confirm significant improvements. Results also show non-uniform contributions among islands, providing interpretable evidence of effective hybrid cooperation.

Related papers

• STABLE: Efficient Hybrid Nearest Neighbor Search via Magnitude-Uniformity and Cardinality-Robustness [59.119196450578364]
  Hybrid Approximate Nearest Neighbor Search (Hybrid ANNS) is a foundational search technology for large-scale heterogeneous data.<n>We propose the robuSt heTerogeneity-Aware hyBrid retrievaL framEwork, STABLE, to overcome the Compatibility Barrier for Similarity Magnitude Heterogeneity and the Tolerance Bottleneck to Attribute Cardinality.
  arXiv  Detail & Related papers  (2026-04-02T04:52:35Z)
• HBridge: H-Shape Bridging of Heterogeneous Experts for Unified Multimodal Understanding and Generation [72.69742127579508]
  Recent unified models integrate understanding experts (e.g., LLMs) with generative experts (e.g., diffusion models)<n>In this work, we propose HBridge, an asymmetric H-shaped architecture that enables heterogeneous experts to optimally leverage pretrained priors.<n> Extensive experiments across multiple benchmarks demonstrate the effectiveness and superior performance of HBridge.
  arXiv  Detail & Related papers  (2025-11-25T17:23:38Z)
• scMRDR: A scalable and flexible framework for unpaired single-cell multi-omics data integration [53.683726781791385]
  We introduce a scalable and flexible generative framework called single-cell Multi-omics Regularized Disentangled Representations (scMRDR) for unpaired multi-omics integration.<n>Our method achieves excellent performance on benchmark datasets in terms of batch correction, modality alignment, and biological signal preservation.
  arXiv  Detail & Related papers  (2025-10-28T21:28:39Z)
• Bidirectional Representations Augmented Autoregressive Biological Sequence Generation:Application in De Novo Peptide Sequencing [51.12821379640881]
  Autoregressive (AR) models offer holistic, bidirectional representations but face challenges with generative coherence and scalability.<n>We propose a hybrid framework enhancing AR generation by dynamically integrating rich contextual information from non-autoregressive mechanisms.<n>A novel cross-decoder attention module enables the AR decoder to iteratively query and integrate these bidirectional features.
  arXiv  Detail & Related papers  (2025-10-09T12:52:55Z)
• Asynchronous Policy Gradient Aggregation for Efficient Distributed Reinforcement Learning [55.50683337004406]
  We introduce two new algorithms, Rennala NIGT and Malenia NIGT, which implement asynchronous policy gradient aggregation.<n>In the homogeneous setting, Rennala NIGT provably improves the total computational and communication complexity while supporting the AllReduce operation.<n>In the heterogeneous setting, Malenia NIGT simultaneously handles asynchronous computations and heterogeneous environments with strictly better theoretical guarantees.
  arXiv  Detail & Related papers  (2025-09-29T05:38:42Z)
• Multi-population Ensemble Genetic Programming via Cooperative Coevolution and Multi-view Learning for Classification [9.17282078449475]
  Multi-population Ensemble Genetic Programming (MEGP) is a computational intelligence framework that integrates cooperative coevolution and the multiview learning paradigm.<n>MEGP decomposes the input space into conditionally independent feature subsets, enabling multiple subpopulations to evolve in parallel.<n>It consistently outperforms a baseline GP model in terms of convergence behavior and generalization performance.
  arXiv  Detail & Related papers  (2025-09-16T01:32:04Z)
• Sequential, Parallel and Consecutive Hybrid Evolutionary-Swarm Optimization Metaheuristics [43.05659890525653]
  This paper explores hybrid evolutionary-swarm metaheuristics that combine the features of PSO and GA in a sequential, parallel and consecutive manner.<n>The experimental results demonstrate that the hybrid approaches achieve superior convergence and consistency.<n>The paper introduces a novel consecutive hybrid PSO-GA evolutionary algorithm that ensures continuity between PSO and GA steps through explicit information transfer mechanisms.
  arXiv  Detail & Related papers  (2025-08-01T00:23:36Z)
• Accelerating Evolution: Integrating PSO Principles into Real-Coded Genetic Algorithm Crossover [2.854482269849925]
  This study introduces an innovative crossover operator named Particle Swarm Optimization-inspired Crossover (PSOX)<n>PSOX uniquely incorporates guidance from both the current global best solution and historical optimal solutions across multiple generations.<n>This novel mechanism enables the algorithm to maintain population diversity while simultaneously accelerating convergence toward promising regions of the search space.
  arXiv  Detail & Related papers  (2025-05-06T06:17:57Z)
• Constrained Hybrid Metaheuristic Algorithm for Probabilistic Neural Networks Learning [0.3686808512438362]
  This study investigates the potential of hybrid metaheuristic algorithms to enhance the training of Probabilistic Neural Networks (PNNs)<n>Traditional learning methods, such as gradient-based approaches, often struggle to optimise high-dimensional and uncertain environments.<n>We propose the constrained Hybrid Metaheuristic (cHM) algorithm, which combines multiple population-based optimisation techniques into a unified framework.
  arXiv  Detail & Related papers  (2025-01-26T19:49:16Z)
• Applying Autonomous Hybrid Agent-based Computing to Difficult Optimization Problems [56.821213236215634]
  This paper focuses on a proposed hybrid version of the EMAS. It covers selection and introduction of a number of hybrid operators and defining rules for starting the hybrid steps of the main algorithm. Those hybrid steps leverage existing, well-known and proven to be efficient metaheuristics, and integrate their results into the main algorithm.
  arXiv  Detail & Related papers  (2022-10-24T13:28:35Z)
• cMLSGA: A Co-Evolutionary Multi-Level Selection Genetic Algorithm for Multi-Objective Optimization [0.0]
  Multi-Level Selection Genetic Algorithm (MLSGA) already shows good performance on range of problems. This paper proposes a distinct set of co-evolutionary mechanisms, which defines co-evolution as competition between collectives rather than individuals.
  arXiv  Detail & Related papers  (2021-04-22T13:52:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.