In this paper we introduce a method of analysis for the automated ordering and selection of solutions of a multicriteria shortest path model. The method is based on a reference point approach, where the paths in a specific priority region are ranked by non-decreasing order of a Chebyshev metric. In order to list paths according with this objective function a labelling algorithm is proposed. The developed method is applied in a video-traffic routing context. Computational results are presented and analysed, for randomly generated networks of significant dimension. © Systems Engineering Society of China and Springer 2006.
An automated reference point-like approach for multicriteria shortest path problems
Pascoal M.
2006-01-01
Abstract
In this paper we introduce a method of analysis for the automated ordering and selection of solutions of a multicriteria shortest path model. The method is based on a reference point approach, where the paths in a specific priority region are ranked by non-decreasing order of a Chebyshev metric. In order to list paths according with this objective function a labelling algorithm is proposed. The developed method is applied in a video-traffic routing context. Computational results are presented and analysed, for randomly generated networks of significant dimension. © Systems Engineering Society of China and Springer 2006.| File | Dimensione | Formato | |
|---|---|---|---|
|
06JSSE.pdf
Accesso riservato
:
Publisher’s version
Dimensione
651.04 kB
Formato
Adobe PDF
|
651.04 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


