The efficient organization of waste collection systems based on bins located along the streets involves the solution of several tactical optimization problems. In particular, the bin configuration and sizing at each collection site as well as the service frequency over a given planning horizon have to be decided. In this context, a higher service frequency leads to higher routing costs, but at the same time less or smaller bins are required, which leads to lower bin allocation investment costs. The bins used have different types and different costs and there is a limit on the space at each collection site as well as a limit on the total number of bins of each type that can be used. In this paper we consider the problem of designing a collection system consisting of the combination of a vehicle routing and a bin allocation problem in which the trade-off between the associated costs has to be considered. The solution approach combines an effective variable neighborhood search metaheuristic for the routing part with a mixed integer linear programming-based exact method for the solution of the bin allocation part. We propose hierarchical solution procedures where the two decision problems are solved in sequence, as well as an integrated approach where the two problems are considered simultaneously. Extensive computational testing on synthetic and real-world instances with hundreds of collection sites shows the benefit of the integrated approaches with respect to the hierarchical ones.
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:5571 |
| Date | 02 1900 |
| Creators | Hemmelmayr, Vera, Doerner, Karl, Hartl, Richard F., Vigo, Daniele |
| Publisher | INFORMS |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, NonPeerReviewed |
| Format | application/pdf |
| Relation | http://dx.doi.org/10.1287/trsc.2013.0459, http://pubsonline.informs.org/journal/trsc, http://pubsonline.informs.org/page/trsc/submission-guidelines, http://epub.wu.ac.at/5571/ |
Page generated in 0.0019 seconds