An automated reference point-like approach for multicriteria shortest path problems

João C. N. Clímaco; José M. F. Craveirinha; Marta M. B. Pascoal

doi:10.1007/s11518-006-5015-5

Journal of Systems Science and Systems Engineering ›› 2006, Vol. 15 ›› Issue (3) : 314 -329. DOI: 10.1007/s11518-006-5015-5

Article

An automated reference point-like approach for multicriteria shortest path problems

Author information +

History +

PDF

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.

Keywords

Routing / automated decision / multicriteria / reference point

Cite this article

Download citation ▾

João C. N. Clímaco, José M. F. Craveirinha, Marta M. B. Pascoal. An automated reference point-like approach for multicriteria shortest path problems. Journal of Systems Science and Systems Engineering, 2006, 15(3): 314-329 DOI:10.1007/s11518-006-5015-5

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Bouyssou D., Marchant T., Perny P., Pirlot M., Tsoukiàs A., Vincke P.. Evaluation and Decision Models: a Critical Perspective, 2000, Dordrecht: Kluwer Academic Publishers

[2]	Clímaco J., Craveirinha J., Pascoal M.. A bicriterion approach for routing problems in multimedia networks. Networks, 2003, 11: 399-404.

[3]

Clímaco, J., Craveirinha, J., & Pascoal, M. (2004). Routing calculation in multimedia: A procedure based on a bicriteria model. Proceedings of the European Congress on Computational Methods in Applied Sciences and Engineering. Jyväskylä, Finland. Available via http://www.mit.jyu.fi/eccomas2004/proceedings/pdf/720.pdf

[4]	Conte M.. Van As H. R.. Dynamic Routing in Broadband Networks. Broadband Networks and Services Series, 2003, Boston: Kluwer Academic Publishers

[5]	Dijkstra E.. A note on two problems in connection with graphs. Numerical Mathematics, 1959, 1: 269-271.

[6]	Ehrgott M., Skriver A.. Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach. European Journal of Operational Research, 2003, 147(3): 657-664.

[7]	Martins E., Pascoal M., Santos J.. Deviation algorithms for ranking shortest paths. The International Journal of Foundations of Computer Science, 1999, 10(3): 247-263.

[8]	Martins, E., Pascoal, M., & Santos, J. (2000). Labeling algorithms for ranking shortest paths. Relatório Interno 00/001, CISUC. Available via http://www.mat.uc.pt/:_marta/Publicacoes/labeling.ps.gz

[9]	Martins L., Craveirinha J., Clímaco J., Gomes T.. On a bi-dimensional dynamic alternative routing method. European Journal of Operational Research, 2005, 166(3): 828-842.

[10]	Murthy I., Her S.S.. Solving min-max shortest-path problems on a network. Naval Research Logistics, 1992, 39: 669-683.

[11]	Pornavalai C., Chakraborty G., Shiratori N.. Routing with multiple QoS requirements for supporting multimedia applications. Telecommunication Systems, 1998, 9: 357-373.

[12]	Wierzbicki, A.P. (1980). The use of reference objectives in multiobjective optimisation. In Fandel, G. and Gal, T. (eds.), MCDM Theory and Application, Proceedings, Lecture Notes in Economics and Mathematical Systems, Hagen, 177, 468–486, 1980, Springer Verlag

[13]	Wierzbicki A.P., Makowski M., Wessels J.. Model-based Decision Support Methodology with Environmental Application, 2000, Dordrecht: Kluwer Academic Publishers