An evolutionary programming algorithm for finding constrained optimal disjoint paths for multihop communication networks

DOI10.1504/IJMHEUR.2010.034203zbMath1213.90079OpenAlexW1980182467MaRDI QIDQ538000

Sudipta Mahapatra, Rajarshi Roy, Urmila Bhanja

Publication date: 23 May 2011

Published in: International Journal of Metaheuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmheur.2010.034203

zbMATH Keywords

metaheuristics quality of service disjoint paths constrained optimisation fitness functions dynamic topology evolutionary programming algorithms fitness deviation hop count bound mean execution time NP hard problem QoS constraints

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: An evolutionary programming algorithm for finding constrained optimal disjoint paths for multihop communication networks