A Bi-Objective Capacitated Location-Routing Problem for Multiple Perishable Commodities

This paper studies the location-routing problem of big event logistics. We propose a mathematical model framework, which considers many aspects of logistics network design for big event, some of which have not received enough attention in the literature. Aspects to be considered include: multi-commodity, perishability of goods, combined storage strategy, vehicle capacity limitation, multi-vehicle, multi-point distribution, etc. In addition, while constructing the bi-objective model with the shortest total distribution time and the lowest total cost, the objective weight coefficients are set up according to the sensitivity of different perishable commodities to time and cost, and the sensitive types of each commodity are discussed. In terms of solving solution, the model is strengthened firstly, that is to reduce the number of 0–1 variables, increase the search space limitation, and do clustering analysis combined with the characteristics of data distribution. Finally, an optimized model is obtained, which is a mixed-integer linear programming model that can be tackled to get the optimal solution by an off-the-shelf solver using the branch and bound algorithm. In particular, we take the Beijing 2022 Winter Olympics as a practical case, and combine the location-routing results with the logistics situation in reality to discuss the impact of food perishability on the dual goals and give management inspiration through mathematical analysis.