Designing the Location–Routing Problem for a Cold Supply Chain Considering the COVID-19 Disaster
Sina Abbasi, Maryam Moosivand, Ilias Vlachos, Mohammad Talooni
Abstract
In this study, a location routing problem (LRP) model was considered for the distribution network of multiple perishable food items in a cold supply chain (CSC) where vehicles can refuel at gas stations during light of the COVID-19 disaster. Fuel consumption is assumed to vary depending on the cargo transported between nodes when using a non-standard fuel fleet. The problem was formulated as a mixed-integer linear programming (MILP) model to reduce the production of carbon dioxide (CO2). The model was validated using several numerical examples which were solved using the software, LINGO 17.0. The results show that fuel consumption could be reduced in this case. Due to the complexity of the problem, genetically simulated annealing algorithms were developed to solve the actual size problems, and their performance was also evaluated.