Optimizing reserve capacity of urban road networks in a discrete Network Design Problem

• Published in: Advances in engineering software (1992) 2011-12, Vol.42 (12), p.1041-1050
• Main Authors: Miandoabchi, Elnaz, Farahani, Reza Zanjirani
• Format: Article
• Language: English
• Subjects: Allocations; Bi-level programming; Lane addition; Lanes; Mathematical models; Metaheuristics; Networks; One-way streets; Optimization; Reserve capacity; Roads; Streets; Urban road network design
• ISSN: 0965-9978
• DOI: 10.1016/j.advengsoft.2011.07.005

► We address designing of street directions and lane additions in urban road networks. ► We study lane allocation in two-way streets with and without symmetry restrictions. ► We develop a bi-level mathematical model which maximizes network reserve capacity. ► We propose two hybrid metaheuristic algorithms to solve the problem. ► Computational results indicate that hybrid genetic algorithm performs better. This paper addresses the problem of designing of street directions and lane additions in urban road networks, based on the concept of reserve capacity. Reserve capacity is identified by the largest multiplier applied to a given existing demand matrix, that can be allocated to a network without violating the arc capacities. Having a two-way streets base network and the allowable street lane additions, the problem is to find the optimum configuration of street directions and two-way street lane allocations, and the optimum selection of street lane addition projects, in a way that the reserve capacity of the network is maximized. The problem is considered in two variations; in the first variation no restriction is imposed on the symmetricity of lane allocations for two-way streets, and in the second variation, two-way street lane allocations are restricted to be symmetric. The proposed problems are modeled as mixed-integer bi-level mathematical problems. A hybrid genetic algorithm and an evolutionary simulated annealing algorithm are proposed to solve the models. Computational results for both problem variations are presented.