Due to the effectiveness, simple deployment and low cost, radio frequency identification （RFID） systems are used in a variety of applications to uniquely identify physical objects. The operation of RFID systems often involves a situation in which multiple readers physically located near one another may interfere with one another＇s operation. Such reader collision must be minimized to avoid the faulty or miss reads. Specifically, scheduling the colliding RFID readers to reduce the total system transaction time or response time is the challenging problem for large-scale RFID network deployment. Therefore, the aim of this work is to use a successful multi-swarm cooperative optimizer called pseo to minimize both the reader-to-reader interference and total system transaction time in RFID reader networks. The main idea of pS20 is to extend the single population PSO to the interacting multi-swarm model by constructing hierarchical interaction topology and enhanced dynamical update equations. As the RFID network scheduling model formulated in this work is a discrete problem, a binary version of PS20 algorithm is proposed. With seven discrete benchmark functions, PS20 is proved to have significantly better performance than the original PSO and a binary genetic algorithm, pS20 is then used for solving the real-world RFID network scheduling problem. Numerical results for four test cases with different scales, ranging from 30 to 200 readers, demonstrate the performance of the proposed methodology.
A new multi-species particle swarm optimization with a two-level hierarchical topology and the orthogonal learning strategy(OMSPSO) is proposed, which enhances the global search ability of particles and increases their convergence rates. The numerical results on 10 benchmark functions demonstrated the effectiveness of our proposed algorithm. Then, the proposed algorithm is presented to design a butterfly-shaped microstrip patch antenna. Combined with the HFSS solver, a butterfly-shaped patch antenna with a bandwidth of about 40.1% is designed by using the proposed OMSPSO. The return loss of the butterfly-shaped antenna is greater than 10 d B between 4.15 and 6.36 GHz. The antenna can serve simultaneously for the high-speed wireless computer networks(5.15–5.35 GHz) and the RFID systems(5.8 GHz).
The major challenge in printable electronics fabrication is to effectively and accurately control a drop-on-demand(Do D) inkjet printhead for high printing quality. In this work, an optimal prediction model, constructed with the lumped element modeling(LEM) and the artificial bee colony(ABC) algorithm, was proposed to efficiently predict the combination of waveform parameters for obtaining the desired droplet properties. For acquiring higher simulation accuracy, a modified dynamic lumped element model(DLEM) was proposed with time-varying equivalent circuits, which can characterize the nonlinear behaviors of piezoelectric printhead. The proposed method was then applied to investigate the influences of various waveform parameters on droplet volume and velocity of nano-silver ink, and to predict the printing quality using nano-silver ink. Experimental results show that, compared with two-dimension manual search, the proposed optimal prediction model perform efficiently and accurately in searching the appropriate combination of waveform parameters for printable electronics fabrication.
The artificial bee colony(ABC) algorithm is improved to construct a hybrid multi-objective ABC algorithm, called HMOABC, for resolving optimal power flow(OPF) problem by simultaneously optimizing three conflicting objectives of OPF, instead of transforming multi-objective functions into a single objective function. The main idea of HMOABC is to extend original ABC algorithm to multi-objective and cooperative mode by combining the Pareto dominance and divide-and-conquer approach. HMOABC is then used in the 30-bus IEEE test system for solving the OPF problem considering the cost, loss, and emission impacts. The simulation results show that the HMOABC is superior to other algorithms in terms of optimization accuracy and computation robustness.
