A periodic location routing problem for collaborative recycling

Abstract

Motivated by collaborative recycling efforts for non-profit agencies, we study a variant of the periodic location routing problem, in which one decides the set of open depots from the customer set, the capacity of open depots, and the visit frequency to nodes, in an effort to design networks for collaborative pickup activities.We formulate this problem, highlighting the challenges introduced by these decisions. We examine the relative difficulty introduced with each decision through exact solutions and a heuristic approach which can incorporate extensions of model constraints and solve larger instances. The work is motivated by a project with a network of hunger relief agencies (e.g., food pantries, soup kitchens and shelters) focusing on collaborative approaches to address their cardboard recycling challenges collectively. We present a case study based on data from the network. In this novel setting, we evaluate collaboration in terms of participation levels and cost impact. These insights can be generalized to other networks of organizations that may consider pooling resources.

Location‐routing problem: a classification of recent research

“…As shown in Table 6, the application of LRP models to optimize a case of waste management network planning (e.g., Rahim and Sepil, 2014;Sheriff et al 2014;Asefi et al, 2019;Hu et al, 2019) is by far the most popular study. Other popular application areas are emergency and disaster management (Rath and Gutjahr, 2014;Wang et al, 2014;Bozorgi-Amiri and Khorsi, 2016;Xu et al, 2016;Burkart et al, 2017;Veysmoradi et al, 2018;Wu et al, 2018;Liu et al, 2019a;Xiong et al, 2019), food distribution network planning (Solak et al, 2014;Hemmelmayr et al, 2017;Wu et al, 2017;Validi et al, 2018;Wang et al, 2018bWang et al, , 2018cChao et al, 2019;Saragih et al, 2019), and city logistics (Zhou et al, 2016; Zhou et al, 2017;Wang et al, 2018b;Chao et al, 2019;Rodriguez et al, 2019;Saragih et al, 2019;Schmidt et al, 2019). Each of these areas presents unique challenges for the researchers in the efforts to develop a model that correctly represents the real-life situation.…”

“…This is admittedly reasonable since the aforementioned metaheuristics are historically classical (Sörensen et al, 2018) and commonly used as a benchmark for proposing a new algorithm. The latest progress on this aspect also shows the emergence of large neighborhood search (Hemmelmayr, 2015;Yang and Sun, 2015;Koç, 2016;Koç et al, 2016aKoç et al, , 2016bRiquelme-Rodríguez et al, 2016;Tunalioglu et al, 2016;Hemmelmayr et al, 2017;Walther, 2018a, 2018b;Schiffer et al, 2018;Koç et al, 2019) as a new popular framework, which has been proposed as a "general" Koç (2016). The complete classification results of metaheuristics applications are presented in the Electronic Appendix.…”

“…A handful of publications also consider minimizing the inventory cost (11.26%) due to the emergence of ILRP model (e.g., Govindan et al, 2014;Guerrero et al, 2015;Kechmane et al, 2018b;Rabbani et al, 2019), which integrates the inventory decision into an LRP model. In terms of monetary objectives, it is observed that several works have started to consider maximizing the profit of the whole system (Rahim and Sepil, 2014;Vidović et al, 2016;Hemmelmayr et al, 2017;Ahmadi-Javid et al, 2018;Aydemir-Karadag, 2018;Setak et al, 2018;Dorrington and Olsen, 2019;Etebari, 2019;Hosseini et al, 2019), by incorporating the revenue aspect into the objective function. This approach has been discussed mainly in waste management domain (Rahim and Sepil, 2014;Hemmelmayr et al, 2017;Aydemir-Karadag, 2018), and one of its creative implementation in the asteroid mining supply chain is also found (Dorrington and Olsen, 2019).…”

The bi-objective periodic closed loop network design problem

“…In their model of periodic location problem, the aggregate lost demand costs over multiple periods is minimised. Hemmelmayr et al (2017) considered the collaborative recycling concept in the periodic location routing problem as a variant of PLRP in which one decides the set of depots to open, the capacity of depots to open and the visit frequency of the nodes in an effort to design networks for collaborative pickup activities. The flexible periodic location routing problem was another extension of the classical PLRP which was studied by Archetti et al (2017).…”

Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty

“…From an academic point of view, despite the increasing number of published works on the LRP, the consideration of flexible sizes for facilities has been rarely addressed in the literature. Nevertheless, real-life examples from both LRP [4,7,8] and non-LRP [5,6] contexts show the relevance of considering a variety of facility sizes to select from.…”