城市连锁超市配送LRP建模与优化-物流工程专业论文.docxVIP

Abstract As the degree of global economic integration is becoming more and more intense, the competition of modern enterprises is becoming the competition among supply chains. To satisfy customer demand with lower cost, better service and quicker response, practitioners call for higher requirements for logistics system and the concern on logistics integration is also on the rise. Under this situation, more and more studies focus on LRP (Location Routing Problem), which is the integration of LAP (Location Assignment Problem) and VRP (Vehicle Routing Problem). The thesis firstly summarizes the related research findings of LRP model, algorithms and applications. On this basis, the characteristics of city supermarket chain distribution network are analyzed systematically and the objectives of LRP model are elaborated. The LRP model of city supermarket chain distribution network is constructed and the basic principle of annealing simulation heuristics algorithm is briefly introduced. Then a three-layer LRP network satisfying several constraints (including facility capacity constraints, vehicle constraints, flow equilibrium constraints, etc.) is built for the city supermarket chain’s three-layer distribution network consisting of suppliers, logistics centers, distribution centers and supermarket stores, with the lowest total logistics cost of the distribution network. A simulated annealing heuristics is designed to solve this model and case studies are used to test the validation of the algorithm. Finally, based on the actual situation of supermarket chains in Wuhan, combined with related data from investigations and collections, the designed model and its algorithm are applied to optimize the distribution network with real data. By analyzing and improving the solution results, a final optimized solution is obtained. The results of the thesis offer useful references for city supermarket chain distribution network optimization. Key words: Location Routing Problem