PRIMAL-DUAL TRAFFIC ASSIGNMENT ALGORITHM

被引：12

作者：

PETERSEN, ER ^{[1
]}

机构：

[1] QUEENS UNIV,SCH BUSINESS,KINGSTON,ONTARIO,CANADA

来源：

MANAGEMENT SCIENCE | 1975年 / 22卷 / 01期

关键词：

D O I：

10.1287/mnsc.22.1.87

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A new algorithm for solving the traffic assignment problem is presented. This is a primal-dual algorithm which utilizes a flow augmentation primal and a shortest path dual procedure. At each iteration a feasible solution is known together with a measure of ″goodness″ of the solution. It is shown that the algorithm converges to an optimal solution. Experience with the algorithm suggests that this convergence is very rapid.

引用

页码：87 / 95

页数：9

共 22 条

[1]

ALMOND J, 1965, 3RD INT S THEOR TRAF, P222

[2]

BECKMANN MJ, 1967, TRAFFIC QUART, V21, P109

[3]

Bureau of Public Roads, 1964, TRAFF ASS MAN

[4]

CLOUTIER JE, 1971, 711 QUEENS U SCH BUS

[5]

Dafermos SC., 1971, TRANSPORT SCI, V5, P366

[6]

Ford L. R., 1962, FLOWS NETWORKS

[7]

FULLERTON HV, 1972, 723 QUEENS U SCH BUS

[8]

HAMILTON CW, 1967, BATTELLE TECHNICAL R, V16, P6

[9] MINIMUM-COST FLOWS IN CONVEX-COST NETWORKS [J].

HU, TC .

NAVAL RESEARCH LOGISTICS QUARTERLY, 1966, 13 (01) :1-&

[10]

IRWIN NA, 1962, 347 NAT RES COUNC HI

← 1 2 3 →