TRANSPORTATION SCHEDULING ALGORITHM

An heuristic scheduling algorithm for a transportation network directed by a single manager who has advance knowledge of shipments is described. The algorithm is easy to use and can incorporate various constraints such as maintenance, convoys, etc. ''Optimum'' scheduling with binary or linear programming cannot incorporate these constraints. Using Monte Carlo simulations of a system being considered for nuclear material transportation, a comparison was made between network cost using the algorithm and cost using linear programming optimization. The algorithm was found to be trivially suboptimal in all cases tested. Because it is simple, only slightly suboptimal, and capable of considering real-world constraints, the report suggests that this algorithm be used in operating transportation network systems.

  • Corporate Authors:

    SANDIA LABORATORIES

    ALBUQUERQUE, NM  USA 
  • Authors:
    • Aronson, E A
  • Publication Date: 1975-7

Media Info

  • Pagination: 35 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00094654
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Contract Numbers: AT(29-1)-789
  • Files: TRIS
  • Created Date: May 14 1976 12:00AM