A meta-heuristic approach for solving the Urban Network Design Problem

Gallo, Mariano; D’Acierno, Luca; Montella, Bruno

doi:10.1016/j.ejor.2009.02.026

Cited by 73 publications

(49 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this paper, a hybrid scatter search (HSS) algorithm is developed to solve the proposed problem because of the complexity and non-convexity of MNDPs. In the literature, Gallo et al (2010) used scatter search to solve their problem, but there are some significant differences between these two works: firstly, our model is more complicated because of adding street capacity expansion as a discrete variable and also incorporating the reserve capacity concept in the problem; besides, the proposed model in Gallo et al (2010) did not consider capacity constraints which made their solution procedure easier. We propose a hybrid scatter search embedding a golden section search method in the scatter search algorithm to cope with capacity constraints in MNDPs.…”

Section: Accepted M M a N U mentioning

confidence: 99%

“…They showed that this algorithm is capable for finding good solutions in large-scale problems within a reasonable time. Gallo et al (2010) used this method for solving a directed network design problem.…”

Section: First Step Of the Algorithmmentioning

confidence: 99%

“…Initial solutions set generation Generate a set of diverse, feasible and connected solutions from the current network design using the diversification generation method applied in Gallo et al (2010). A diverse solution is generated by changing the design of predefined number of links, in which the number translates into the distance of the generated solution from the current network.…”

Section: First Step Of the Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Mixed network design using hybrid scatter search

Khooban¹,

Farahani

Miandoabchi³

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

This research proposes a bi-level model for the mixed network design problem (MNDP). The upper level problem involves redesigning the current road links' directions, expanding their capacity, and determining signal settings at intersections to optimize the reserve capacity of the whole system.The lower level problem is the user equilibrium traffic assignment problem. By proving that the optimal arc flow solution of the bi-level problem must exist in the boundary of capacity constraints, an exact line search method called golden section search is embedded in a scatter search method for solving this complicated MNDP. The algorithm is then applied to some real cases and finally, some conclusions are drawn on the model's efficiency.

show abstract

Section: Accepted M M a N U mentioning

confidence: 99%

Section: First Step Of the Algorithmmentioning

confidence: 99%

Section: First Step Of the Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Mixed network design using hybrid scatter search

Khooban¹,

Farahani

Miandoabchi³

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…However, continuous variables do not necessarily indicate the changes that are practical, because road capacity is normally measured by the number of lanes. Hence, despite the fact that it may be more computationally expensive, the discrete network design problem (DNDP) with solely discrete variables (see [14][15][16][17][18][19][20][21][22]) and the mixed network design problem (MNDP) with both continuous and discrete variables (see [23][24][25][26]) are still worth investigating.…”

Section: Network Design Problemmentioning

confidence: 99%

Time-Dependent Transportation Network Design considering Construction Impact

Song

Zhang

2018

Journal of Advanced Transportation

View full text Add to dashboard Cite

A traditional discrete network design problem (DNDP) always assumes transportation infrastructure projects to be one-time events and ignores travelers' delays caused by construction work. In fact, infrastructure construction usually lasts for a long time, and the impact on traffic can be substantial. In this paper, we introduce time dimension into the traditional DNDP to explicitly consider the impact of road construction and adopt an overtime policy to add flexibility to construction duration. We address the problem of selecting road-widening projects in an urban network, determining the optimal link capacity, and designing the schedule of the selected projects simultaneously. A time-dependent DNDP (T-DNDP) model is developed with the objective of minimizing total weighted net user cost during the entire planning horizon. An active-set algorithm is applied to solve the model. A simple example network is first utilized to demonstrate the necessity of considering the construction process in T-DNDP and to illustrate the tradeoff between the construction impact and the benefit realized through capacity extension. We also solve the T-DNDP model with data from the Sioux Falls network, which contains 24 nodes, 76 links, and 528 origin-destination (O-D) pairs. Computational results for the problem are also presented.

show abstract

“…Lane addition was considered in the studies as a yes-no decision among other decisions such as road resurfacing, or improving the capacity of existing lanes (e.g., LeBlanc 1975). Street orientation and in some cases in combination with signal timings were under focus in a number of works (e.g., Roberts and Xu 1988, 1989, 1992Lee and Yang 1994;Drezner and Wesolowsky 1997;Salhi 2000, 2002;Gallo et al 2010). Lane reallocation in streets in peak periods has been considered in Zhang and Gao (2007), and lane allocation and street orientation along with signal timing and parking lane allocation were investigated in .…”

Section: Introductionmentioning

confidence: 99%

Bi-objective bimodal urban road network design using hybrid metaheuristics

Miandoabchi

Farahani

Szeto

2011

Cent Eur J Oper Res

View full text Add to dashboard Cite

In this paper a bimodal discrete urban road network design problem with bus and car modes is investigated. The problem consists of decision making for lane addition to the existing streets, new street constructions, converting some two-way streets to one-way streets, lane allocation for two-way streets, and the allocation of some street lanes for exclusive bus lanes. Two objectives are considered in the problem: maximization of consumer surplus, and maximization of the demand share of the bus mode. The interaction of automobile and bus flows are explicitly taken into account and a modal-split/assignment model is used to obtain the automobile and bus flows in the deterministic user equilibrium state. The main contribution of the paper lies in proposing a new network design problem that combines the road network design decisions with the decision making for bus networks. The problem is formulated as a mathematical program with equilibrium constraints. A hybrid of genetic algorithm and simulated annealing, a hybrid of particle swarm optimization and simulated annealing, and a hybrid of harmony search and simulated annealing are proposed to solve the problem. Computational results for a number of test networks are presented and investigated.Keywords Bimodal network design · Multi-objective · Elastic demand · Hybrid metaheuristics · Exclusive bus lanes

show abstract

A meta-heuristic approach for solving the Urban Network Design Problem

Cited by 73 publications

References 42 publications

Mixed network design using hybrid scatter search

Mixed network design using hybrid scatter search

Time-Dependent Transportation Network Design considering Construction Impact

Bi-objective bimodal urban road network design using hybrid metaheuristics

Contact Info

Product

Resources

About