Developing refrigerated and general carriers’ collaboration model for perishable product

Abstract

In this paper, we study a novel pickup and delivery problem called carrier collaboration (CC). This problem includes a set of heterogenous (refrigerated and general type) vehicles with specific capacities for serving perishable products to several pickup and delivery nodes. Each carrier can have reserved and selective requests which can be delivered before the products are corrupted. The fleet of vehicles must serve reserved requests, but the selective requests can be served or not. Products are corrupted at a constant rate and a rate of corrosion in general type vehicles is greater than referigrated type veicles and the cost of using general one is less than referegireted. For the mentioned features, we develop a nonlinear mathematical model. The purpose is to find routes to maximize profits and reduce costs while at the same time, enhance customer satisfaction which is dependent on the freshness of delivered products. A Gnetic Algorithm (GA) is proposed to solve this problem due to its NP-hard nature. In this study, Variable Neighborhood Search (VNS) method is developed for improving the quality of initial solutions. Several instances are generated at different scales to evaluate the algorithm performance by comparing the results of an exact optimal solution wih that of the proposed algorithm. The obtained results demonstrate the efficiency of the proposed algorithm in providing reasonable solutions within an acceptable computational time.

Keywords

• carrier collaboration
• pickup and delivery problem
• customer satisfaction function
• perishable product delivery
• refrigerated-type vehicle