Search

One of the useful knowledge representation tools, which can describe the joint probability distribution between some random variables with a graphical model and can be trained by a dataset, is the Bayesian network (BN). A BN is composed of a network structure and a conditional probability distribution table for each node. Discovering an optimal BN structure is an NP‐hard optimization problem that various meta‐heuristic algorithms are applied to solve this problem by researchers. The genetic algorithms, ant colony optimization, evolutionary programming, artificial bee colony, and bacterial foraging optimization are some of the meta‐heuristic methods to solve this problem using a dataset. Most of these methods are applying a scoring metric to generate the best network structure from a set of candidates. A Fixed Structure Learning Automata‐Based (FSLA‐B) algorithm is presented in this paper to solve the structure learning problem of BNs. There is a fixed structure learning automaton for each pair of vertices in the BN's graph structure in the proposed algorithm. The action of this automaton determines the presence and direction of an edge between the vertices. The proposed algorithm performs a guided search procedure using the FSLA and escapes from local optimums. Several datasets are utilised in this paper to evaluate the performance of the proposed algorithm. By performing various experiments, multiple meta‐heuristic algorithms are compared with the introduced new one. The obtained results represented that the proposed algorithm could produce competitive results and find the near‐optimal solution for the BN structure learning problem. [ABSTRACT FROM AUTHOR]

In this paper, a new method of optimization is proposed based on the combination of Ant Colony Optimization (ACO) and Chaos Theory to solve Dynamic Travelling Salesman Problem (DTSP). ACO algorithm has been modified in a way by using chaos theory to obtain an optimal solution to solve DTSP. By combination of both chaos theory and ACO algorithm, a hybrid algorithm is created which provided a better net to solve DTSP. In hybrid algorithm, pheromone updating rule is performed by using Logistic Map function and is non-linear which can prevent premature convergence. Features such as high precision and good convergence rate to reach best results indicate our proposed hybrid algorithm is better. [ABSTRACT FROM AUTHOR]