IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v9y2010i3p287-305.html
   My bibliography  Save this article

Efficient solution generation for the bicriterion shortest path problems

Author

Listed:
  • Abdallah W. Aboutahoun

Abstract

In this paper, we present an algorithm to compute the set of all efficient extreme solutions in the objective space for the biobjective shortest path problem (BSPP). A simplex-based algorithm that generates all the efficient extreme points and edges in the objective space rather than the decision space is developed. Since not every extreme point of the decision space corresponds to an extreme point of the objective space, the number of these efficient extreme points in the objective space cannot exceed that of the decision space. Since the coefficient matrix associated with the flow conservation equations is totally unimodular for the BSPP, the efficient frontier is the non-dominated set of its continuous relaxation.

Suggested Citation

  • Abdallah W. Aboutahoun, 2010. "Efficient solution generation for the bicriterion shortest path problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 9(3), pages 287-305.
    • Handle: RePEc:ids:ijores:v:9:y:2010:i:3:p:287-305
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=35522
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijores:v:9:y:2010:i:3:p:287-305. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.