Guerreiro, PedroJesus, MárioMarquez, Alberto2018-04-172018-04-172011978-84-694-5627-9AUT: PMG01122; MJE00980;http://hdl.handle.net/10400.1/10630This 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.engDifferential evolutionShortest path problemsCombinatorial optimizationconference object