Una formulacin para el problema de la recogida de residuos urbanos en Sevilla

  1. López-Sánchez, A.D. 1
  2. Hernández-Díaz, A.G. 1
  3. Hinojosa, M.A. 1
  1. 1 Universidad Pablo de Olavide
    info

    Universidad Pablo de Olavide

    Sevilla, España

    ROR https://ror.org/02z749649

Journal:
Anales de ASEPUMA

ISSN: 2171-892X

Year of publication: 2012

Issue: 20

Type: Article

DIALNET GOOGLE SCHOLAR lock_openDialnet editor

More publications in: Anales de ASEPUMA

Abstract

In this paper, we focus on the formulation of Capacitated Arc Routing Problems (CARP) and we present a general compact flow based model for the CARP and its reso-lution with exact methods by using CPLEX in different objective functions. As a real life application we model the waste collection problem in the city of Seville.

Bibliographic References

  • Bautista, J.; Fernandez E.; Pereira J. (2008). “Solving an urban waste collection problem using ants heuristics”. Computers and Operations Research, 35 (9), pp. 3020–3033.
  • Belenguer, J.M.; Benavent, E. (1998). “The capacitated arc routing problem: Valid Inequalities and Facets”. Computational Optimization and Applications, 10 (2), pp. 165–187.
  • Belenguer, J.M.; Benavente, E. (2003). “A cutting plane algorithm for the capacitated arc routing problem”. Computers and Operations Research, 30 (5), pp. 705–728.
  • Belenguer, J.M.; Benavent, E.; Lacomme, P.; Prins C. (2006). “Lower and upper bounds for the mixed capacitated arc routing problem”. Computers and Operations Research, 33 (12), pp. 3363–3383.
  • Coberan, A.; Martí, R.; Martínez, E. y SOLER D. (2002). “The Rural Postman Problem on mixed graphs with turn penalties”. Computers and Operations Research, 29 (7), pp. 887–903. Dror, M. (2000). “Arc Routing: Theory, Solutions and Applications”. Kluwer Academic Publishing, Boston, MA, USA.
  • Ghiani, G.; Importa, G. y Laporte, G. (2001). “The Capacitated Arc Routing Problem with Intermediate Facilities”. Networks, 37 (3), pp. 134–143.
  • Golden, B.L.; Wong, R.T. (1981). “Capacitated arc routing problems”. Networks, 11 (3), pp. 305–315.
  • Gouveia, L.; Mourao, M.C.; Pinto, L.S. (2010). “Lower bounds for ˜ the mixed capacitated arc routing problem”. Computers and Operations Research, 37 (4), pp. 692–699.
Data source: Dialnet