Simultaneous Optimization of Stations Location and their Routing for Garbage Collecting Service

Abstract

We focus on household garbage collection services to find an optimization method that simultaneously satisfies the convenience of residents and the efficiency of vehicle collection. The cost of garbage collection depends on the location of the garbage stations and the routes taken by a fleet of vehicles. We try to reduce collecting costs by optimizing the placement of the garbage station. In this problem, it is necessary not only to reduce the costs but also to reflect the convenience of residents. In this study, we use a hybrid solution method mixing meta-heuristics and mathematical programming to find better locations within realistic computational time. We decompose the problem into two problems: garbage station allocation and collecting routes, and optimize it using meta-heuristics and mathematical programming. The placement of garbage stations reflects the residents' questionnaire as a constraint in the optimization model.