A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem

L. Kóczy, Peter Foldesi, Boldizsar Tuu-Szabo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

This paper presents a Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA) for the Traveling Salesman Problem. This algorithm combines the very efficient bacterial evolutionary algorithm with 2-opt and 3-opt local searches. Our approach was tested on TSPLIB and other VLSI benchmark problems. In this paper our computational results (minimal tour lengths, run times) are compared with other efficient TSP solver algorithms (Lin-Kernighan, Concorde). We will show that in significant number of the published benchmark problems the optimal tour was not found by the Concorde algorithm and the Lin-Kernighan heuristic because this approaches use an approximation substituting distances of points by the closest integer values. We suggest the substitution of the benchmark result set by the real optima calculated by the new DBMEA algorithm and the use of DBMEA heuristic as more precise for the solution of TSP and other NP-hard optimization problems.

Original languageEnglish
Title of host publication2016 IEEE Congress on Evolutionary Computation, CEC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3261-3267
Number of pages7
ISBN (Electronic)9781509006229
DOIs
Publication statusPublished - Nov 14 2016
Event2016 IEEE Congress on Evolutionary Computation, CEC 2016 - Vancouver, Canada
Duration: Jul 24 2016Jul 29 2016

Other

Other2016 IEEE Congress on Evolutionary Computation, CEC 2016
CountryCanada
CityVancouver
Period7/24/167/29/16

Keywords

  • Discrete optimization
  • Evolutionary computation
  • Memetic algorithm
  • Traveling Salesman Problem

ASJC Scopus subject areas

  • Artificial Intelligence
  • Modelling and Simulation
  • Computer Science Applications
  • Control and Optimization

Fingerprint Dive into the research topics of 'A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem'. Together they form a unique fingerprint.

  • Cite this

    Kóczy, L., Foldesi, P., & Tuu-Szabo, B. (2016). A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem. In 2016 IEEE Congress on Evolutionary Computation, CEC 2016 (pp. 3261-3267). [7744202] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CEC.2016.7744202