In view of the shortcomings in the existing research on the corridor allocation problem (CAP), in which the facility depth is always ignored and the logistics interaction points are always placed on the side line of the corridor, the CAP is extended according to the actual layout activities. A mixed integer programming model is constructed and an improved fireworks algorithm is proposed. In the improved algorithm, the explosion operation is discretized through a neighborhood construction method. The search depth and the two point mutation operation are set up to realize the variable neighborhood search. The greedy selection method is applied to update the population to memorize the elite solution. Furthermore, chaos mapping is introduced to initialize the fireworks population, and the threshold is set under the premise of high quality solution to accelerate optimization. Through comparing the results of mathematical programming with the proposed algorithm, the validity of the proposed model and the advantages of the presented algorithm are verified. Finally, the comparison experiments of different algorithms show that the improved fireworks algorithm has obvious advantages in optimization accuracy, convergence efficiency and stability.