A stochastic user equilibrium assignment problem in discrete network design problem (Q2627726)

Summary: We formulate the transportation discrete network design problem (DNDP) as a mixed-integer bi-level mathematical problem, based on the concept reserve capacity. The upper level goal programme maximises the reserve capacity by designing the direction of street and increasing the street capacity through lane addition. The lower level problem is stochastic user equilibrium traffic assignment problem within a probit-based path choice decision framework which generates user equilibrium flow patterns. Because of non-convexity nature of the model, meta-heuristic methods used to solve the problem and we used Monte Carlo simulation approach to compute path choice probabilities and stochastic user equilibrium solved by method of successive averages. A hybrid genetic algorithm with simulated annealing and an evolutionary simulated annealing algorithm are proposed. Numerical examples are presented to verify the proposed model and algorithm.