You can view the full text of this article for free using the link below.

Title: A modified single and multi-objective bacteria foraging optimisation for the solution of quadratic assignment problem

Authors: Saeid Parvandeh; Mohammadreza Boroomand; Fahimeh Boroumand; Pariya Soltani

Addresses: Department of Computer Science, University of Tulsa, Tulsa, OK, USA; Department of Molecular and Human Genetics, Baylor College of Medicine, Houston, TX, USA ' Department of Management, University of Akdeniz, Antalya, Turkey ' Department of Computer Engineering, Islamic Azad University of Boroujerd, Boroujerd, Lorestan, Iran ' Department of Computer Engineering, Islamic Azad University of Boroujerd, Boroujerd, Lorestan, Iran

Abstract: Non-polynomial hard (NP-hard) problems are challenging due to time-constraint. The bacteria foraging optimisation (BFO) algorithm is a metaheuristics algorithm that is used for NP-hard problems. BFO is inspired by the behaviour of the bacteria foraging such as E. coli. The aim of BFO is to eliminate weak foraging properties bacteria and maintain breakthrough foraging properties bacteria toward the optimum. However, reaching to optimal solutions are time-demanding. In this paper, we modified single objective and multi-objective BFO (MOBFO) by adding mutation and crossover from genetic algorithm operators to update the solutions in each generation, and local tabu search algorithm to reach the local optimum solution. Additionally, we used fast non-dominated sort algorithm in MOBFO to find the best non-dominated solutions. We evaluated the performance of the proposed algorithms with quadratic assignment problem instances. The experimental results show that our approaches outperform some previous optimisation algorithms in both convergent and divergent aspects.

Keywords: bacteria foraging optimisation; multi-objective optimisation; NSGA-II; local tabu search; quadratic assignment problem; QAP; non-dominated sort algorithm.

DOI: 10.1504/IJBIC.2021.113354

International Journal of Bio-Inspired Computation, 2021 Vol.17 No.1, pp.1 - 13

Accepted: 14 Jul 2020
Published online: 23 Feb 2021 *

Full-text access for editors Access for subscribers Free access Comment on this article