Hybrid integer-coded Wolf Pack Algorithm for multiple-type flatcars loading problem

This paper presents an efficient hybrid integer-coded Wolf Pack Algorithm (HICWPA) for multiple-type flatcars loading problem. The multiple-type flatcars loading problem aims at loading a given set of multi-size vehicles on the multiple-type railway flatcars so that the length utilization ratio of flatcars is maximized. The algorithm introduced in this paper is based on three important operations. First, an integer coding method of individual sequence is designed to express the usage order of flatcars. The integer-coded Wolf Pack Algorithm (ICWPA) is responsible for searching the optimal individual coding sequence wildly to improve the probability of achieving the approximated optimal solution. Second, the Best Fit Decreasing (BFD) algorithm is used to decode the individual coding sequences and load the vehicles on flatcars to generate initial loading plan. Third, a moving operator is designed to repair the infeasible loading sequences by reassigning the individual coding bits which can improve the convergence speed of the proposed algorithm. The effectiveness and advancement of HICWPA are verified by a practical instance of multiple-type flatcars loading problem. The computational results indicate that the flatcars length utilization ratio of the authors' algorithm outperforms current excellent algorithms for the considered problem.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01762396
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 20 2021 1:56PM