A new ranking path algorithm for the multi-objective shortest path problem
In this paper, we present a new algorithm for solving the multi-objective shortest path problem (MSPP) which consists of finding all the non-dominated paths between two nodes s and t (ND s-t paths), on a network where a multiple criteria function is defined over the set of arcs. The main feature of...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | other |
| Idioma: | eng |
| Publicado em: |
2008
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/11246 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/11246 |