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

Implementation of an H-PSOGA Optimization Model for Vehicle Routing Problem

Author

Listed:
  • Justice Kojo Kangah

    (Kwame Nkrumah University of Science and Technology, Ghana)

  • Justice Kwame Appati

    (University of Ghana, Ghana)

  • Kwaku F. Darkwah

    (Kwame Nkrumah University of Science and Technology, Ghana)

  • Michael Agbo Tettey Soli

    (University of Ghana, Ghana)

Abstract

This work presents an ensemble method which combines both the strengths and weakness of particle swarm optimization (PSO) with genetic algorithm (GA) operators like crossover and mutation to solve the vehicle routing problem. Given that particle swarm optimization and genetic algorithm are both population-based heuristic search evolutionary methods as used in many fields, the standard particle swarm optimization stagnates particles more quickly and converges prematurely to suboptimal solutions which are not guaranteed to be local optimum. Although both PSO and GA are approximation methods to an optimization problem, these algorithms have their limitations and benefits. In this study, modifications are made to the original algorithmic structure of PSO by updating it with some selected GA operators to implement a hybrid algorithm. A computational comparison and analysis of the results from the non-hybrid algorithm and the proposed hybrid algorithm on a MATLAB simulation environment tool show that the hybrid algorithm performs quite well as opposed to using only GA or PSO.

Suggested Citation

  • Justice Kojo Kangah & Justice Kwame Appati & Kwaku F. Darkwah & Michael Agbo Tettey Soli, 2021. "Implementation of an H-PSOGA Optimization Model for Vehicle Routing Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 12(3), pages 148-162, July.
  • Handle: RePEc:igg:jamc00:v:12:y:2021:i:3:p:148-162
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2021070106
    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:12:y:2021:i:3:p:148-162. 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.