IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v3y2006i3p225-244.html
   My bibliography  Save this article

A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance

Author

Listed:
  • Lúcia Martins
  • José Craveirinha
  • João Clímaco

Abstract

No abstract is available for this item.

Suggested Citation

  • Lúcia Martins & José Craveirinha & João Clímaco, 2006. "A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance," Computational Management Science, Springer, vol. 3(3), pages 225-244, July.
    • Handle: RePEc:spr:comgts:v:3:y:2006:i:3:p:225-244
    DOI: 10.1007/s10287-006-0014-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-006-0014-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10287-006-0014-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Namorado Climaco, Joao Carlos & Queiros Vieira Martins, Ernesto, 1982. "A bicriterion shortest path algorithm," European Journal of Operational Research, Elsevier, vol. 11(4), pages 399-404, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. José Craveirinha & Rita Girão-Silva & João Clímaco, 2008. "A meta-model for multiobjective routing in MPLS networks," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(1), pages 79-105, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiang Zhang & David Rey & S. Travis Waller & Nathan Chen, 2019. "Range-Constrained Traffic Assignment with Multi-Modal Recharge for Electric Vehicles," Networks and Spatial Economics, Springer, vol. 19(2), pages 633-668, June.
    2. Martins, Lucia & Craveirinha, Jose & Climaco, Joao N. & Gomes, Teresa, 2005. "On a bi-dimensional dynamic alternative routing method," European Journal of Operational Research, Elsevier, vol. 166(3), pages 828-842, November.
    3. Androutsopoulos, Konstantinos N. & Zografos, Konstantinos G., 2009. "Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network," European Journal of Operational Research, Elsevier, vol. 192(1), pages 18-28, January.
    4. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    5. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    6. Soroush, H.M., 2008. "Optimal paths in bi-attribute networks with fractional cost functions," European Journal of Operational Research, Elsevier, vol. 190(3), pages 633-658, November.
    7. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    8. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
    9. Zhang, Yuli & Shen, Zuo-Jun Max & Song, Shiji, 2016. "Parametric search for the bi-attribute concave shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 150-168.
    10. Dias, Luis C. & Climaco, Joao N., 2000. "Shortest path problems with partial information: Models and algorithms for detecting dominance," European Journal of Operational Research, Elsevier, vol. 121(1), pages 16-31, February.
    11. Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
    12. Sedeño-Noda, Antonio & Alonso-Rodríguez, Sergio, 2015. "An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 602-618.
    13. S. Raghavan & Michael O. Ball & Vinai S. Trichur, 2002. "Bicriteria product design optimization: An efficient solution procedure using AND/OR trees," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 574-592, September.
    14. Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
    15. Gomes da Silva, Carlos & Figueira, Jose & Climaco, Joao, 2007. "Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1656-1677, March.
    16. Bérubé, Jean-François & Gendreau, Michel & Potvin, Jean-Yves, 2009. "An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European Journal of Operational Research, Elsevier, vol. 194(1), pages 39-50, April.
    17. F. Guerriero & R. Musmanno, 2001. "Label Correcting Methods to Solve Multicriteria Shortest Path Problems," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 589-613, December.
    18. Frini, Anissa & Guitouni, Adel & Martel, Jean-Marc, 2012. "A general decomposition approach for multi-criteria decision trees," European Journal of Operational Research, Elsevier, vol. 220(2), pages 452-460.
    19. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
    20. Clímaco, João C.N. & Eugénia Captivo, M. & Pascoal, Marta M.B., 2010. "On the bicriterion - minimal cost/minimal label - spanning tree problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 199-205, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:comgts:v:3:y:2006:i:3:p:225-244. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.