scholarly journals The Reversible Lane Network Design Problem (RL-NDP) for Smart Cities with Automated Traffic

2020 ◽  
Vol 12 (3) ◽  
pp. 1226 ◽  
Author(s):  
Lígia Conceição ◽  
Gonçalo Homem de Almeida Correia ◽  
José Pedro Tavares
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Traffic Assignment ◽  
Smart Cities ◽  
User Equilibrium ◽  
Sustainable Transportation ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Travel Times ◽  
The City

With automated vehicles (AVs), reversible lanes could be a sustainable transportation solution once there is vehicle-to-infrastructure connectivity informing AVs about the lane configuration changes. This paper introduced the reversible lane network design problem (RL-NDP), formulated in mixed-integer non-linear mathematical programming—both the traffic assignment and the reversible lane decisions were embedded. The model was applied on an hourly basis in the case study of the city of Delft, the Netherlands. Reversible lanes are examined under no traffic equilibrium (former paths are maintained); user-equilibrium (UE) assignment (AVs decide their own paths); and system-optimum (SO) traffic assignment (AVs are forced to follow SO paths). We found out that reversible lanes reduce congested roads, total travel times, and delays up to 36%, 9%, and 22%, respectively. The SO scenario was revealed to be beneficial in reducing the total travel time and congested roads in peak hours, whereas UE is equally optimal in the remaining hours. A dual-scenario mixing SO and UE throughout the day reduced congested roads, total travel times, and delay up to 40%, 8%, and 19%, respectively, yet increased 1% in travel distance. The spatial analysis suggested a substantial lane variability in the suburbs, yet a strong presence of reversible lanes in the city center.

scholarly journals Multi-Period Network Design Problem in Regional Hazardous Waste Management Systems

2019 ◽  
Vol 16 (11) ◽  
pp. 2042 ◽  
Author(s):  
Jun Zhao ◽  
Lixiang Huang
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Planning Horizon ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Hazardous Wastes ◽  
Total Risk ◽  
Total Cost ◽  
Treatment And Disposal

The management of hazardous wastes in regions is required to design a multi-echelon network with multiple facilities including recycling, treatment and disposal centers servicing the transportation, recycling, treatment and disposal procedures of hazardous wastes and waste residues. The multi-period network design problem within is to determine the location of waste facilities and allocation/transportation of wastes/residues in each period during the planning horizon, such that the total cost and total risk in the location and transportation procedures are minimized. With consideration of the life cycle capacity of disposal centers, we formulate the problem as a bi-objective mixed integer linear programming model in which a unified modeling strategy is designed to describe the closing of existing waste facilities and the opening of new waste facilities. By exploiting the characteristics of the proposed model, an augmented ε -constraint algorithm is developed to solve the model and find highly qualified representative non-dominated solutions. Finally, computational results of a realistic case demonstrate that our algorithm can identify obviously distinct and uniformly distributed representative non-dominated solutions within reasonable time, revealing the trade-off between the total cost and total risk objectives efficiently. Meanwhile, the multi-period network design optimization is superior to the single-period optimization in terms of the objective quality.

Research on Uncertain Network Design Problem

2014 ◽  
Vol 505-506 ◽  
pp. 613-618
Author(s):  
Yang Wang ◽  
Jin Xin Cao ◽  
Ri Dong Wang ◽  
Xia Xi Li
Keyword(s):  
Stochastic Model ◽  
Network Design ◽  
Design Problem ◽  
User Equilibrium ◽  
Network Design Problem ◽  
Construction Costs ◽  
Travel Costs ◽  
Uncertain Network ◽  
Level Model ◽  
Discrete Network Design Problem

In this study, a kind of uncertain network design problem, network design problem under uncertain construction cost, is researched.The discrete network design problem under uncertain construction costs deals with the selection of links to be added to the existing network, so as to minimize the total travel costs in the network. It is assumed that the value of the demand between each pair of origin and destination is a constant and the construction costs of each potential link addition follow a certain stochastic distribution. In this paper, a bi-level and stochastic programming model for the discrete network design problem is proposed. The construction costs of potential links are assumed as random variables and mutually independent with each other in this model. The upper-level model is a chance constrain model with the objective function of minimizing the total travel costs in the network, and the lower-level model is a user equilibrium model. The stochastic model is then transformed into a deterministic one. A branch-and-bound solution algorithm is designed to solve the deterministic model in an efficient way. At last, a computational experiment is conducted to illustrate the effectiveness and efficiency of the approach proposed in this paper. The results show that the stochastic model is more flexible and practical compared with the deterministic one.

scholarly journals Some Computational Insights on the Optimal Bus Transit Route Network Design Problem

2012 ◽  
Vol 47 (3) ◽  
Author(s):  
Wei (David) Fan ◽  
Randy B. Machemehl
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Large Scale ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Research Experiences ◽  
Bus Transit ◽  
Route Network ◽  
Transit Route ◽  
Demand Aggregation

The objective of this paper is to present some computational insights based on previous extensive research experiences on the optimal bus transit route network design problem (BTRNDP) with zonal demand aggregation and variable transit demand. A multi-objective, nonlinear mixed integer model is developed. A general meta-heuristics-based solution methodology is proposed. Genetic algorithms (GA), simulated annealing (SA), and a combination of the GA and SA are implemented and compared to solve the BTRNDP. Computational results show that zonal demand aggregation is necessary and combining metaheuristic algorithms to solve the large scale BTRNDP is very promising.

scholarly journals Application of Bat Algorithm for Transport Network Design Problem

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Sweta Srivastava ◽  
Sudip Kumar Sahana
Keyword(s):  
Network Design ◽  
Travel Time ◽  
Design Problem ◽  
Wait Time ◽  
Development Planning ◽  
User Equilibrium ◽  
Transport Network ◽  
Network Design Problem ◽  
Soft Computing Techniques ◽  
Transport Network Design

The requirement of the road services and transportation network development planning came into existence with the development of civilization. In the modern urban transport scenario with the forever mounting amount of vehicles, it is very much essential to tackle network congestion and to minimize the travel time. This work is based on determining the optimal wait time at traffic signals for the microscopic discrete model. The problem is formulated as a bilevel model. The upper layer optimizes the travel time by reducing the wait time at traffic signal and the lower layer solves the stochastic user equilibrium. Soft computing techniques like Genetic Algorithms, Ant Colony Optimization, and many other biologically inspired techniques prove to give good results for bilevel problems. Here this work uses Bat Intelligence to solve the transport network design problem. The results are compared with the existing techniques.

scholarly journals A Branch-and-Price Algorithm for the Liner Shipping Network Design Problem

2020 ◽  
Vol 1 (4) ◽  
Author(s):  
Kristian Thun ◽  
Henrik Andersson ◽  
Magnus Stålhane
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Computational Study ◽  
Liner Shipping ◽  
Maritime Transportation ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Specific Class ◽  
Branch And Price ◽  
Price Algorithm

AbstractMaritime transportation is the backbone of the global economy and one of its most important segments is liner shipping. To design a liner shipping network is notoriously difficult but also very important since an efficient network can be the difference between prosperity and bankruptcy. In this paper, we propose a branch-and-price algorithm for the liner shipping network design problem, which is the problem of designing a set of cyclic services and to deploy a specific class of vessels to each service so that all demand can flow through the network at minimal cost. The proposed model can create services with a complex structure and correctly calculate the transshipment cost. The formulation of the master problem strengthens a known formulation with valid inequalities. Because of multiple dependencies between ports that are not necessarily adjacent and no defining state at any of the ports, the subproblem is formulated and solved as a mixed integer linear program. Strategies to improve the solution time of the subproblem are proposed. The computational study shows that the algorithm provides significantly tighter lower bounds in the root node than existing methods on a set of small instances.

scholarly journals Continuous Network Design Based on the Paired Combinatorial Logit Stochastic User Equilibrium Model

2014 ◽  
Vol 8 (1) ◽  
pp. 316-322
Author(s):  
Xuefei Li ◽  
Maoxiang Lang
Keyword(s):  
Network Design ◽  
Objective Function ◽  
Equilibrium Model ◽  
Design Problem ◽  
Programming Model ◽  
User Equilibrium ◽  
Network Design Problem ◽  
Stochastic User Equilibrium ◽  
Level Model ◽  
The Impact

In order to design the traffic network more accurately, the bi-level programming model for the continuous network design problem based on the paired combinatorial Logit stochastic user equilibrium model is proposed in this study. In the model, the paired combinatorial Logit stochastic user equilibrium model which is used to characterize the route choice behaviors of the users is adopted in the lower level model, and the minimum summation of the system total costs and investment amounts is used in the upper objective function. The route-based self-regulated averaging (SRA) algorithm is designed to solve the stochastic user equilibrium model and the genetic algorithm (GA) is designed to get the optimal solution of the upper objective function. The effectiveness of the proposed combining algorithm which contains GA and SRA is verified by using a simple numerical example. The solutions of the bi-level models which use the paired combinatorial Logit stochastic user equilibrium model in the lower level model with different demand levels are compared. Finally, the impact of the dispersion coefficient parameter which influences the decision results of the network design problem is analyzed.

Sign in / Sign up

Export Citation Format

Share Document