Differential evolution in shortest path problems

Guerreiro, Pedro; Jesus, Mário; Marquez, Alberto

http://hdl.handle.net/10400.1/10630

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
paper.pdf	7EAMD	564.7 KB	Adobe PDF	Download

Send Feedback

Authors

Guerreiro, Pedro

Jesus, Mário

Marquez, Alberto

Abstract(s)

This paper proves that the Diﬀerential 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.

Keywords

Differential evolution Shortest path problems Combinatorial optimization

URI

http://hdl.handle.net/10400.1/10630

Publisher

Editorial Universidad de Almería

Collections

ISE4-Vários

Full item page

Differential evolution in shortest path problems

Authors

Advisor(s)

Abstract(s)

Description

Keywords

URI

Citation

Research Projects

Organizational Units

Journal Issue

Publisher

Collections