 A periodic location routing problem for collaborative recyclingVera Hemmelmayr, Karen Smilowitz and Luis de la Torre IISE Transactions, 2017, vol. 49, issue 4, 414-428 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 that 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. Date: 2017 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:49:y:2017:i:4:p:414-428 Ordering information: This journal article can be ordered from DOI: 10.1080/24725854.2016.1267882 Access Statistics for this article IISE Transactions is currently edited by Jianjun Shi More articles in IISE Transactions from Taylor & Francis Journals |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.