A Comparison between FPPSO and B&B Algorithm for Solving Integer Programming Problems

Abstract

Branch and Bound technique (B&B) is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. Flower pollination Algorithm is a recently-developed method in the field of computational intelligence. In this paper is presented an improved version of Flower pollination Meta-heuristic Algorithm, (FPPSO), for solving integer programming problems. The proposed algorithm combines the standard flower pollination algorithm (FP) with the particle swarm optimization (PSO) algorithm to improve the searching accuracy. Numerical results show that the FPPSO is able to obtain the optimal results in comparison to traditional methods (branch and bound) and other harmony search algorithms. However, the benefits of this proposed algorithm is in its ability to obtain the optimal solution within less computation, which save time in comparison with the branch and bound algorithm.

Analysis of FPA and BA meta‐heuristic controllers for optimal path planning of mobile robot in cluttered environment

“…In [31,32], the authors have presented the qualitative and quantitative analysis of FPA and hybrid FPA meta-heuristic optimisation algorithms in different real-world applications. In [33,34], application and performance of nature inspired FPA and BA have been proposed. In [35], the authors presented the performance between BA and CS algorithm in path planning of mobile robot in simulation mode.…”

“…This paper addresses recent developed BA and FPA (2010 and 2012) based nature inspired optimisation algorithms [31][32][33][34][35][36][37], for solving path-planning of mobile robot. The advantages of such algorithms are that it is easy to implement, require a lesser number of parameters to be tuned and have fast convergence properties with less number of iterations.…”