Vehicle routing problem with considering multi-middle depots for perishable food delivery

Abstract: Today, distributing high quality perishable foods is one of the challenging issues in food industry. This paper introduces a deterministic vehicle routing problem model with multiple middle depots and proposes the freshness of perishable foods as a new concept to obtain optimal delivery routes. For the proposed mathematical model, profit maximization of delivering the product, minimization of the transportation costs and vehicle traveling time, and maximum level of delivered product perishability (loss of freshness) are considered. GAMS software is implemented to show the authority of the model. Furthermore, genetic algorithm (GA) has been developed to solve the model for large size instances. Several problems are tested in order to compare the exact and the GA solutions.

How to cite this paper

 Rabbani, M., Farshbaf-Geranmayeh, A & Haghjoo, N. (2016). Vehicle routing problem with considering multi-middle depots for perishable food delivery.Uncertain Supply Chain Management, 4(3), 171-182.

Refrences

Agustina, D., Lee, C., & Piplani, R. (2014). Vehicle scheduling and routing at a cross docking center for food supply chains. International Journal of Production Economics, 152, 29-41.

Akbari, F., Fazlollahtabar, H., & Mahdavi, I. (2013). An uncertain decision making process considering customers and services in evaluating banks: A case study. International Journal of Strategic Decision Sciences (IJSDS), 4(2), 48-78.

Amorim, P., & Almada-Lobo, B. (2014). The impact of food perishability issues in the vehicle routing problem. Computers & Industrial Engineering, 67, 223-233.

Baldacci, R., & Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, 120(2), 347-380.

Carpaneto, G., Dell & apos; Amico, M., Fischetti, M., & Toth, P. (1989). A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks, 19(5), 531-548.

Chen, H.-K., Hsueh, C.-F., & Chang, M.-S. (2009). Production scheduling and vehicle routing with time windows for perishable food products. Computers & Operations Research, 36(7), 2311-2319.

Contardo, C., & Martinelli, R. (2014). A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization, 12, 129-146.

Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.

Govindan, K., Jafarian, A., Khodaverdi, R., & Devika, K. (2014). Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. International Journal of Production Economics, 152, 9-28.

Gustavsson, J., Cederberg, C., Sonesson, U., Van Otterdijk, R., & Meybeck, A. (2011). Global food losses and food waste. Food and Agriculture Organization of the United Nations, Rom.

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.

Holland, J., (1992). Adaptation in natural and artificial systems: MIT Press, Cambridge, MA.

Khakbaz, H., & Bhattacharjya, J. (2014). Maritime Empty Container Repositioning: A Problem Review. International Journal of Strategic Decision Sciences (IJSDS), 5(1), 1-23.

Kulkarni, R., & Bhave, P. R. (1985). Integer programming formulations of vehicle routing problems. European Journal of Operational Research, 20(1), 58-67.

Laporte, G. (1989). Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Behave. European Journal of Operational Research, 38(2), 227.

Laporte, G., Nobert, Y., & Arpin, D. (1984). Optimal solutions to capacitated multidepot vehicle routing problems: Ecole des hautes études commerciales.

Laporte, G., Nobert, Y., & Taillefer, S. (1988). Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science, 22(3), 161-172.

Lawrence, S., & Mohammad, A. (1996). Parametric experimentation with a genetic algorithmic configuration for solving the vehicle routing problem. Paper presented at the Proceedings Annual Meeting of the Decision Sciences Institute, Decis Sci Inst.

Nahmias, S. (1982). Perishable inventory theory: A review. Operations Research, 30(4), 680-708.

Osvald, A., & Stirn, L. Z. (2008). A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. Journal of Food Engineering, 85(2), 285-295.

Raafat, F. F., Wolfe, P. M., & Eldin, H. K. (1991). An inventory model for deteriorating items. Computers & Industrial Engineering, 20(1), 89-94.

Seth, A., Klabjan, D., & Ferreira, P. M. (2013). Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems. Networks, 61(4), 290-308.

Smith, D., & Sparks, L. (2007). Temperature controlled supply chains. Food Supply Chain Management, 179-198.

Tarantilis, C., & Kiranoudis, C. (2002). Distribution of fresh meat. Journal of Food Engineering, 51(1), 85-91.