The location-allocation model for multi-classification-yard location problem

This paper proposes a bi-level programming model for the multi-classification-yard location (MCYL) problem. The upper-level is intended to find an optimal establishment or improvement strategy for candidate nodes with a budget constraint, which is involved with the selection of potential yard locations and the determination of yard size and capacity. The lower-level aims to obtain the least costly plan of railcar reclassification considering yard classification capacity and tracks, on the basis of the strategy given by the upper-level. A simulated annealing (SA) algorithm is then applied to solve the MCYL problem of a large-scale China railway network.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01696464
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 3 2019 3:03PM