A high gain pifa at 2.45 GHz and 5.8 GHz using wireless power transfer techniques for pacemaker application

The design of a high gain Planar Inverted F Antenna (PIFA) with two different frequencies for medical pacemaker is presented. Two PIFA designs have been optimized to be operated at ISM band of 2.45 GHz and 5.8 GHz respectively, under tolerable reflection coefficient of less than -10dB. Both of the proposed antennas are developed from copper plate with a simple structure of rectangular patch. All design and simulation has been carried out using Computer Simulation Technology (CST) Microwave Studio Suite. The simulated and measured results of the fabricated antenna on reflection coefficient, bandwidth radiation pattern, and gain are presented to validate the usefulness of the presented design. The 2D Anechoic Chamber and Agilent Technologies Network Analyzer have been used for the measurement. Both 2.45 GHz and 5.8 GHz antennas have successfully manage to achieve high gain of 6dB and 8.2dB respectively with a directional beam pattern. The presented ISM PIFAs could be potential for point-to-point communication using wireless power transfer technique for medical pacemaker application

OPTIMIZATION OF CAPACITATED VEHICLE ROUTING PROBLEM USING PSO

Abstract: This paper presents solution techniques for Capacitated Vehicle Routing Problem (CVRP) using metaheuristics. Capacitated Vehicle Routing Problem is divided into set of customers called cluster, and find optimum travel distance of vehicle route. The CVRP is a combinatorial optimization problem; particle swarm optimization (PSO) technique is adapted in this paper to solve this problem. The main problem is divided into subprograms/clusters and each subprogram is treated as travelling salesman problem and solved by using particle swarm optimization techniques (PSO). This paper presents a sweep, Clark and wright algorithm to form the clusters. This model is then solved by using a particle swarm optimization (PSO) method to find optimum travel distance of vehicle route. Our analysis suggests that the proposed model enables users to establish route to serve all given customers with minimum distance of vehicles and maximum capacity

An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems

In this paper, the flexible flow shop sequence-dependent group scheduling problem (FFSDGS) with minimisation of makespan as the criterion (FFm | fmls, Splk |Cmax) is investigated. For the first time a mathematical model for the proposed research problem is developed. Since the problem is shown to be NP-hard, six metaheuristic algorithms based on tabu search (TS) are developed to efficiently solve the problem