IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i12p1959-1971.html
   My bibliography  Save this article

Bi-objective methods for road network problems with disruptions and connecting requirements

Author

Listed:
  • Yipeng Huang
  • Andréa Cynthia Santos
  • Christophe Duhamel

Abstract

Disruptions in urban roads can significantly alter the quality of the transportation network by generating more congestion, gas emission, noise, stress, etc. In some situations, it can even break the path between some pairs of nodes in the road network (strong connectivity in graph theory). To avoid this issue, traffic managers can temporarily change the orientation of some streets (arc reversal). In this study, we propose bi-objective methods for solving the bi-objective Unidirectional and bi-objective Multidirectional Road Network problems with Disruptions and connecting requirements (resp. bi-URND and bi-MRND). In bi-URND, the road network represents local networks such as city centers with narrow streets. In this case, a simple graph is used to model the transportation network. A more general urban network is addressed with bi-MRND by means of a multi-graph model. We propose an ϵ-constraint method to compute the Pareto-optimal fronts, using an up-to-date mathematical formulation and an NSGA-II. Both bi-objective methods are compared with two metaheuristics (a Biased Random Key Genetic Algorithm and an Iterated Local Search) proposed by Huang, Santos, and Duhamel (2019) and, including an aggregation of the two objective functions. Results are presented for simulated and realistic instances on Troyes city in France.

Suggested Citation

  • Yipeng Huang & Andréa Cynthia Santos & Christophe Duhamel, 2020. "Bi-objective methods for road network problems with disruptions and connecting requirements," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(12), pages 1959-1971, December.
    • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:12:p:1959-1971
    DOI: 10.1080/01605682.2019.1639479
    as

    Download full text from publisher

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:71:y:2020:i:12:p:1959-1971. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.