IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v11y2020i3p92-107.html
   My bibliography  Save this article

A Nearest Neighbor Algorithm to Optimize Recycling Networks

Author

Listed:
  • 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)

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.

Suggested Citation

  • Mario M. Monsreal-Barrera & Oliverio Cruz-Mejia & Jose Antonio Marmolejo-Saucedo, 2020. "A Nearest Neighbor Algorithm to Optimize Recycling Networks," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 11(3), pages 92-107, July.
    • Handle: RePEc:igg:jamc00:v:11:y:2020:i:3:p:92-107
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2020070105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:11:y:2020:i:3:p:92-107. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.