Differential evolution in shortest path problems

This paper proves that the Differential Evolution (DE) algorithm is valid to solve the Shortest Path (SP) problem in random, median sized networks. From the trials, we have obtained an 9% accuracy, in the worst case scenario.

Bibliographic Details
Main Author: Guerreiro, Pedro (author)
Other Authors: Jesus, Mário (author), Marquez, Alberto (author)
Format: conferenceObject
Language:eng
Published: 2018
Subjects:
Differential evolution
Shortest path problems
Combinatorial optimization
Online Access:http://hdl.handle.net/10400.1/10630
Country:Portugal
Oai:oai:sapientia.ualg.pt:10400.1/10630
Description
Summary:This paper proves that the Differential Evolution (DE) algorithm is valid to solve the Shortest Path (SP) problem in random, median sized networks. From the trials, we have obtained an 9% accuracy, in the worst case scenario.

Similar Items