IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v4y2013i1p17-38.html
   My bibliography  Save this article

Enhancements to the Localized Genetic Algorithm for Large Scale Capacitated Vehicle Routing Problems

Author

Listed:
  • Ziauddin Ursani

    (School of Engineering and Information Technology, Australian Defence Force Academy, University of New South Wales, Sydney, NSW, Australia)

  • Daryl Essam

    (School of Engineering and Information Technology, Australian Defence Force Academy, University of New South Wales, Sydney, NSW, Australia)

  • David Cornforth

    (School of DCIT, University of Newcastle, Callaghan, Newcastle, NSW, Australia)

  • Robert Stocker

    (School of Engineering and Information Technology, Australian Defence Force Academy, University of New South Wales, Sydney, NSW, Australia)

Abstract

This paper is a continuation of two previous papers where the authors used Genetic Algorithm with automated problem decomposition strategy for small scale capacitated vehicle routing problems (CVRP) and vehicle routing problem with time windows (VRPTW). In this paper they have extended their scheme to large scale capacitated vehicle routing problems by introducing selective search version of the automated problem decomposition strategy, a faster genotype to phenotype translation scheme, and various search reduction techniques. The authors have shown that genetic algorithm used with automated problem decomposition strategy outperforms the GAs applied on the problem as a whole not only in terms of solution quality but also in terms of computational time on the large scale problems.

Suggested Citation

  • Ziauddin Ursani & Daryl Essam & David Cornforth & Robert Stocker, 2013. "Enhancements to the Localized Genetic Algorithm for Large Scale Capacitated Vehicle Routing Problems," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 4(1), pages 17-38, January.
  • Handle: RePEc:igg:jaec00:v:4:y:2013:i:1:p:17-38
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaec.2013010102
    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:jaec00:v:4:y:2013:i:1:p:17-38. 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.