Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network
- 510 Downloads
High transportation cost and low service quality are common weaknesses in different logistics networks, especially in food delivery. Due to its perishable features, the quality of the food will deteriorate during the while delivery process. In this paper, a two-stage location–routing–inventory problem with time windows (2S-LRITW) for food products is proposed. The first stage corresponds to a location–routing–inventory problem with time windows and the second stage is the transportation problem with vehicle capacity constraints. The problem is formulated as a mixed integer-programming model. Then a hybrid heuristic is proposed, in which distance-based clustering approach, mutation operation and the relocate exchange method are introduced to improve performance of algorithm. At last, the hybrid heuristic was tested using several cases, including some small instances and a real-life case. The results show that the distance-based clustering approach can efficiently improve the convergence speed. And the IACO and the relocate exchange method can enlarge the search space. As a result, the hybrid heuristic is suitable for solving practical larger scale problem. Furthermore, the results also indicate that customer sequence has great effect on the object due to the energy cost considered.
KeywordsLocation–routing–inventory problem with time-windows (LRITW) Food distribution IACO Clustering
This research was supported in National Natural Science Foundation of China 51578112 and the fundamental research funds for the central universities (DUT16YQ104).
- Bullnheimer, B., Hartl, R., & Strauss, C. (1997). Applying the ant system to the vehicle routing problem. In 2nd Metaheuristic international conference (MIC-97), Sophia-Antipolis, France.Google Scholar
- Garey, M. R., & Johnson, D. S. (1979). A guide to the theory of NP-completeness. New York: WH Freemann.Google Scholar
- Nikbakhsh, E., & Zegordi, S. H. (2010). A heuristic algorithm and a lower bound for the two-echelon location-routing problem with soft time window constraints. Scientia Iranica Transaction E: Industrial Engineering, 17(1), 36–47.Google Scholar