An asymmetric vehicle routing problem arising in the collection and disposal of special waste

https://doi.org/10.1016/j.endm.2004.03.011Get rights and content

Abstract

In this paper we consider a particular pick-up and delivery vehicle routing problem, with unit vehicle capacity and possible compatibility constraints between consecutive operations. The problem arises in the collection and disposal of bulky recyclable waste, where containers of different types, used to collect different waste materials, must be picked-up to be emptied at suitable disposal plants and replaced by empty containers alike. Disposal plants depend on the material and are located in different sites. Here we provide a graph model based on an Asymmetric Vehicle Routing formulation and discuss heuristic algorithms. Preliminary computational results obtained on real data are reported.

References (7)

  • C. Archetti et al.

    Collection of waste with single load trucks: a real case

  • R. Aringhieri, M.Bruglieri, F.Malucelli, M.Nonato, “A particular vehicle routing problem arising in the collection and...
There are more references available in the full text version of this article.

Cited by (24)

  • Transport of skips between recycling centers and treatment facilities

    2022, Computers and Operations Research
    Citation Excerpt :

    Most studies consider the unit-capacity version of the problem in which there are typically four types of elementary routes which can be combined into trips to form workdays for the tractor: (1) move an empty skip between a customer location and a depot; (2) move a full skip from a customer location to a disposal site; (3) move an empty skip from a disposal site to a depot; (4) move an empty skip from a disposal facility to a customer location. Several versions of the problem have been defined, such as considering more than one disposal site (Aringhieri et al., 2004; Baldacci et al., 2006; Benjamin and Beasley, 2010), imposing time windows (Benjamin and Beasley, 2010; Wy et al., 2013; Li et al., 2018), route duration constraints (Aringhieri et al., 2018), a driver rest period (Benjamin and Beasley, 2010), using different routing costs for the tractors, depending on whether they carry a full or an empty skip (Li et al., 2018), or minimizing the number of tractors (Rabbani et al., 2016). Our problem is structurally different in that the tractor can carry two skips at a time, which yields the possibility of also performing elementary routes between two disposal facilities, as well as several additional ways of combining the elementary routes just described.

  • Discrete firefly algorithm with compound neighborhoods for asymmetric multi-depot vehicle routing problem in the maintenance of farm machinery

    2019, Applied Soft Computing Journal
    Citation Excerpt :

    A new heuristic algorithm was proposed to solve ACVRP. Aringhieri et al. [17] considered a particular vehicle routing problem, which emerged from the collection and disposal of bulky recyclable waste. A graph model for asymmetric vehicle routing formulation was provided, and heuristic algorithms were discussed.

  • An adaptive large neighborhood search heuristic for fleet deployment problems with voyage separation requirements

    2016, Transportation Research Part C: Emerging Technologies
    Citation Excerpt :

    In garbage collection, the waste must be picked up regularly, with customers having different frequency requirements. Often, the exact day on which the waste is picked up is not an issue as long as it is picked up regularly (Aringhieri et al., 2004). In home care services, clients with diverse needs must be served by employees with different skills, and each service requires a certain combinations of skills.

  • Collection of recyclables from cubes - A case study

    2014, Socio-Economic Planning Sciences
    Citation Excerpt :

    We then review a number of descriptive as well as operations research based papers from the waste transportation literature. Aringhieri et al. [7] describe a case study in Italy and investigate a transportation problem similar to A). The main difference between their problem and A) is that in Denmark, the vehicle carries two containers at a time (possibly with different origins and/or destinations), whereas the problem studied in Ref. [7] uses unit-capacity vehicles.

View all citing articles on Scopus
View full text