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.
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2018
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.1/10630 |
| País: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/10630 |
| Resumo: | 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. |
|---|