A heuristic solution method for node routing based solid waste collection problems

摘要: This paper considers a real world waste collection problem in which glass, metal, plastics, or is brought to certain points by the citizens of region. The this from therefore node routing problem. delivered special sites, so called intermediate facilities (IF), that are typically not identical with vehicle depot. Since most need be visited every day, planning period several days has considered. In context three related problems First, periodic (PVRP-IF) considered and an exact formulation proposed. A set benchmark instances developed efficient hybrid solution method based on variable neighborhood search dynamic programming presented. Second, application PVRP-IF modified permitting return partly loaded vehicles depots considering capacity limits at IF. An average improvement 25% cost obtained compared current solution. Finally, different but problem, multi-depot inter-depot routes (MDVRPI) class just single day can act as facility only end tour. For solutions available. It shown algorithm outperforms all previously published metaheuristics for finds best available instances.