In this article, two types of problems: 1) unconstrained and 2) constrained optimization are solved by developing a class of distributed predefined-time algorithms under dynamic event triggered (DET).

This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem ...