Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
VLSI cell placement techniques
ACM Computing Surveys (CSUR)
Proceedings of the fourth international conference on Genetic algorithms
Proceedings of the fourth international conference on Genetic algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An efficient heuristic algorithm for mapping parallel programs onto multicomputers
Microprocessing and Microprogramming
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Computer
A Cartesian Parallel Nested Dissection Algorithm
SIAM Journal on Matrix Analysis and Applications
Swarm intelligence
Genetic algorithm convergence study for sensor network optimization
Information Sciences—Informatics and Computer Science: An International Journal - Special issue on evolutionary algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms and Manufacturing Systems Design
Genetic Algorithms and Manufacturing Systems Design
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Proceedings of the 5th International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Application of A Multi-Species Optimizer in Ubiquitous Computing for RFID Networks Scheduling
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 02
IEEE Transactions on Computers
Improved binary PSO for feature selection using gene expression data
Computational Biology and Chemistry
Binary particle swarm optimization for black-scholes option pricing
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
Optimal scheduling for networks of RFID readers
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Energy-Efficient deployment of mobile sensor networks by PSO
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
| Hi-index | 0.00 |
RFID is an emerging technique for identifying items and all kinds of real world applications. Multi RFID readers are implemented to the product line in many industries and they consist of varied reader resources. But there are some defects with the disposition of the RFID-based application. The phenomenon of incorrect negative reads occurs in a multi-tag and multi-reader environment where a tag that is present is not detected. Collisions occurring between readers cause the faulty or missing reads. The stopgap is to solve the frequency allocation problem for networks of RFID readers. Furthermore, finding the optimal structure of readers and scheduling the readers to reduce the total system transaction time or response time are both challenging problems. In the presence of interdependencies, the optimal scheduling problem to minimize the overall transaction or response time is modeled as a graph partitioning problem (GPP). GPP is a well known NP-complete problem. The more readers exist in the product line, the higher complexity of the problem. Designing a schedule having the maximum parallelism reduces the total transaction time but may not minimize it. In this research, we integrate genetic algorithms with binary particle swarm optimization (GA-BPSO) to solve the Multi RFID networks scheduling problem. Simulation results on a real-world problem show that the GA-BPSO algorithm provides robust solution quality and is suitable for scheduling large scale RFID reader networks.