Optimizing the fresh-cut flower distribution using the vehicle routing problem for perishable goods

Abstract

Real-world freight distribution problems are complex, primarily because they must adhere to several restrictions on multidimensional vehicle capacity, vehicle characteristics route duration/length restrictions, time windows, and compatibility. As a result, attention must be paid to the distinctive operating procedures and features of various distribution systems. In this context, cut flower distribution is recognized as one of the challenging operations as it requires maintaining a certain level of freshness. Through the entire supply chain (SC), it is vital to keep freshness because it decides the product price, quality as well as customer satisfaction level. We study the fresh flower distribution using data from a reputed floral company in Sri Lanka to find the optimal set of routes for the fresh-cut flower delivery. We employ Capacitated Heterogeneous Fleet Vehicle Routing Problem (VRP) for Perishable Goods with Time Windows and a Single Depot (CHFVRPPGTWSD). Therefore, the main objective of this paper is to minimize the total distribution time while keeping a maximum freshness rate as a KPI to maximize customer satisfaction. We use a hybrid algorithm to fulfill our research objectives. Floral companies would be benefitted from our model as it can assist to identify optimal routes to plan their distribution network with minimum distribution time.