EFFICIENT WASTE COLLECTION BY MEANS OF ASSIGNMENT PROBLEMS

Kostanca Katragjini, Federico Perea, Rubén Ruiz

Abstract

This paper studies a municipal waste collection problem, whose ultimate goal is to find an assignment of containers to service days and posterior routing so that the total distance covered by the waste collection trucks is minimized. Due to the complexity of this problem, we divide it into several subproblems. The focus of this paper is on the first problem, in which it must be decided which containers must be collected on each service day so that the containers collected on the same day are as close to each other as possible. In a second phase (out of the scope of this paper) the routes followed by the collection vehicles at each service day are optimized. Such separation of the problem is needed as a result of the sheer size and complexity of the real setting. Despite this separation into smaller subproblems, efficient procedures must be designed in order to solve real-sized instances. A computational experience over a number of instances shows the applicability of our methods.

References

  1. Angelilli, E. and Speranza, M. G. (2002). The application of a vehicle routing model to a waste-collection problem: two case studies. Journal of the Operational Resarch Society, 53(9):944-952.
  2. Baustista, J., Fernández, E., and Pereira, J. (2008). Solving a urban waste collection problem using ant heuristics. Computers & Operations Research, 35(9):3020- 3033.
  3. Beltrami, E. and Bodin, L. (1974). Networks and vehicle routing for municipal waste collection. Networks, 4(1):65-94.
  4. Benjamin, A. and Beasley, J. (2010). Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Computers & Operations Research, 37(12):2270-2280.
  5. Coene, S., Arnoout, A., and Spieksma, F. (2010). On a periodic vehicle routing problem. Journal of the Operational Research Society, 61(1):1719-1728.
  6. Golden, B. L., Assad, A. A., and Wasil, E. A. (2002). The vehicle routing problem, chapter 10, pages 245-286. SIAM.
  7. Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan Traveling Salesman Heuristic. European Journal of Operational Research, 126(1):106- 130.
  8. Huang, Y., Baetz, B., Huang, G., and Liu, L. (2002). Violation analysis for solid waste management systems: an interval fuzzy programming approach. Journal of Environmental Management, 65(4):431-446.
  9. Kim, B.-I., Kim, S., and Sahoo, S. (2006). Waste collection vehicle routing problem with time windows. Computers & Operations Research, 33(12):3624-3642.
  10. Li, Y., Huang, G., Nie, X., and Nie, S. (2008). A twostage fuzzy robust integer programming approach for capacity planning of environmental management systems. European Journal of Operational Research, 189(2):399-420.
  11. Lin, S. and Kernighan, B. (1973). Effective heuristic algorithm for traveling-salesman problem. Operations Research, 21(2):498-516.
  12. Maniezzo, V. (2004). Algorithms for large directed CARP instances: urban solid waste collection operational support. Technical Report UBLCS-2004-16, Department of Computer Science, University of Bologna.
  13. Megiddo, N. (1983). Linear-time algorithms for linear programming in R3 and related problems. SIAM J. COMPUT, 12(4):759-776.
  14. Russell, R. A. and Igo, W. (1979). An assignment routing problem. Networks, 9(1):1-17.
  15. Teixeira, J., Antunes, A. P., and da Sousa, J. P. (2004). Recyclable waste collection planning-a case study. European Journal of Operational Resarch, 158(3):543- 554.
  16. Wilson, D. C. (1985). Long-term planning for solid waste management. Waste Management & Research, 3(3):203-216.
Download


Paper Citation


in Harvard Style

Katragjini K., Perea F. and Ruiz R. (2012). EFFICIENT WASTE COLLECTION BY MEANS OF ASSIGNMENT PROBLEMS . In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8425-97-3, pages 283-292. DOI: 10.5220/0003745102830292


in Bibtex Style

@conference{icores12,
author={Kostanca Katragjini and Federico Perea and Rubén Ruiz},
title={EFFICIENT WASTE COLLECTION BY MEANS OF ASSIGNMENT PROBLEMS},
booktitle={Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2012},
pages={283-292},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003745102830292},
isbn={978-989-8425-97-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - EFFICIENT WASTE COLLECTION BY MEANS OF ASSIGNMENT PROBLEMS
SN - 978-989-8425-97-3
AU - Katragjini K.
AU - Perea F.
AU - Ruiz R.
PY - 2012
SP - 283
EP - 292
DO - 10.5220/0003745102830292