Optimizing Perishable Product Supply Chain Network Using Hybrid Metaheuristic Algorithms

Abstract

This paper focuses on optimizing the long- and short-term planning of the perishable product supply chain network (PPSCN). It addresses the integration of strategic location, tactical inventory, and operational routing decisions. Additionally, it takes into consideration the specific characteristics of perishable products, including their shelf life, inventory management, and transportation damages. The main objective is to minimize the overall supply chain cost. To achieve this, a nonlinear mixed integer programming model is developed for the multi-echelon, multi-product, and multi-period location-inventory-routing problem (LIRP) in the PPSCN. Two hybrid metaheuristic algorithms, namely genetic algorithm (GA) and multiple population genetic algorithm (MPGA), are hybridized with variable neighborhood search (VNS) and proposed to solve this NP-hard problem. Moreover, a novel coding method is devised to represent the complex structure of the LIRP problem. The input parameters are tuned using the Taguchi experimental design method, considering the sensitivity of meta-heuristic algorithms to these parameters. Through experiments of various scales, the hybrid MPGA with VNS indicates superior performance, as evidenced by the experimental results. Sensitivity analysis is conducted to examine the influence of key model parameters on the optimal objective, providing valuable management implications. The results clearly validate the efficacy of the proposed model and solution method as a reliable tool for optimizing the design problem of the PPSCN.