Inventory routing for dynamic waste collection

Martijn R.K. Mes, Johannes M.J. Schutten, Arturo Eduardo Perez Rivera

    Research output: Contribution to journalArticleAcademicpeer-review

    28 Citations (Scopus)

    Abstract

    We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense networks, the latter becomes more important. To cope with uncertainty in deposit volumes and with fluctuations due to daily and seasonal effects, we need an anticipatory policy that balances the workload over time. We propose a relatively simple heuristic consisting of several tunable parameters depending on the day of the week. We tune the parameters of this policy using optimal learning techniques combined with simulation. We illustrate our approach using a real life problem instance of a waste collection company, located in The Netherlands, and perform experiments on several other instances. For our case study, we show that costs savings up to 40% are possible by optimizing the parameters.
    Original languageEnglish
    Pages (from-to)1564-1576
    JournalWaste management
    Volume34
    Issue number9
    DOIs
    Publication statusPublished - 2014

    Fingerprint

    routing
    sensor
    heuristics
    savings
    learning
    cost
    simulation
    waste collection
    parameter
    policy
    experiment
    container

    Keywords

    • IR-91703
    • METIS-304926

    Cite this

    Mes, Martijn R.K. ; Schutten, Johannes M.J. ; Perez Rivera, Arturo Eduardo. / Inventory routing for dynamic waste collection. In: Waste management. 2014 ; Vol. 34, No. 9. pp. 1564-1576.
    @article{ae9a35faab03403d9d4c984d5c0d2d43,
    title = "Inventory routing for dynamic waste collection",
    abstract = "We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense networks, the latter becomes more important. To cope with uncertainty in deposit volumes and with fluctuations due to daily and seasonal effects, we need an anticipatory policy that balances the workload over time. We propose a relatively simple heuristic consisting of several tunable parameters depending on the day of the week. We tune the parameters of this policy using optimal learning techniques combined with simulation. We illustrate our approach using a real life problem instance of a waste collection company, located in The Netherlands, and perform experiments on several other instances. For our case study, we show that costs savings up to 40{\%} are possible by optimizing the parameters.",
    keywords = "IR-91703, METIS-304926",
    author = "Mes, {Martijn R.K.} and Schutten, {Johannes M.J.} and {Perez Rivera}, {Arturo Eduardo}",
    year = "2014",
    doi = "10.1016/j.wasman.2014.05.011",
    language = "English",
    volume = "34",
    pages = "1564--1576",
    journal = "Waste management",
    issn = "0956-053X",
    publisher = "Elsevier",
    number = "9",

    }

    Inventory routing for dynamic waste collection. / Mes, Martijn R.K.; Schutten, Johannes M.J.; Perez Rivera, Arturo Eduardo.

    In: Waste management, Vol. 34, No. 9, 2014, p. 1564-1576.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Inventory routing for dynamic waste collection

    AU - Mes, Martijn R.K.

    AU - Schutten, Johannes M.J.

    AU - Perez Rivera, Arturo Eduardo

    PY - 2014

    Y1 - 2014

    N2 - We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense networks, the latter becomes more important. To cope with uncertainty in deposit volumes and with fluctuations due to daily and seasonal effects, we need an anticipatory policy that balances the workload over time. We propose a relatively simple heuristic consisting of several tunable parameters depending on the day of the week. We tune the parameters of this policy using optimal learning techniques combined with simulation. We illustrate our approach using a real life problem instance of a waste collection company, located in The Netherlands, and perform experiments on several other instances. For our case study, we show that costs savings up to 40% are possible by optimizing the parameters.

    AB - We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense networks, the latter becomes more important. To cope with uncertainty in deposit volumes and with fluctuations due to daily and seasonal effects, we need an anticipatory policy that balances the workload over time. We propose a relatively simple heuristic consisting of several tunable parameters depending on the day of the week. We tune the parameters of this policy using optimal learning techniques combined with simulation. We illustrate our approach using a real life problem instance of a waste collection company, located in The Netherlands, and perform experiments on several other instances. For our case study, we show that costs savings up to 40% are possible by optimizing the parameters.

    KW - IR-91703

    KW - METIS-304926

    U2 - 10.1016/j.wasman.2014.05.011

    DO - 10.1016/j.wasman.2014.05.011

    M3 - Article

    VL - 34

    SP - 1564

    EP - 1576

    JO - Waste management

    JF - Waste management

    SN - 0956-053X

    IS - 9

    ER -