Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/8225
Title: The determination of the path with minimum-cost norm value
Authors: Paixão, José M. P. 
Martins, Ernesto de Queirós Vieira 
Rosa, Mário S. 
Santos, José Luis E. 
Issue Date: 2003
Citation: Networks. 41:4 (2003) 184-196
Abstract: The multiobjective shortest path problem (MSPP) consists of finding the best nondominated path linking two specified nodes in a network where k > 1 different criteria are considered for the arc costs. Solving the MSPP implies determining all the nondominated paths; there may be many such paths, making the selection process a very hard task to accomplish. A traditional way of dealing with such a difficulty is using a utility function where the parameters are aggregated with different weights. In this work, an alternative utility function based on the norm value associated with each path is considered. Two algorithms for solving the minimum-cost norm path problem are then proposed and some computational results are presented. © 2003 Wiley Periodicals, Inc.
URI: http://hdl.handle.net/10316/8225
DOI: 10.1002/net.10077
Rights: openAccess
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
obra.pdf188.04 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

9
checked on Feb 18, 2020

WEB OF SCIENCETM
Citations 10

8
checked on Sep 2, 2021

Page view(s) 20

576
checked on Sep 16, 2021

Download(s) 50

342
checked on Sep 16, 2021

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.