Optimizing Flexible Multi-Compartment Location Routing Problem for Waste Collection with Priority of Service Using a Hyper-Heuristic Algorithm and ε–Constraint Method
نویسندگان
1 Department of Industrial Engineering, Faculty of Engineering, Alzahra University, Tehran, Iran
2 Department of Industrial Engineering, Faculty of Engineering, Alzahra University, Tehran, Iran
doi
10.5829/ije.2026.39.01a.19چکیده
Todays, because of waste generation as a result of various human activities, modernization, urbanization and industrialization, waste management and waste collection have become major issues for communities. Also, transferring types of waste together causes risks. So, in this research we investigated and modeled an integrated waste collection network including facility location and vehicle routing decisions. Therefore, a mix-integer nonlinear bi-objective programming model of flexible multi-compartment routing location problem with time window with the aim of reducing the total network cost and harmful effects on the environment is expanded. Where each source node is met by several vehicles, and each node and vehicle have time limitation for service, so queuing time is being considered. Hence, priority for the service of each vehicle is important. Moreover, the model has been converted into an MILP and then solved by GAMS in a small-scale experiment. Since the problem is NP-hard, a Hyper-Heuristic algorithm based on NSGA-II algorithm, NSGA-II and -Constraint method are designed for solving the proposed problem. So, the results of three methods were compared by metric indicators and objective functions. Then, sensitive analysis of important parameters was performed. Finally, the findings show that Hyper-heuristic based on NSGA-II can obtain more and faster convergence and has high performance to NSGA-II and -Constraint method.