IDEAS home Printed from https://ideas.repec.org/a/igg/jsda00/v9y2020i3p58-73.html
   My bibliography  Save this article

A Hybrid Hierarchical Heuristic-ACO With Local Search Applied to Travelling Salesman Problem, AS-FA-Ls

Author

Listed:
  • Nizar Rokbani

    (High Institute of Applied Science and Technology of Sousse, University of Sousse, Tunisia & REGIM-Lab, University of Sfax, Tunisia & National Engineering School of Sfax, Tunisia)

  • Pavel Kromer

    (Department of Computer Science, FEECS, VSB - Technical University of Ostrava, Czech Republic)

  • Ikram Twir

    (High Institute of Applied Science and Technology of Sousse, University of Sousse, Tunisia)

  • Adel M. Alimi

    (REGIM-Lab, University of Sfax, Tunisia & National Engineering School of Sfax, Tunisia)

Abstract

The combinatorial optimization problem is attracting research because they have a wide variety of applications ranging from route planning and supply chain optimization to industrial scheduling and the IoT. Solving such problems using heuristics and bio-inspired techniques is an alternative to exact solutions offering acceptable solutions at fair computational costs. In this article, a new hierarchical hybrid method is proposed as a hybridization of Ant Colony Optimization (ACO), Firefly Algorithm (FA), and local search (AS-FA-Ls). The proposed methods are compared to similar techniques on the traveling salesman problem, (TSP). ACO is used in a hierarchical collaboration schema together with FA which is used to adapt ACO parameters. A local search strategy is used which is the 2 option method to avoid suboptimal solutions. A comparative review and experimental investigations are conducted using the TSP benchmarks. The results showed that AS-FA-Ls returned better results than the listed works in the following cases: berlin52, st70, eil76, rat99, kroA100, and kroA200. Computational investigations allowed determining a set of recommended parameters to be used with ACO for the TSP instances of the study.

Suggested Citation

  • Nizar Rokbani & Pavel Kromer & Ikram Twir & Adel M. Alimi, 2020. "A Hybrid Hierarchical Heuristic-ACO With Local Search Applied to Travelling Salesman Problem, AS-FA-Ls," International Journal of System Dynamics Applications (IJSDA), IGI Global, vol. 9(3), pages 58-73, July.
    • Handle: RePEc:igg:jsda00:v:9:y:2020:i:3:p:58-73
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSDA.2020070104
    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:jsda00:v:9:y:2020:i:3:p:58-73. 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.