When solving the routing problem with traditional ant colony algorithm, there is scarce in initialize pheromone and a slow convergence and stagnation for the complex network topology and the time-varying characteristi...When solving the routing problem with traditional ant colony algorithm, there is scarce in initialize pheromone and a slow convergence and stagnation for the complex network topology and the time-varying characteristics of channel in power line carrier communication of low voltage distribution grid. The algorithm is easy to fall into premature and local optimization. Proposed an automatic network algorithm based on improved transmission delay and the load factor as the evaluation factors. With the requirements of QoS, a logical topology of power line communication network is established. By the experiment of MATLAB simulation, verify that the improved Dynamic hybrid ant colony genetic algorithm (DH_ACGA) algorithm has improved the communication performance, which solved the QoS routing problems of power communication to some extent.展开更多
A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperati...A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving(MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm(GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm(GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm(ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency.展开更多
文摘When solving the routing problem with traditional ant colony algorithm, there is scarce in initialize pheromone and a slow convergence and stagnation for the complex network topology and the time-varying characteristics of channel in power line carrier communication of low voltage distribution grid. The algorithm is easy to fall into premature and local optimization. Proposed an automatic network algorithm based on improved transmission delay and the load factor as the evaluation factors. With the requirements of QoS, a logical topology of power line communication network is established. By the experiment of MATLAB simulation, verify that the improved Dynamic hybrid ant colony genetic algorithm (DH_ACGA) algorithm has improved the communication performance, which solved the QoS routing problems of power communication to some extent.
基金the National Science and Technology Support Program(No.2015BAG20B05)
文摘A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving(MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm(GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm(GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm(ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency.
