SHUNTING WAGONS WITH A MINIMUM OF EFFORT

DAS RANGIEREN DURCH UMSETZEN MIT DEM GERINGSTEN AUFWAND

Every day at stations without a humping yard a mixture of goods wagons are shunted about with train or shunting locomotives until wagon groups for common destinations and in a predetermined order are obtained. In order to obtain the required order there are usually several, and often many possibilities with respect to extent and sequency of the shunting movements, and these differ substantially in the effort involved. Finding the shunting programme required to make up a wagon group in the shortest time and with the least effort exceeds human capacity even when only a few wagons are to be classified, so that the optimal shunting programme cannot be found with certainty. A mathematical solution to the problem has not so far been found. The optimal solution in each case can be found, however, with the aid of EDP, for this allows an indeterminate number of alternatives to be compared. The author describes the requirements for the selection of reasonable alternatives and presents a notional classification diagram as basis of programming for finding the optimal solution. The method is illustrated by means of two examples.

  • Supplemental Notes:
    • Also published in English, French and Spanish.
  • Corporate Authors:

    Hestra Verlag

    Holzhofallee 33, Postfach 4244
    6100 Darmstadt 1,   Germany 
  • Authors:
    • Zehme, I
  • Publication Date: 1978-4

Language

  • German

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00178688
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jul 19 1978 12:00AM