A Path Adjustment Algorithm of the Combination of Genetic Algorithm and Ant Colony Algorithm

Precocity, stagnation and phenomenon of long time convergence often emerge from classical genetic algorithm or ant colony algorithm. At the same time, they have different features of convergence in each algorithm. So, a coevolutionary model is presented based on genetic algorithm and ant colony algorithm, which runs one of the above two algorithm and exchanges another by estimating the state of their running. In order to search optimal result of problem, genetic algorithm and ant colony algorithm can run conjunctly in the model. Through the experimentation on symmetric and asymmetric TSP, the outcome shows that compared with other algorithm, the algorithm of the model takes a great improvement in the convergent speed, result optimization and also the avoidance of the precocity and stagnation.

The partner selection in virtual enterprises organization is one of the key issues corporate enterprises experience nowadays. Based on the model of Ant Colony Optimization Algorithm (ACA) in virtual enterprise partner selection, in this paper, we fuse the genetic algorithm into ACA, called fusion algorithm, in order to improve the effect of the partner selection. The fusion algorithm has two steps: 1) it uses the GA to optimize the model of partner selection and takes advantages of rapid convergence of GA in initial search periods. 2) When GA search speed has become slow, the ACA takes over the search process, in which it uses the candidates produced by the GA as the seeds of pheromone used by ACA. By experimental comparison with GA optimization and ACA optimization, it shows that the fusion algorithm has performed better than the GA and ACA optimization, respectively, in both speed and accuracy under our selected numerical case. The fusion algorithm presented in this study may be applicable to similar business problems.

This paper transformed the process of Chinese question answering into agent coalition formation first, and then got the solution by using of combination of genetic algorithm and ant colony algorithm. The idea and routine of the algorithm were given. Coding scheme, selecting scheme, crossover operator, mutation operator and so on of genetic algorithm which suitable for Chinese question answering agent coalition were designed. The basic ant colony algorithm was improved. The experiment showed that the algorithm could accelerate the convergence rate and improve the ability of searching an optimum solution, avoid falling into local optimums.

Robot coalition problem is a complicated combinatorial optimization problem. In this paper, a novel quantum ant colony algorithm for the problem is proposed, where the thought of quantum evolution algorithm is combined with ant colony algorithm. In this algorithm, the pheromone is encoded by quantum bits and a new pheromone representation is designed. To avoid the algorithm falling into local optimum, the strategy of quantum crossover is designed to improve the information structure of population. Simulation results show that the algorithm is more effective than quantum genetic algorithm and basic ant colony algorithm.

In the field of health care, the Wireless Body Area Networks(WBANs), through placed miniaturization, low power consumption of sensor nodes in patient's body or on the surface to measure a variety of physiological parameters, to monitor or diagnose the health of human body. However, in this process, WBANs nodes usually use batteries, especially for implantable flexible node it is difficult to accomplish the replacement of batteries, the energy that the node can carry is very limited, so the efficient use of energy is the most important problem to consider when designing WBANs routing algorithm. By considering the factors such as residual energy of node, the importance level of node, path cost and path energy difference ratio, this paper gives the definition of Optimal Path of Energy Consumption(OPEC) in WBANs, and The Optimal Energy Consumption Artificial Bee Colony(ABC) Based WBANs(OEABC) is designed. The performance simulation is carried out to verify the effectiveness of the OEABC, compared with Genetic Algorithm and Ant Colony Algorithm, it shows that t the OEABC has a fast convergence rate.

Airport information weak current system is the core of airport terminal, which is responsible for information interaction, power resource and energy consumption management among subsystems of airport terminal. Meanwhile, it is also responsible for main business dispatch management of entire airport terminal. Therefore, starting with basic ant colony algorithm and considering respective advantages of genetic and ant colony algorithms, optimization cycle of the two algorithms is introduced multiple times in this paper. Moreover, after each loop iteration of ant colony algorithm, optimal solution generated by ant colony algorithm will be added to genetic algorithm so that iterative speed of genetic algorithm can be accelerated. Meanwhile, solution calculated by genetic algorithm will be set to better path to update pheromone allocation in ant colony algorithm and achieve parameter adjustment. Experimental test proves that geneticant colony hybrid algorithm proposed in this paper has good convergence and solution efficiency, which can find the shortest path with suitable conditions in complex road networks.

The crowd-creation space is a manifestation of the development of innovation theory to a certain stage. With the creation of the crowd-creation space, the problem of optimizing the resource allocation of the crowd-creation space has become a research hotspot. The emergence of cloud computing provides a new idea for solving the problem of resource allocation. Common cloud computing resource allocation algorithms include genetic algorithms, simulated annealing algorithms, and ant colony algorithms. These algorithms have their obvious shortcomings, which are not conducive to solving the problem of optimal resource allocation for crowd-creation space computing. Based on this, this paper proposes an In the cloud computing environment, the algorithm for optimizing resource allocation for crowd-creation space computing adopts a combination of genetic algorithm and ant colony algorithm and optimizes it by citing some mechanisms of simulated annealing algorithm. The algorithm in this paper is an improved genetic ant colony algorithm (HGAACO). In this paper, the feasibility of the algorithm is verified through experiments. The experimental results show that with 20 tasks, the ant colony algorithm task allocation time is 93ms, the genetic ant colony algorithm time is 90ms, and the improved algorithm task allocation time proposed in this paper is 74ms, obviously superior. The algorithm proposed in this paper has a certain reference value for solving the creative space computing optimization resource allocation.

Mobile robots are widely used in daily life, and ant colony algorithm is often adopted for its path planning. However, the classic ant colony algorithm has poor search ability and search speed due to the monotony of individuals within the population. In order to solve the problems of local optimal solution, slow convergence speed and low search efficiency of classic ant colony algorithm, a genetic-ant colony algorithm is proposed in this paper. The algorithm parameters are optimized by simulation experiment to determine the best parameter combination. The method is to give a certain range of random pheromone values to the primary ant individuals to enrich the population diversity. In each cycle, m ants are sent for foraging. After each foraging cycle, aiming at the growth of individual pheromone value, the fitness function of genetic algorithm is established to evaluate individual fitness value, and the parental individuals carry out genetic operations such as selection, crossover and variation to produce offspring individuals with the same number and higher pheromone level, the offspring individuals carry out the next cycle of foraging and keep cycling. The population diversity is maintained at a high level, while the increase in the level of individual pheromone speeds up the convergence and operation of the algorithm. The simulation results show that the running time of the improved algorithm is significantly shorter than that of the traditional ant colony algorithm in the 40 * 40 grid map, and the running time of the algorithm is reduced by 21.34%; in the complex grid environment, the frequency of obtaining the optimal path of the algorithm is significantly higher than that of ordinary ant colonies, and the frequency is increased; and the number of iterations when the optimal path is reached for the first time is significantly reduced,–which has verified the effectiveness, stability and superiority of genetic-ant colony algorithm.

Ant colony optimization (ACO) algorithm is a metaheuristic inspired by the behavior of real ants in their search for the shortest path to food sources. The ACO algorithm takes on these characteristics of robust, positive feedback distributed computing, easy fusing with other algorithms. But the basic ACO algorithm has some deficiencies of premature and stagnation phenomenon in the evolution process, and is easily trapped into local optimal solution. And it is difficult to explore other solutions in the neighbor space. So a improved ACO(DPSEMACO) algorithm based on dual population strategy, bi-directional dynamic adjust evaporation factor strategy of the pheromone and parallel strategy is proposed to solve the traveling salesman problem(TSP). In the DPSEMACO algorithm, the ants are divided into the two subpopulations by borrowing the mutual cooperation mechanism of biological community, which evolve separately and exchange information timely. The bi-directional dynamic adjusting evaporation factor strategy of the pheromone is used to change the corresponding path pheromone of different subpopulations in order to avoid to trap into a local optimum. The parallel strategy can avoid falling into a local optimum. And the DPSEMACO algorithm can expand the search space and improve the overall searching performance by repeated changing the pheromone of the each subpopulation and adaptive adjusting evaporation factor. Finally, in order to prove the optimization performance of the proposed DPSEMACO algorithm, some classic TSP instances are selected from the TSPLIB in this paper. And some existing methods are selected to compare the optimization performance with the proposed DPSEMACO algorithm. The experimental results demonstrate that the proposed DPSEMACO algorithm is feasible and effective in solving TSP, and takes on a good global searching ability and high convergence speed.

Weapon-Target Assignment (WTA) problems are to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. In this paper, a novel hybrid algorithm of ant colony optimization (ACO) and genetic algorithm is proposed to solve WTA problems. The proposed algorithm is to enhance the search performance of genetic algorithms by embedded ACO so as to have locally optimal offspring. This algorithm is successfully applied to WTA problems. From our simulations for those tested problems, the proposed algorithm has the best performance when compared to other existing search algorithms.

The enhancement of software quality and reliability has become an important task in the field of software engineering. Software testing is an important step that guarantees software quality and reliability and also an energy-consuming and time-consuming task. Therefore, improving the automation ability of software testing is very important for ensuring software's quality and reducing development cost. This paper designs a new Net-Path-Model, introduces the Genetic Algorithm and Ant Colony Optimization test cases Generating theory with the Model. The paper also realizes the theory for Path-cover Test Cases Generating based on ProGrammar in VC++6.0.

The mobile agent route is essentially a multi-constraint optimization problem, Genetic Algorithms has fast random global search ability, but the feedback information of the system does not use and has the problem of low efficiency of finding exact solutions, propose a genetic hybrid ant colony algorithm for WSN mobile agent route. Use of the fast random global search capabilities of genetic algorithm to find better solutions, then the better solution replaced by the initial pheromone of the ant colony algorithm, finally use the advantages of convergence speed of ant colony algorithm to find the global optimal solution for mobile agent route. Simulation results show that the algorithm can find optimal mobile agent route in a relatively short time, relative to other routing algorithms, reducing network latency and average energy consumption, improving the speed and efficiency of data transfer.

Shipping route problem is a vital problem for maximizing the profits in sea transportation, which can be essentially regarded as a multi-objective optimization problem. In this work, a model of shipping route optimization problem is established, and then an efficient approach called membrane algorithm is introduced to solve the problem, which is inspired from the behaviors of chemicals communicating among living cells. We test our method on a simulated data experiment. Experimental results show that our method can efficiently find the globally optimal route and performs superior to the genetic algorithm and ant colony algorithm.

In this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be found in the stream cipher, and may be explored by the cryptanalysts. This work can find the optimal solution for text with minimum lengths of 20 characters and 100 iteration were very enough to find the real initial values of key stream.

Inter-island shipment requests for rock aggregate products are served through the terminal for their own needs (TFON). The high demand for rock aggregate products causes many ships to queue up to be loaded. However, this condition is not comparable to the availability of dump trucks used to serve loading and unloading activities. This study aims to improve the performance of dump truck service in transporting rock aggregate so that the number of dump truck vehicles and optimal loading and unloading service times from the stockpile to ship at TFON are obtained. The research location was carried out at active rock mining companies in the Central Sulawesi region. The data collection method is carried out using field surveys (observations) using a time recording device by recording the process of transporting rock aggregates from the stockpile location to the ship in TFON and collecting secondary data on the demand for rock aggregates to be transported. The analysis method uses the hybrid Genetic Ant Colony Algorithm (ACO-GA) method namely a combination method between the Ant Colony Optimization algorithm and the Genetic Algorithm which aims to maximize the optimal number of trucks used in the transportation process and minimize the time in the loading and unloading process. The results showed that there had been an increase in service performance of the dump truck used in transporting rock aggregate with the longest distance of 2.3 km with a total of 5 dump trucks. The number of dump trucks of 5 units was selected because it falls within the fitness value criteria which is closest to the optimum value or equal to the value of the resources owned. Meanwhile, the optimal loading and unloading process time is in the range of 1.81–3.34 working days