A multi-compartment capacitated arc routing problem with intermediate facilities for solid waste collection using hybrid adaptive large neighborhood search and whale algorithm

Municipal solid waste collection is an increasingly difficult task and has the highest operation cost in the solid waste management process; thus, finding the optimal routes for the waste collection is a most tactically significant decision that should be focused on due to the population growth. This research investigated the multi-compartment capacitated arc routing problem with intermediate facilities (MCCARPIF) in the context of solid waste collection. This problem has been researched rarely in the past in the real world. The MCCARPIF develops the capacitated arc routing problem (CARP) by considering both the multi-compartment vehicles and intermediate facilities together. In case of waste separation, the fleet of vehicles should have multiple parts to avoid mixing waste together. In developing countries, the process of separating the wastes is not carried out comprehensively, so this subject is almost new and research about it can improve their waste collection process. Due to the complexity of this model, two algorithms are developed to solve it: an adaptive large neighborhood search algorithm (ALNS) and the hybrid ALNS with whale optimization algorithm. Results showed that hybrid ALNS with whale optimization algorithm got higher quality solutions in comparison to ALNS. A real case study in one of the districts of Tehran municipality has been considered and the results obtained show that the use of multi-compartment vehicles is more cost-effective than the use of single-compartment vehicles, reducing the total distance traveled.