Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/4048
Título: | An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions | Autor: | Coutinho-Rodrigues, J. M. Clímaco, J. C. N. Current, J. R. |
Palavras-chave: | Shortest path; Multiple criteria; Network routing | Data: | 1999 | Citação: | Computers & Operations Research. 26:8 (1999) 789-798 | Resumo: | In many network routing problems several conflicting objectives must be considered. Even for the bi-objective shortest path problem, generating and presenting the whole set of nondominated solutions (paths) to a decision maker, in general, is not effective because the number of these paths can be very large. Interactive procedures are adequate to overcome these drawbacks. Current et al. [1] proposed an interactive approach based on a NISE-like procedure to search for nondominated supported solutions and using auxiliar constrained shortest path problems to carry out the search inside the duality gaps. In this paper we propose a new interactive approach to search for unsupported nondominated solutions (lying inside duality gaps) based on a k-shortest path procedure. Both approaches are compared. | URI: | https://hdl.handle.net/10316/4048 | DOI: | 10.1016/S0305-0548(98)00094-X | Direitos: | openAccess |
Aparece nas coleções: | FCTUC Eng.Civil - Artigos em Revistas Internacionais |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
filea7e8fa6560094c2895374d08d3dc3f49.pdf | 140.43 kB | Adobe PDF | Ver/Abrir |
Citações SCOPUSTM
65
Visto em 15/abr/2024
Citações WEB OF SCIENCETM
51
Visto em 2/abr/2024
Visualizações de página 50
380
Visto em 23/abr/2024
Downloads 50
444
Visto em 23/abr/2024
Google ScholarTM
Verificar
Altmetric
Altmetric
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.