The purpose of this paper is to describe the development, implementation, and availability of a computer program for generating a variety of feasible network problems together with a set of benchmarked problems derived from it. The code "NETGEN" can generate capacitated and uncapacitated transportation and minimum cost flow network problems, and assignment problems. In addition to generating structurally different classes of network problems the code permits the user to vary structural characteristics within a class. Problems benchmarked on several codes currently available are provided in this paper since NETGEN will also allow other researchers to generate identical problems. In particular, the latter part of the paper contains the solution time and objective function value of 40 assignment, transportation, and network problems varying in size from 200 nodes to 8,000 nodes and from 1,300 arcs to 35,000 arcs.

This paper examines different algorithms for calculating the shortest path from one node to all other nodes in a network. More specifically, we seek to advance the state‐of‐the‐art of computer implementation technology for such algorithms and the problems they solve by exmining the effect of innovative computer science list structures and labeling techniques on algorithmic performance. The study shows that the procedures examined indeed exert a powerful influence on solution efficiency, with the identity of the best dependent upon the topology of the network and the range of the arc distance coefficients. The study further discloses, for the problems tested, that the lable‐setting shortest path algorithm previously documented as the most efficient is dominated for all problem structures examined by the new methods.

No abstract

No abstract

This paper develops a new polynomially bounded shortest path algorithm, called the partitioning shortest path (PSP) algorithm, for finding the shortest path from one node to all other nodes in a network containing no cycles with negative lengths. This new algorithm includes as variants the label setting algorithm, many of the label correcting algorithms, and the apparently computationally superior threshold algorithm.