Optimization of Railway Mixed Goods Loading Layout considering Stability
Algorithm 5
Loading layout optimization overall algorithm.
Input Space set , mixed goods set , computation time , maximum number of blocks generated , effective volume fraction , goods block evaluation function parameters , the width coefficient and depth coefficient of the tree;
Output loading layout scheme .
(1)
Initialize the space as the rectangular space inside the vehicle, and classify the mixed goods set//call Algorithm 1
(2)
Judge the problem type with index and generate the set of heavy goods, middle goods and light goods blocks of the corresponding type//call algorithm 2 or 3
(3)
while there is computation time do
(4)
，
(5)
while do
(6)
if there is available efficient space in
(7)
Choose the space with the shortest distance in Manhattan
(8)
According to the evaluation function, select the top blocks from the block set//call Algorithm 4, place heavy goods blocks first, then middle goods blocks, then light goods blocks
(9)
if is the block that should be placed in the current layout space then
(10)
Put it at the corresponding angle of
(11)
Update ,, and goods block set
(12)
else the flag r is no longer selected until is updated again
(13)
end if
(14)
else break
(15)
end if
(16)
end while
(17)
Generate a loading layout scheme
(18)
if then
(19)
end if
(20)
//Double the iterative search, let continues to generate a new layout scheme
