@article{oai:yamagata.repo.nii.ac.jp:00000574,
 author = {最首,  和雄},
 issue = {1},
 journal = {山形大学紀要.工学},
 month = {Jan},
 note = {論文(Article), When a traffic assignment minimizes total travel time, O-D flows are assigned optimum in the networks. It is reported how to minimize total travel timie. The highway netwerks are represented by a directed graph, G(V, E, T), where V, E and T represent sets of nodes, branches and functions of travel time of the branches respectively. The travel time of a branch e_k is a function 0f the traffiC Volume, so it is given by T_k (α_k). The capacity of e_k is C(e_k). If we assume W_k(α_k) as follows ;　W_k(α_k) = d (T_k(α_k).α_k)/dα_k,　then dW_k(α_k)/dα_k is obtained to be positive in 0　If V = {v_i}, E = {e_k}, then e_k = (v_i, v_j) is a directed branch from v_t to v_j, where v_i represents initial node and v_j terminal node respectively. G_i is a subgraph of G. If there is no directed cycle and only one node which is not a terminal node for all branches in the subgraph, then G_t is defined a unididirectional graph. The author studies the elegant solution to minimize total travel time in G_t when a unidirectional graph is selected suitably. When someunidirectional graphs are obtained from the set of chains which have shorter travel time, the traffic assignments are computed for some of G_i, and the optimum assignment is selected so a traftic assignment that have minimum total travel time among them.},
 pages = {129--145},
 title = {道路網における交通流配分},
 volume = {12},
 year = {1972}
}