Determining an optimal subdivision of gene transfer partitions

  • Authors:
  • Márk Farkas;Péter Földesi;János Botzheim;László T. Kóczy

  • Affiliations:
  • Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary;Department of Logistics and Forwarding, Széchenyi István University, Györ, Hungary;Department of Automation, Széchenyi István University, Györ, Hungary;Faculty of Engineering Sciences, Széchenyi István Univerity, Györ, Hungary and Department of Telecommunications and Media Informatics, Budapest University of Technology and Economic ...

  • Venue:
  • ACACOS'10 Proceedings of the 9th WSEAS international conference on Applied computer and applied computational science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Bacterial memetic algorithms are widely used on discrete combinatorial problems, which are essential in the field of logistics and forwarding, such as the well known Traveling Salesman Problem. The original Bacterial Evolutionary Algorithm proposed by Nawa and Furuhashi [5] has a predefined set of operators such as bacterial mutation and gene transfer also known as infection. The traditional bacterial infection operator is proven to be far from optimal. The authors suggest an alternative gene transfer operator that is applied on the metric Traveling Salesman Problem [9]. This alternative infection algorithm has superior rate of convergence while reducing the risk of getting stuck in a local optima.