PURPOSES : This study aims to develop an algorithm to solve the user equilibrium traffic assignment problem using soft link capacity constraints. This model is used to relax the hard capacity constraints model.
METHODS : In the traffic assignment model that imposes the hard capacity constraints, the well-known solution algorithms used are the augmented Lagrange multiplier method and the inner penalty function method. The major drawback of using the hard-capacity constraint model is the feasible solution issue. If the capacities in the network are not sufficient to absorb the flow from the diverged flows through the hard capacity constraints, it might result in no solution; whereas, using a soft capacity constraint model guarantees a feasible solution because the soft capacity constraint model uses the penalization of constraint violation in the objective function. In this study, the gradient projection (GP) algorithm was adapted.
RESULTS : Two numerical experiments were conducted to demonstrate the features of the soft capacity constraint model and the computational performance of the solution algorithm. The results revealed that imposing the soft link capacity constraints can ensure convergence. CONCLUSIONS : The proposed model can be easily extended by considering other traffic assignment models, for e.g., non-additive traffic equilibrium problem, stochastic traffic equilibrium model, and, elastic demand traffic equilibrium problem. Furthermore, the model can exist regardless of the sufficient capacity for each O-D pair to cater to their demands.

ABSTRACT
1. 서론
2. 용량제약 통행배정 모델
    2.1. 하드 용량 제약 모델
    2.2. 소프트 용량 제약 모델
3. 풀이 알고리즘
    3.1. Gradient projection(GP) method
    3.2. 알고림즘 절차
4. 용량제약 통행배정 결과
    4.1. 가상의 네트워크
    4.2. 중규모 네트워크(Winnipeg Network)
5. 결론
REFERENCES

• 류승규(한국과학기술정보연구원) | Ryu Seungkyu (Korea Institute Science Technology Information) 교신저자