Skip to main content
Log in

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

  • Published:
Journal of Systems Science and Systems Engineering Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Google Scholar 

  2. Clímaco, J., Craveirinha, J., & Pascoal, M. (2003). A bicriterion approach for routing problems in multimedia networks. Networks, 11:399–404

    Google Scholar 

  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. (2003). Dynamic Routing in Broadband Networks, H. R. Van As (ed.), In Broadband Networks and Services Series, Boston, Kluwer Academic Publishers

    Google Scholar 

  5. Dijkstra, E. (1959). A note on two problems in connection with graphs. Numerical Mathematics, 1:269–271

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Martins, E., Pascoal, M., & Santos, J. (1999). Deviation algorithms for ranking shortest paths. The International Journal of Foundations of Computer Science, 10(3):247–263. Available at http://www.mat.uc.pt/:_marta/Publicacoes/deviation.ps.gz

    Article  Google Scholar 

  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. (2005). On a bi-dimensional dynamic alternative routing method. European Journal of Operational Research, 166(3): 828–842

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  11. Pornavalai, C., Chakraborty, G. & Shiratori, N. (1998). Routing with multiple QoS requirements for supporting multimedia applications. Telecommunication Systems, 9:357–373

    Article  Google Scholar 

  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. (2000). Model-based Decision Support Methodology with Environmental Application. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marta M. B. Pascoal.

Additional information

João Carlos Namorado Clímaco is Full Professor at the Faculty of Economics of the University of Coimbra and President of the Scientific Committee of the INESC — Coimbra. He obtained the Master of Science Degree in “Control Systems” at the Imperial College of Science and Technology, University of London (1978); the “Diploma of Membership of the Imperial College of Science and Technology” (1978); the Ph.D. in Optimization and Systems Theory, Electrical Engineering Department, University of Coimbra (1982); and the title of “Agregação” at the University of Coimbra (1989). He was, in the past, Vice-President of ALIO — Latin Ibero American OR Association and Vice-President of the Portuguese OR Society. Actually is Member of the International Executive Committee of the International Society on Multiple Criteria Decision Making. He belongs to the Editorial Board of the following Scientific Journals: “Journal of Group Decision and Negotiation”, “Investigação Operacional” (Journal of the Portuguese OR Society), and ENGEVISTA (a Brazilian Journal). He is also member of the Editorial Board of the University of Coimbra Press. His current major interests of research are: multiple criteria decision aiding, multiobjective combinatorial problems, and management and planning of telecommunication networks.

José Manuel Fernandes Craveirinha is Full Professor in Telecommunications at the Department of Electrical Engineering Science of the University of Coimbra, Portugal, since 1997. He obtained the following degrees: undergraduate diploma in Electrical Engineering Science (E.E.S.) — Telecommunications & Electronics at IST, Lisbon Technical University, 1975; M.Sc. (1981) and Ph.D. in E.E.S at the University of Essex (UK) (1984) and “Agregado” (sim. to Doctor of Science) in E.E.S at the University of Coimbra (1996). Previous positions: Associate Professor and Assistant Professor at Coimbra Univ, Telecommunication R&D Engineer (CET-Portugal Telecom). He has coordinated a research group in Teletraffic Engineering & Network Planning at INESC-Coimbra R&D institute since 1986 and was director of this institute in 1994-99. He is author/co-author of more than 100 scientific/technical publications in teletraffic modelling, reliability analysis, and planning of telecommunication networks. His present interests are in traffic modelling and routing in Internet and multicriteria routing in multiservice networks.

Marta Margarida Braz Pascoal is Assistant Professor at the Mathematics Department of the Faculty of Science and Technology of the University of Coimbra. She obtained the undergraduate diploma in Mathematics — specialization in Computer Science at the University of Coimbra (1995), the Master of Science Degree in Applied Mathematics at the University of Coimbra (1998) and the Ph.D. in Mathematics — specialization in Applied Mathematics at the University of Coimbra (2005). Her current major interests of research are: ranking solutions of combinatorial problems and multi-objective combinatorial problems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Clímaco, J.C.N., Craveirinha, J.M.F. & Pascoal, M.M.B. An automated reference point-like approach for multicriteria shortest path problems. J. Syst. Sci. Syst. Eng. 15, 314–329 (2006). https://doi.org/10.1007/s11518-006-5015-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11518-006-5015-5

Keywords

Navigation