Enhanced chromosome repairing mechanism based genetic algorithm approach for the multi-period perishable production inventory-routing problem

One of the important aspects of distribution optimization problems is simultaneously controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (irp). when the lot-sizing decisions are jointed with irp, the problem will get more complicated called production inventoryrouting problem (pirp). to become closer to the real life problems that includes products that have a limited life time like foods, it seems reasonable to narrow down the pirp problem to the perishable products, which is perishable-production inventory-routing problem (p-pirp). this paper addresses a p-pirp in a two echelon supply chain system where the vendor must decide when and how much to produce and deliver products to the customer’s warehouse. here, the general model of pirp as mixed integer programming (mip)is adopted and the perishability constraint are added in order to solve the p-pirp problems. due to the complexity of problem, providing solution for the medium to large instances cannot be easily achieved by business applications, and then using the meta-heuristics is unavoidable. the novelty of this research is devising an enhanced genetic algorithm (ga) using multiple repairing mechanisms, which because of its computationally cumbersomeness have absorbed less attention in the literature. the problem runs through some generated instances and shows superiority in comparison to the business application.