IDEAS home Printed from https://ideas.repec.org/a/bit/bsrysr/v3y2012i1p14-22.html
   My bibliography  Save this article

Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem

Author

Listed:
  • Djordjevic Milan
  • Grgurovič Marko
  • Brodnik Andrej

    (Department of Information Science and Technology, University of Primorska, Koper, Slovenia)

Abstract

Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the influence of hybridization of a genetic algorithm with a local optimizer on solving instances of the Travelling Salesman Problem. Methods/Approach: Our algorithm uses hybridization that occurs at various percentages of generations of a genetic algorithm. Moreover, we have also studied at which generations to apply the hybridization and hence applied it at random generations, at the initial generations, and at the last ones. Results: We tested our algorithm on instances with sizes ranging from 76 to 439 cities. On the one hand, the less frequent application of hybridization decreased the average running time of the algorithm from 14.62 sec to 2.78 sec at 100% and 10% hybridization respectively, while on the other hand, the quality of the solution on average deteriorated only from 0.21% till 1.40% worse than the optimal solution. Conclusions: In the paper we have shown that even a small hybridization substantially improves the quality of the result. Moreover, the hybridization in fact does not deteriorate the running time too much. Finally, our experiments show that the best results are obtained when hybridization occurs in the last generations of the genetic algorithm.

Suggested Citation

  • Djordjevic Milan & Grgurovič Marko & Brodnik Andrej, 2012. "Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem," Business Systems Research, Sciendo, vol. 3(1), pages 14-22, June.
  • Handle: RePEc:bit:bsrysr:v:3:y:2012:i:1:p:14-22
    as

    Download full text from publisher

    File URL: https://www.degruyter.com/view/j/bsrj.2012.3.issue-1/v10305-012-0002-4/v10305-012-0002-4.xml?format=INT
    Download Restriction: no

    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:bit:bsrysr:v:3:y:2012:i:1:p:14-22. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Peter Golla). General contact details of provider: https://www.sciendo.com/services/journals .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.