Welcome to the InfoSci Platform
Reference Hub5
A Nearest Neighbor Algorithm to Optimize Recycling Networks

A Nearest Neighbor Algorithm to Optimize Recycling Networks

Mario M. Monsreal-Barrera, Oliverio Cruz-Mejia, Jose Antonio Marmolejo-Saucedo
Copyright: © 2020 |Volume: 11 |Issue: 3 |Pages: 16
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781799802860|DOI: 10.4018/IJAMC.2020070105
Cite Article Cite Article

MLA

Monsreal-Barrera, Mario M., et al. "A Nearest Neighbor Algorithm to Optimize Recycling Networks." IJAMC vol.11, no.3 2020: pp.92-107. http://doi.org/10.4018/IJAMC.2020070105

APA

Monsreal-Barrera, M. M., Cruz-Mejia, O., & Marmolejo-Saucedo, J. A. (2020). A Nearest Neighbor Algorithm to Optimize Recycling Networks. International Journal of Applied Metaheuristic Computing (IJAMC), 11(3), 92-107. http://doi.org/10.4018/IJAMC.2020070105

Chicago

Monsreal-Barrera, Mario M., Oliverio Cruz-Mejia, and Jose Antonio Marmolejo-Saucedo. "A Nearest Neighbor Algorithm to Optimize Recycling Networks," International Journal of Applied Metaheuristic Computing (IJAMC) 11, no.3: 92-107. http://doi.org/10.4018/IJAMC.2020070105

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.