Previous Multi-Agent Path Finding (MAPF) solvers rely on several simplifying assumptions. They consider the agents as holonomic robots and ignore the agent's size. There are two main directions of MAPF research. One is about MAPF's own shortcoming, how to improve the efficiency of the existing algorithm and the quality of the solution. The other direction is how to deal with diverse constraints brought by different cases when applying MAPF to practical problems. In this paper, the latter direction for solving the handling problem of forklifts in the roadway is more focused on. Firstly, we define MAPF for forklift robot which considers the agent's size and the topological paths as vertices. Secondly, we exploit the advantages of ECBS to make PBS runs faster with a bounded suboptimal solution. Then, we propose an acceleration strategy for collision detection, which is an important factor limiting the speed of the entire algorithm. Finally, we use the weighted low-level search to speed up calculation. The above series of improvements have enabled the MAPF algorithm to be applied in our real scenarios.