IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v33y2006i4p347-370.html
   My bibliography  Save this article

A Topological Method to Choose Optimal Solutions after Solving the Multi-criteria Urban Road Network Design Problem

Author

Listed:
  • Francesco Russo
  • Antonino Vitetta

Abstract

The paper proposes and applies a method for systematically sorting and reducing the number of different possible solutions to a network design problem (NDP). This is achieved first by defining a topological similarity measurement and then by applying cluster analysis. The NDP can be derived from the scientific literature. In general, the method consists of some models and subsequent algorithms that generate different solutions (enumerative, branch and bound, genetic, expert panel, ...) and evaluate for each solution an objective function (with deterministic or stochastic network assignment and with elastic or inelastic demand). The NDP, mainly in urban areas, needs multi-criteria evaluation and in each case a large set of non-dominated solutions is generated. In this paper, in order to select solutions and identify latent optimal network layouts, cluster analysis is carried out. The methodology utilises a “cluster” formation in relation to the solution topology and a “best” (representative) solutions extraction in relation to the criteria values. It can be utilised after solving the existing multi-criteria NDP and in other network problems, where the best solutions (for global or local network layouts) are extracted (with respect to the network topology) from a large set. The method is applied in a test system and on different real networks in two Italian towns, in order to analyse the goodness of the solution algorithm and assess its possible application to different networks. Copyright Springer 2006

Suggested Citation

  • Francesco Russo & Antonino Vitetta, 2006. "A Topological Method to Choose Optimal Solutions after Solving the Multi-criteria Urban Road Network Design Problem," Transportation, Springer, vol. 33(4), pages 347-370, July.
    • Handle: RePEc:kap:transp:v:33:y:2006:i:4:p:347-370
    DOI: 10.1007/s11116-005-3507-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11116-005-3507-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11116-005-3507-7?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.

    Citations

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


    Cited by:

    1. Agachai Sumalee & Simon Shepherd & Anthony May, 2009. "Road user charging design: dealing with multi-objectives and constraints," Transportation, Springer, vol. 36(2), pages 167-186, March.
    2. Russo, Francesco & Comi, Antonio, 2011. "A model system for the ex-ante assessment of city logistics measures," Research in Transportation Economics, Elsevier, vol. 31(1), pages 81-87.
    3. Les Foulds & Daniel Duarte & Hugo Nascimento & Humberto Longo & Bryon Hall, 2014. "Turning restriction design in traffic networks with a budget constraint," Journal of Global Optimization, Springer, vol. 60(2), pages 351-371, October.
    4. Afaf Haial & Loubna Benabbou & Abdelaziz Berrado, 2021. "Designing a Transportation-Strategy Decision-Making Process for a Supply Chain: Case of a Pharmaceutical Supply Chain," IJERPH, MDPI, vol. 18(4), pages 1-29, February.
    5. Gallo, Mariano & D'Acierno, Luca & Montella, Bruno, 2010. "A meta-heuristic approach for solving the Urban Network Design Problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 144-157, February.

    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:kap:transp:v:33:y:2006:i:4:p:347-370. 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: 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.