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

22Citations
Citations of this article
57Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

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. https://doi.org/10.5267/j.uscm.2016.3.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free