NETWORK DESIGN WITH FIXED AND VARIABLE COST ELEMENTS

A route selection algorithm is presented for designing transportation networks. The algorithm balances fixed construction costs and variable user costs in a network having a fixed set of modes and a known demand for internode service. The problem solved is a special case of the fixed-cost, multicommodity transshipment problem in which each commodity has a single, unique source node. The route selection algorithm alternatively applies link elimination and link insertion criteria that converge to a local optimum.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Authors:
  • Billheimer, J W
• Publication Date: 1973-2

Media Info

• Features: References;
• Pagination: p. 49-74
• Serial:
  • Transportation Science
  • Volume: 7
  • Issue Number: 1
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Freight service; Networks
• Subject Areas: Freight Transportation; Railroads;

Filing Info

• Accession Number: 00047394
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Dec 13 1973 12:00AM