Model and Algorithm for Wagons' Placing-In and Taking-Out Problem in Railway Station

Taking the locomotive running time between goods operation sites as weights, wagons' placing-in and taking-out problems can be regarded as a single machine scheduling problem 1| pij | Cij, which can be transformed into a shortest cycle problem of Hamilton graph whose relaxation problem is assignment problem. Firstly, the authors use a Hungarian algorithm to calculate the optimal solution of the assignment problem. Then, the authors provide a Broken-circle and Connection method to find the available order of placing-in and taking-out wagons. The complexity of the algorithm is O(n²). Extensive problems -- such as placing-in and transferring combined or taking-out and transferring combined, placing-in and taking-out combined, placing-in, transferring and taking-out combined -- can also be resolved with the modified model and algorithm. Finally, an instance is given to illustrate the model and the algorithm's reliability and efficiency.


  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 1628-1640
  • Monograph Title: CICTP 2014: Safe, Smart, and Sustainable Multimodal Transportation Systems

Subject/Index Terms

Filing Info

  • Accession Number: 01532350
  • Record Type: Publication
  • ISBN: 9780784413623
  • Files: TRIS, ASCE
  • Created Date: Jul 2 2014 3:03PM