A hybrid genetic algorithm for waste collection problem by heterogeneous fleet of vehicles with multiple separated compartments

Abstract

In this paper, we consider the waste collection problem from customers' location with assumptions that are closer to real life applications of the problem. The fleet of vehicles is heterogeneous and vehicles have separated compartments, namely they have different capacity for each type of waste. Also, the vehicles have different traveling time limitation and different variable and fixed cost according to their types. As well as, the multi-depot vehicle routing problem and the mixed close-open vehicle routing problem are combined together. The objective of the problem is minimizing the cost of servicing to customers with respect to customers' demands and available constraints. A new mathematical MIP model is proposed and to deal with this problem, three meta-heuristic algorithms are investigated and the results are compared with the results of CPLEX solver. The results of experiments show that the proposed Meta-heuristic algorithms are able to produce satisfied solutions with regard to the MIP solver CPLEX.