HAL (Le Centre pour la Communication Scientifique Directe)
Memetic algorithm for solving one-to-one shortest path problem
February 2015 • Omar Dib, Alexandre Caminada, Marié-Ange Manier
The shortest path problem (SPP) is widely applied in different fields of application such as transportation, telecommunication and networks. It aims at determining the path between two points with the minimum associated/allocated resource (distance, time, cost…) in a directed or undirected graph. SPP has been well studied over the last 60 years, graph theory experts still endeavor to extract new variants of the basic problem in order to model and provide efficient solutions for several real life issues. Important …