Abstract

For a long time, many researchers have investigated the continuous network design problem (CNDP) to distribute equitably additional capacity between selected links in a road network, to overcome traffic congestion in urban roads. In addition, CNDP plays a critical role for local authorities in tackling traffic congestion with a limited budget. Due to the mutual interaction between road users and local authorities, CNDP is usually solved using the bilevel modeling technique. The upper level seeks to find the optimal capacity enhancements of selected links, while the lower level is used to solve the traffic assignment problem. In this study, we introduced the enhanced differential evolution algorithm based on multiple improvement strategies (EDEMIS) for solving CNDP. We applied EDEMIS first to a hypothetical network to show its ability in finding the global optimum solution, at least in a small network. Then, we used a 16-link network to reveal the capability of EDEMIS especially in the case of high demand. Finally, we used the Sioux Falls city network to evaluate the performance of EDEMIS according to other solution methods on a medium-sized road network. The results showed that EDEMIS produces better solutions than other considered algorithms, encouraging transportation planners to use it in large-scale road networks.

Highlights

  • The continuous network design problem (CNDP) can be defined as “determining optimal capacity enhancements of selected links under budget constraints in a given road network”

  • In terms of CNDP based on SUE traffic assignment, the first study was presented by Davis [22], in which two different methods considering the effect of a stochastic user equilibrium were proposed for solving CNDP, and they were applied to several test networks

  • The evolution algorithm based on multiple improvement strategies (EDEMIS) algorithm has been presented to solve CNDP, which is formulated as a bilevel programming model

Read more

Summary

INTRODUCTION

The continuous network design problem (CNDP) can be defined as “determining optimal capacity enhancements of selected links under budget constraints in a given road network”. In CNDP, upper level can be formulated as the sum of total travel time and expenditures of investment for capacity enhancement in a given road network, while the lower level is defined as a deterministic (DUE) or stochastic user equilibrium (SUE) traffic assignment [1]. In terms of CNDP based on SUE traffic assignment, the first study was presented by Davis [22], in which two different methods considering the effect of a stochastic user equilibrium were proposed for solving CNDP, and they were applied to several test networks. Du and Wang [24] proposed the generalized geometric programming method to achieve the global solution for CNDP by considering both DUE and SUE assumptions As another type of road network design problems, the discrete network design problem (DNDP) with SUE constraint has been studied by Chen and Alfa [25].

BILEVEL PROGRAMMING MODEL
Classical DE for CNDP
DE improvement strategies
EDEMIS
Sioux Falls network
Findings
CONCLUSIONS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call