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.

Challenges and Opportunities for Applying Meta-Heuristic Methods in Vehicle Routing Problems: A Review

“…Determining the appropriate parameter values also depends greatly on the characteristics of the VRP problem being addressed. If parameters are not well-tuned, meta-heuristic algorithms may have difficulty navigating the complex search space and considering a wide range of possible valid solutions [26]. Careful research and experimentation are required to determine the most suitable parameter values for each VRP variant and the type of meta-heuristic used.…”

Multicast Routing Based on Data Envelopment Analysis and Markovian Decision Processes for Multimodal Transportation

“…Nevertheless, the intricate task of designing such networks is beset with challenges, necessitating a comprehensive approach. Past research has employed various methodologies, such as linear programming, integer programming, and metaheuristic algorithms, to achieve a balance between multiple objectives in optimizing transportation [15][16][17].…”

A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility

“…Londoño et al [155] used the variable neighborhood search algorithm within a Chu-Beasley Genetic Algorithm to overcome the multi-depot vehicle routing problem. Pan et al [156] used hybrid metaheuristic algorithms involving a genetic algorithm and multiple population genetic algorithm (MPGA) with variable neighborhood search to optimize a perishable product supply chain network. When solving a routing problem with pickup and delivery, Wang et al [157] compared the proposed model integrating the Clarke-Wright saving algorithm, variable neighborhood search, and MOPSO with multi-objective variable neighborhood search and NSGA-II.…”