A Routing Model for the Distribution of Perishable Food in a Green Cold Chain

Abstract

In this research, we develop an extension of the stochastic routing model with a fixed capacity for the distribution of perishable products with a time window. We use theoretical probability distributions to model the life of transported products and travel times in the network. Our main objective is to maximize the probability of delivering products within the established deadline with a certain level of customer service. Our project is justified from the perspective of reducing the pollution caused by greenhouse gases generated in the process. To optimize the proposed model, we use a Generic Random Search Algorithm. Finally, we apply the idea to a real problem of designing strategies for the optimal management of perishable food distribution routes that involve a time window, the objective being to maximize the probability of meeting the time limit assigned to the route problem by reducing, in this way, the pollution generated by refrigerated transport.

Keywords

• stochastic mathematical programming
• cold chain
• perishable food
• fixed capacity routing problem