Robust Multi-Criteria Traffic Network Equilibrium Problems with Path Capacity Constraints

With the progress of society and diversification transportation modes, people are faced with more complicated travel choices, thus, multi-criteria route choosing optimization problems have drawn increased attention in recent years. A number traffic network equilibrium been proposed, but most them do not involve data uncertainty nor computational methods. This paper focuses on methods for solving robust path capacity constraints. The concepts vector respect to worst case introduced, respectively. For equilibrium, an equivalent min–max problem is constructed. direct search algorithm, which step size without derivatives redundant parameters, proposed this problem. In addition, we construct a smoothing based variant version ReLU activation function compute weak flows then find by using heaviside function. Finally, extensive numerical examples given illustrate excellence our algorithms compared existing algorithms. It shown that algorithm may take less time method can effectively generate subset case.