摘要
In this paper we introduce a method of analysis for the automated ordenng and selection or 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.
In this paper we introduce a method of analysis for the automated ordenng and selection or 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.
