8 June 2020 in IEEE Access
The optimization of logistics distribution can be defined as the multiple traveling salesman problem (MTSP). The purpose of existing heuristic algorithms, such as Genetic Algorithm (GA), Ant Colony Algorithm (ACO), etc., is to find the optimal path in a short time. However, two important factors of logistics distribution optimization, including work time window and the carrying capacity of the vehicle in distribution system, have been ignored. In this paper, we consider the influences of time limitation of modern commercial logistics and carrying capacity of the vehicle on the logistics optimization, and then propose a MTSP with constraints of time window and capacity of each salesman. We design a novel hybrid algorithm by combining the minimum spanning 1-tree with ACO to find the optimal solution. In addition, we improve the pheromone update rules to increase the search efficiency of ACO algorithm. The experiments show that the novel hybrid algorithm achieves a shorter path than the other algorithms.
1 January 2017 in Mathematical Problems in Engineering
With the wide deployment of cloud computing data centers, the problems of power consumption have become increasingly prominent. The dynamic energy management problem in pursuit of energy‐efficiency in cloud data centers is investigated. Specifically, a dynamic energy management system model for cloud data centers is built, and this system is composed of DVS Management Module, Load Balancing Module, and Task Scheduling Module. According to Task Scheduling Module, the scheduling process is analyzed by Stochastic Petri Net, and a task‐oriented resource allocation method (LET‐ACO) is proposed, which optimizes the running time of the system and the energy consumption by scheduling tasks. Simulation studies confirm the effectiveness of the proposed system model. And the simulation results also show that, compared to ACO, Min‐Min, and RR scheduling strategy, the proposed LET‐ACO method can save up to 28%, 31%, and 40% energy consumption while meeting performance constraints.
10 December 2019 in IEEE Access
In this paper, we design a double layers self-organized spiking neural P system with anti-spikes for fingerprint recognition. The system can self-adaptively create and delete synapse between the neurons in different layers and recognize fingerprints by the spike trains emitted out of the output neurons. Data experiments are conducted on FVC2002 and FVC2004 Databases with EER (Equal Error Rate) 9.5% around, and much less parameters are involved in our SN P systems than Capsule Neural Networks. To our best knowledge, it is the first attempt of using SN P systems to do fingerprint recognition, which can also provide theoretical models for spiking neural circuits recognizing fingerprints.
23 September 2026 in Journal of Medicinal Chemistry