An improved real hybrid genetic algorithm

Želeći riješiti problem prerane konvergencije genetskog algoritma i algoritma roja čestica, kako bi se omogućilo da te dvije metode konvergiraju ka globalnom optimalnom rješenju uz najveću vjerojatnoću te da se poboljša učinkovitost algoritma, u članku će se kombinirati poboljšani genetski algoritam s metodom poboljšane optimalizacije roja čestica da bi se sastavio miješani poboljšani algoritam. Uz različite referentne funkcije upotrjebljene za testiranje funkcioniranja stvarno hibridnog genetskog algoritma, rezultati pokazuju da hibridni algoritam ima dobru globalnu sposobnost pretraživanja, brzu konvergenciju, dobru kvalitetu rješenja i dobru performansu rezultata optimalizacije.Aiming at the problem of premature convergence of genetic algorithm and particle swarm algorithm, in order to let the two methods converge to the global optimal solution with the greatest probability and improve the efficiency of the algorithm, the paper will combine improved genetic algorithm with improved particle swarm optimization method to constitute mixed improved algorithm. Through multiple benchmark function used to test the performance of real hybrid genetic algorithm, the results show that hybrid algorithm has good global search ability, fast convergence, good quality of the solution, and good robust performance of its optimization results

Modeling of Biological Intelligence for SCM System Optimization

This article summarizes some methods from biological intelligence for modeling and optimization of supply chain management (SCM) systems, including genetic algorithms, evolutionary programming, differential evolution, swarm intelligence, artificial immune, and other biological intelligence related methods. An SCM system is adaptive, dynamic, open self-organizing, which is maintained by flows of information, materials, goods, funds, and energy. Traditional methods for modeling and optimizing complex SCM systems require huge amounts of computing resources, and biological intelligence-based solutions can often provide valuable alternatives for efficiently solving problems. The paper summarizes the recent related methods for the design and optimization of SCM systems, which covers the most widely used genetic algorithms and other evolutionary algorithms

Traveling Salesman Problem

The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance