Multi-objective Multi-compartment Split Delivery Location Routing Problem with Time Windows

Making effective and efficient decisions for the supply chain system is essential. The Location Routing Problem (LRP), which simultaneously identifies the center of facilities and vehicle routes, is one of the models that could be utilized to make wise selections. The Multi-objective Multi-Compartment Split Delivery Location Routing Problem With Time Windows (MOMCSDLRPTW) is the LRP model developed in this study. Multi-compartment vehicles, split deliveries, time windows, and capacitated DC are extra factors from conventional LRP. Minimizing the overall cost and maximizing the service level are the goals. The non-dominated sorting genetic algorithm (NSGA) II is used to solve the model. In the subject case, the findings reveal that the Split Delivery (SD) model is suitable for nodes' proximity, the retailer's longer tolerance time windows and higher demand.