IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/7591.html

Optimal redesign of the Dutch road network

Author

Listed:
  • Snelder, M.
  • Wagelmans, A.P.M.
  • Schrijver, J.M.
  • van Zuylen, H.J.
  • Immers, L.H.

Abstract

The Dutch national road network has been developed over several decades. In the past, roads were constructed according to the then current spatial and transportation planning philosophies. Because the existing road network is a result of a long process of successive developments, the question can be asked whether this network is the most appropriate from the current point of view, especially taking in consideration the current socio-economic structure of the Netherlands. To answer this question an optimization algorithm for designing road networks has been developed. With this algorithm the Dutch road network has been redesigned based on minimization of the travel and infrastructure costs and by taking into account the socio-economic structure of the Netherlands. A comparison between the existing network and the new design shows that the redesigned Dutch national road network has significantly lower total costs than the existing road network. It is found that the construction of less roads with more lanes on different locations leads to a reduction of the total travel time and the total vehicles kilometers traveled.

Suggested Citation

  • Snelder, M. & Wagelmans, A.P.M. & Schrijver, J.M. & van Zuylen, H.J. & Immers, L.H., 2005. "Optimal redesign of the Dutch road network," Econometric Institute Research Papers EI 2005-55, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    • Handle: RePEc:ems:eureir:7591
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/7591/ei2005-55.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Poorzahedy, Hossain & Turnquist, Mark A., 1982. "Approximate algorithms for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 16(1), pages 45-55, February.
    2. Chaisak Suwansirikul & Terry L. Friesz & Roger L. Tobin, 1987. "Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem," Transportation Science, INFORMS, vol. 21(4), pages 254-263, November.
    3. Abdulaal, Mustafa & LeBlanc, Larry J., 1979. "Continuous equilibrium network design models," Transportation Research Part B: Methodological, Elsevier, vol. 13(1), pages 19-32, March.
    Full references (including those not matched with items on IDEAS)

    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. Meng, Qiang & Yang, Hai, 2002. "Benefit distribution and equity in road network design," Transportation Research Part B: Methodological, Elsevier, vol. 36(1), pages 19-35, January.
    2. Meng, Q. & Yang, H. & Bell, M. G. H., 2001. "An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 83-105, January.
    3. Luathep, Paramet & Sumalee, Agachai & Lam, William H.K. & Li, Zhi-Chun & Lo, Hong K., 2011. "Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(5), pages 808-827, June.
    4. Wang, Shuaian & Meng, Qiang & Yang, Hai, 2013. "Global optimization methods for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 42-60.
    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.
    6. Ozgur Baskan, 2013. "Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    7. Joseph Y. J. Chow & Amelia C. Regan, 2011. "Real Option Pricing of Network Design Investments," Transportation Science, INFORMS, vol. 45(1), pages 50-63, February.
    8. Karimi Dehnavi, Hadi & Rezvan, Mohammad Taghi & Shirmohammadli, Abdolmatin & Vallée, Dirk, 2013. "A solution for urban road selection and construction problem using simulation and goal programming—Case study of the city of Isfahan," Transport Policy, Elsevier, vol. 29(C), pages 46-53.
    9. Gao, Ziyou & Wu, Jianjun & Sun, Huijun, 2005. "Solution algorithm for the bi-level discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 479-495, July.
    10. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    11. Dung-Ying Lin & Ampol Karoonsoontawong & S. Waller, 2011. "A Dantzig-Wolfe Decomposition Based Heuristic Scheme for Bi-level Dynamic Network Design Problem," Networks and Spatial Economics, Springer, vol. 11(1), pages 101-126, March.
    12. Chiou, Suh-Wen, 2005. "Bilevel programming for the continuous transport network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(4), pages 361-383, May.
    13. Giulio Cantarella & Antonino Vitetta, 2006. "The multi-criteria road network design problem in an urban area," Transportation, Springer, vol. 33(6), pages 567-588, November.
    14. Bastiaan Possel & Luc J. J. Wismans & Eric C. Berkum & Michiel C. J. Bliemer, 2018. "The multi-objective network design problem using minimizing externalities as objectives: comparison of a genetic algorithm and simulated annealing framework," Transportation, Springer, vol. 45(2), pages 545-572, March.
    15. Li, Changmin & Yang, Hai & Zhu, Daoli & Meng, Qiang, 2012. "A global optimization method for continuous network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1144-1158.
    16. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    17. Tan, Zhijia & Yang, Hai & Tan, Wei & Li, Zhichun, 2016. "Pareto-improving transportation network design and ownership regimes," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 292-309.
    18. Yang, Hai & Bell, Michael G. H., 2001. "Transport bilevel programming problems: recent methodological advances," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 1-4, January.
    19. Di, Zhen & Yang, Lixing, 2020. "Reversible lane network design for maximizing the coupling measure between demand structure and network structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    20. Di, Zhen & Yang, Lixing & Qi, Jianguo & Gao, Ziyou, 2018. "Transportation network design for maximizing flow-based accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 209-238.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:ems:eureir:7591. 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: RePub The email address of this maintainer does not seem to be valid anymore. Please ask RePub to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .

    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.