Search

Showing total 2 results
2 results

1. Analysis of Algorithms for the Zero-One Programming Problem.

Author

Gue, Ronald L., Liggett, John C., Cain, Kenneth C., and Emery, J.

Subjects
*COMPUTER programming, *ALGORITHMS, *PROBLEM solving, *ELECTRONIC data processing, *INFORMATION storage & retrieval systems, *MATHEMATICAL analysis
Abstract

This paper is concerned with a review and examination of several existing algorithms for the zero-one programming problem. Computational experience is summarized. The machine time and storage requirements of several of the algorithms are compared over several test problems of small and intermediate size. Computer experiments still provide little hope of solving problems with over 100 variables with a reasonable amount of machine time. [ABSTRACT FROM AUTHOR]

Published
1968
Full Text
View/download PDF

2. An Algorithm for the Traffic Assignment Problem.

Author

Nguyen, Sang

Subjects
*TRAFFIC assignment, *TRAFFIC estimation, *TRANSPORTATION, *MATHEMATICAL models, *PROBLEM solving, *ALGORITHMS, *ORIGIN & destination traffic surveys
Abstract

The traffic assignment problem associated with a given transportation network is the process of distributing zone-to-zone trips on links of the network. A number of methods have been proposed to solve this problem, but none have been found to be entirely satisfactory. This paper is concerned with the nonlinear mathematical model of the problem, where the link-traveling costs are increasing functions of the link flows and no explicit capacity constraint is imposed on individual links. An efficient algorithm is developed, using a node-arc formulation of the problem. It is an adaptation of the convex-simplex method that takes advantage of the very special network structure of the traffic assignment problem formulated in this way. Numerical results obtained with a moderate size street network are presented. [ABSTRACT FROM AUTHOR]

Published
1974
Full Text
View/download PDF