Publicação
Ranking multiobjective shortest paths
| Resumo: | This paper is concerned with the ranking of multi-objective shortest paths accordingly to an order relation verifying certain conditions such is the case, for instance, of the lexicographic order. We present a new labelling algorithm that makes use of shortest deviation paths for obtaining the set of Pareto solutions for the multi-objective shortest path problem. The computational experience reported at the end of the paper shows that the new algorithm clearly outperforms the previous approaches when one looks for the `-th shortest non-dominated paths. |
|---|---|
| Autores principais: | Martins, Ernesto Queirós |
| Outros Autores: | Paixão, José Manuel; Rosa, Mário Silva; Santos, José Luis |
| Assunto: | Multiple objective programming Combinatorial optimization Ranking algorithm Total order Non-dominated path |
| Ano: | 2007 |
| País: | Portugal |
| Tipo de documento: | outro |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade de Coimbra |
| Idioma: | inglês |
| Origem: | Estudo Geral - Universidade de Coimbra |
| Resumo: | This paper is concerned with the ranking of multi-objective shortest paths accordingly to an order relation verifying certain conditions such is the case, for instance, of the lexicographic order. We present a new labelling algorithm that makes use of shortest deviation paths for obtaining the set of Pareto solutions for the multi-objective shortest path problem. The computational experience reported at the end of the paper shows that the new algorithm clearly outperforms the previous approaches when one looks for the `-th shortest non-dominated paths. |
|---|