Skip to main content
SpringerLink
Log in

Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network

  • OR in Transportation
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • Ahmadi-Javid, A., & Seddighi, A. H. (2012). A location-routing-inventory model for designing multisource distribution networks. Engineering Optimization, 44(6), 637–656.

    Article  Google Scholar 

  • Álvarez-Miranda, E., Fernández, E., & Ljubić, I. (2015). The recoverable robust facility location problem. Transportation Research Part B: Methodological, 79, 93–120.

    Article  Google Scholar 

  • Baker, B. M., & Ayechew, M. A. (2003). A genetic algorithm for the vehicle routing problem. Computers and Operations Research, 30(5), 787–800.

    Article  Google Scholar 

  • Bell, J. E., & McMullen, P. R. (2004). Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics, 18(1), 41–48.

    Article  Google Scholar 

  • Boventer, E. (1961). The relationship between transportation costs and location rent in transportation problems. Journal of Regional Science, 3(2), 27–40.

    Article  Google Scholar 

  • 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.

  • Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89, 319–328.

    Article  Google Scholar 

  • Chan, Y., Carter, W. B., & Burnes, M. D. (2001). A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers and Operations Research, 28(8), 803–826.

    Article  Google Scholar 

  • Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1979). Note-On “Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms”. Management Science, 25(8), 808–809.

    Article  Google Scholar 

  • Dondo, R., & Cerdá, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478–1507.

    Article  Google Scholar 

  • Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 26(1), 29–41.

    Article  Google Scholar 

  • Drexl, M., & Schneider, M. (2015). A survey of variants and extensions of the location-routing problem. European Journal of Operational Research, 241(2), 283–308.

    Article  Google Scholar 

  • Escobar, J. W., Linfati, R., & Toth, P. (2013). A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Computers and Operations Research, 40(1), 70–79.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). A guide to the theory of NP-completeness. New York: WH Freemann.

    Google Scholar 

  • Gelareh, S., & Nickel, S. (2011). Hub location problems in transportation networks. Transportation Research Part E: Logistics and Transportation Review, 47(6), 1092–1111.

    Article  Google Scholar 

  • Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40(10), 1276–1290.

    Article  Google Scholar 

  • Guerrero, W. J., Prodhon, C., Velasco, N., & Amaya, C. A. (2013). Hybrid heuristic for the inventory location-routing problem with deterministic demand. International Journal of Production Economics, 146(1), 359–370.

    Article  Google Scholar 

  • Hsu, C. I., Hung, S. F., & Li, H. C. (2007). Vehicle routing problem with time-windows for perishable food delivery. Journal of Food Engineering, 80(2), 465–475.

    Article  Google Scholar 

  • Javid, A. A., & Azad, N. (2010). Incorporating location, routing and inventory decisions in supply chain network design. Transportation Research Part E: Logistics and Transportation Review, 46(5), 582–597.

    Article  Google Scholar 

  • Jin, M., Liu, K., & Bowden, R. O. (2007). A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. International Journal of Production Economics, 105(1), 228–242.

    Article  Google Scholar 

  • Karp, R. M. (1972). Reducibility among combinatorial problems. New York: Springer.

    Book  Google Scholar 

  • Kleprlík, J., Bečičková, M., & Brázdová, M. (2011). A multicriterial mathematical model for creating vehicle routes to transport goods. Transport, 26(2), 204–207.

    Article  Google Scholar 

  • Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2016). The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. European Journal of Operational Research, 248(1), 33–51.

    Article  Google Scholar 

  • Lai, D. S., Demirag, O. C., & Leung, J. M. (2016). A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transportation Research Part E: Logistics and Transportation Review, 86, 32–52.

    Article  Google Scholar 

  • Lesmawati, W., Rahmi, A., & Mahmudy, W. F. (2016). Optimization of frozen food distribution using genetic algorithms. Journal of Environmental Engineering and Sustainable Technology, 3(1), 51–58.

    Article  Google Scholar 

  • Liu, S. C., & Lee, S. B. (2003). A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. The International Journal of Advanced Manufacturing Technology, 22(11–12), 941–950.

    Article  Google Scholar 

  • Lopes, R. B., Plastria, F., Ferreira, C., & Santos, B. S. (2014). Location-arc routing problem: Heuristic approaches and test instances. Computers and Operations Research, 43, 309–317.

    Article  Google Scholar 

  • Megiddo, N., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal on Computing, 13(1), 182–196.

    Article  Google Scholar 

  • Melechovský, J., Prins, C., & Calvo, R. W. (2005). A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics, 11(5–6), 375–391.

    Article  Google Scholar 

  • Min, H., Jayaraman, V., & Srivastava, R. (1998). Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research, 108(1), 1–15.

    Article  Google Scholar 

  • Mokhtarinejad, M., Ahmadi, A., Karimi, B., & Rahmati, S. H. A. (2015). A novel learning based approach for a new integrated location-routing and scheduling problem within cross-docking considering direct shipment. Applied Soft Computing, 34, 274–285.

    Article  Google Scholar 

  • Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649–672.

    Article  Google Scholar 

  • Nekooghadirli, N., Tavakkoli-Moghaddam, R., Ghezavati, V. R., & Javanmard, S. (2014). Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics. Computers and Industrial Engineering, 76, 204–221.

    Article  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 

  • Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41(4), 421–451.

    Article  Google Scholar 

  • Prins, C., Prodhon, C., & Calvo, R. W. (2006). Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR, 4(3), 221–238.

    Article  Google Scholar 

  • Russell, R. A., & Chiang, W. C. (2006). Scatter search for the vehicle routing problem with time windows. European Journal of Operational Research, 169(2), 606–622.

    Article  Google Scholar 

  • Salhi, S., & Rand, G. K. (1989). The effect of ignoring routes when locating depots. European Journal of Operational Research, 39(2), 150–156.

    Article  Google Scholar 

  • Tarantilis, C. D., Ioannou, G., & Prastacos, G. (2005). Advanced vehicle routing algorithms for complex operations management problems. Journal of Food Engineering, 70(3), 455–471.

    Article  Google Scholar 

  • Van Breedam, A. (1995). Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operational Research, 86(3), 480–490.

    Article  Google Scholar 

  • Vincent, F. Y., & Lin, S. Y. (2015). A simulated annealing heuristic for the open location-routing problem. Computers and Operations Research, 62, 184–196.

    Article  Google Scholar 

  • Yoshizaki, H. T. Y. (2009). Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. European Journal of Operational Research, 199(3), 750–758.

    Article  Google Scholar 

  • Yu, B., Ma, N., Cai, W., Li, T., Yuan, X., & Yao, B. (2013). Improved ant colony optimisation for the dynamic multi-depot vehicle routing problem. International Journal of Logistics Research and Applications, 16(2), 144–157.

    Article  Google Scholar 

  • Yu, B., Yang, Z. Z., & Xie, J. X. (2011a). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society, 62(1), 183–188.

    Article  Google Scholar 

  • Yu, B., Yang, Z. Z., & Yao, B. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171–176.

    Article  Google Scholar 

  • Yu, B., Yang, Z. Z., & Yao, B. Z. (2011b). A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications, 38(1), 435–441.

    Article  Google Scholar 

  • Zarandi, M. H. F., Hemmati, A., & Davari, S. (2011). The multi-depot capacitated location-routing problem with fuzzy travel times. Expert Systems with Applications, 38(8), 10075–10084.

    Article  Google Scholar 

  • Zarandi, M. H. F., Hemmati, A., Davari, S., & Turksen, I. B. (2013). Capacitated location-routing problem with time windows under uncertainty. Knowledge-Based Systems, 37, 480–489.

    Article  Google Scholar 

  • Zhang, Y., Qi, M., Miao, L., & Liu, E. (2014). Hybrid metaheuristic solutions to inventory location routing problem. Transportation Research Part E: Logistics and Transportation Review, 70, 305–323.

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported in National Natural Science Foundation of China 51578112 and the fundamental research funds for the central universities (DUT16YQ104).

Author information

Authors and Affiliations

  1. School of Automotive Engineering, Dalian University of Technology, Dalian, 116024, China

    Chen Chao, Tian Zhihui & Yao Baozhen

Authors
  1. Chen Chao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tian Zhihui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yao Baozhen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yao Baozhen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chao, C., Zhihui, T. & Baozhen, Y. Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network. Ann Oper Res 273, 111–134 (2019). https://doi.org/10.1007/s10479-017-2514-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2514-3

Keywords

Search

Navigation