IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5559684.html
   My bibliography  Save this article

Reverse Logistics Vehicle Routing Optimization Problem Based on Multivehicle Recycling

Author

Listed:
  • Zhaohui Gao
  • Caiyun Ye

Abstract

In the reverse logistics recycling process, considering the diversity of recycling types, a variety of vehicle models are used to meet the reverse logistics recycling requirements. Therefore, this paper considers the fixed costs, transportation costs, carbon emission costs during driving, and time penalty costs in the reverse logistics process under multiple constraints such as multiple vehicle types and time windows in the recycling center. The recovery point is the recovery model, and an improved genetic algorithm is used to solve it. Drawing lessons from the idea of greed, the superiority of the initial population is improved; the entry matrix and the exit matrix of the iterative population are constructed, and the crossover operator is improved based on this, and the forward insertion method is introduced to design the hybrid crossover operation to speed up the population. At the same time, the improvement of the mutation operator is proposed to increase the diversity of the population. The experimental results show that the multivehicle mixed delivery mode can reduce costs more effectively than single-vehicle models, and the improved genetic algorithm has better convergence and stability.

Suggested Citation

  • Zhaohui Gao & Caiyun Ye, 2021. "Reverse Logistics Vehicle Routing Optimization Problem Based on Multivehicle Recycling," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-9, April.
  • Handle: RePEc:hin:jnlmpe:5559684
    DOI: 10.1155/2021/5559684
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/5559684.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/5559684.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5559684?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:5559684. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.