MultiFatorial evolutionary algorithm with nodedepth encoding for inter-domain path computation under node-defined domain uniqueness constraint

doi:10.1016/j.knosys.2025.114910

MultiFatorial evolutionary algorithm with nodedepth encoding for inter-domain path computation under node-defined domain uniqueness constraint

2025-11-20

0

PRE

AI

DOI：10.1016/j.knosys.2025.114910

Original

Original request for help

Save

Abstract

En 中文

The Inter-Domain Path Computation problem with Node-defined Domain Uniqueness Constraint (IDPC-NDU) is recognized as NP-Hard and is particularly relevant for packet routing within multi-domain networks, such as those utilizing the Hierarchical Path Computation Element (h-PCE) architecture. The goal of this problem is to identify the shortest path between two designated nodes while ensuring that each domain is visited no more than once. While numerous algorithms have addressed this problem in recent years, they face two main limitations: 1) complex encoding and decoding processes; and 2) single-task development without knowledge transfer between multiple tasks to improve solution quality. To address these limitations, this paper introduces an effective Multifactorial Evolutionary Algorithm with Node-depth Encoding (NDE-MFEA) for IDPC-NDU. We develop a novel solution encoding using a tree representation that adheres to domain constraints, making solution construction more practical. The algorithm leverages implicit knowledge transfer in multifactorial optimization to improve exploitation ability in promising solution spaces. Extensive experiments comparing our approach against several competitive algorithms demonstrate that NDE-MFEA significantly outperforms existing methods in terms of solution quality, convergence trends, and computational efficiency.

MultiFatorial evolutionary algorithm with nodedepth encoding for inter-domain path computation under node-defined domain uniqueness constraint

Abstract

Journal

Organization

Cited Papers