A Nearest Neighbor Algorithm to Optimize Recycling Networks

Mario M. Monsreal-Barrera, Oliverio Cruz-Mejia and Jose Antonio Marmolejo-Saucedo
Additional contact information
Mario M. Monsreal-Barrera: Texas A&M Transportation Institute, College Station, USA
Oliverio Cruz-Mejia: Universidad Autónoma del Estado de Mexico, Toluca, Mexico
Jose Antonio Marmolejo-Saucedo: Universidad Panamericana, Facultad de Ingeniería, Ciudad de México, Mexico

International Journal of Applied Metaheuristic Computing (IJAMC), 2020, vol. 11, issue 3, 92-107

Abstract: This article analyses the processes of collecting used non-returnable packaging to improve the recycling of material. A collection system is proposed by applying a profitable visit algorithm based on the widely-known Nearest Neighbor Algorithm. A comparative study is performed to achieve a higher volume of recycled material while decreasing the cost of collection. The proposed algorithm shows a much better performance than the reference. The developed algorithm was evaluated in a real scenario and confirmed by a simulation runs. Savings in material sourcing processes can be achieved in real operations. The proposed algorithm shows some advantage.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAMC.2020070105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:11:y:2020:i:3:p:92-107

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().