An Efficient African Buffalo Optimization Algorithm for Traveling Salesman Problem Using Fuzzy Matrix

Type de record:

paper

Créateur:

GhaAsm

Éditeur:

Res

Hôte:

Abstract African Buffalo Optimization, as a novel evolutionary computing technique, has succeeded in many continuous problems, but research on discrete problems especially combinatorial optimization problem has been done little. In this paper, a modified African Buffalo Optimization (ABO) algorithm was proposed to solve a typical combinatorial optimization problem: Traveling Salesman Problem (TSP), which is a well-known NP-hard problem. Fuzzy Matrices were used to represent the Location and speed of the Buffaloes in ABO and the operators in the original ABO formulas were redefined. Then the algorithm was tested with concrete examples in TSPLIB, experiment shows that the algorithm can achieve good results.

Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster

Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimiz

Learning Combined Set Covering and Traveling Salesman Problem

The Traveling Salesman Problem is one of the most intensively studied combinatorial optimization pro

Prey Predator Algorithm for Travelling Salesman Problem

Visiting most, if not all, tourist destination of a country while visiting a country is an ideal pla

ASIF Approach to Solve the Green Traveling Salesman Problem

The present article describes a contribution to solve transportation problems with green constraints

Numerical Function Optimization Solutions Using the African Buffalo Optimization Algorithm (ABO)

International audience This paper proposes a new meta-heuristic approach to solving c

Determination of support vector regression parameters using African buffalo optimization algorithm

The use of support vector regression (SVR) for regression tasks has been on increase over t