A genetic algorithm for shortest path with real constraints in computer networks | Zendy

Fahad AlGhamdi | Zendy; Ahmed Younes Hamed | Zendy; Abdullah M. Alghamdi | Zendy; Ben Salah Abderrazak | Zendy; Tamer Farag | Zendy; Walaa Hassan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A genetic algorithm for shortest path with real constraints in computer networks

Author(s) -

Fahad AlGhamdi,

Ahmed Younes Hamed,

Abdullah M. Alghamdi,

Ben Salah Abderrazak,

Tamer Farag,

Walaa Hassan

Publication year - 2022

Publication title -

international journal of power electronics and drive systems/international journal of electrical and computer engineering

Language(s) - English

Resource type - Journals

eISSN - 2722-2578

pISSN - 2722-256X

DOI - 10.11591/ijece.v13i1.pp435-442

Subject(s) - shortest path faster algorithm , yen's algorithm , k shortest path routing , shortest path problem , constrained shortest path first , computer science , heuristic , floyd–warshall algorithm , path (computing) , algorithm , genetic algorithm , mathematical optimization , network packet , average path length , longest path problem , dijkstra's algorithm , mathematics , theoretical computer science , computer network , graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research