GENETIC ALGORITHM BASED ITERATIVE TWO-LEVEL ALGORITHM FOR RESOURCE ALLOCATION PROBLEMS AND APPLICATIONS

This study concerns the resource allocation problem that involves complicat- ing constraints and cannot be solved using correction operations of a genetic algorithm (GA). A GA-based iterative two-level algorithm is developed to solve this problem by decomposing it into master and slave problems, such that the complicating constraint function is treated as the objective function of the slave problem, which can be solved by GA, and the master problem, which includes the complicating constraint, is solved using a bisection method that is based on the optimal objective value determined in the slave problem. An example of the application of the proposed algorithm is the minimum time slot assignment problem (MTSAP) associated with a radio frequency identication (RFID) system. The GA that is utilized to solve the slave problem of the MTSAP has special features. The proposed algorithm is tested by applying it to the MTSAPs of four reader networks and many runs are performed for each MTSAP. The obtained solution to each MTSAP is optimal. The proposed algorithm is compared with a simulated an- nealing (SA) method. The comparison reveals that the proposed algorithm outperforms the SA method in terms of the optimality of the obtained solutions and computing speed.

[1]  Frank Yeong-Sung Lin,et al.  A Simulated Annealing Algorithm for RFID Reader Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[2]  Xiaolong Wang,et al.  A Heuristic Algorithm for Reliability Modeling and Analysis of Grid Systems , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[3]  Daniel W. Engels,et al.  Colorwave: an anticollision algorithm for the reader collision problem , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[4]  Min Chen,et al.  OPT: Optimal Protocol Tree for Efficient Tag Identification in Dense RFID Systems , 2006, 2006 IEEE International Conference on Communications.

[5]  A. Rizzi,et al.  Economical assessment of the impact of RFID technology and EPC system on the fast-moving consumer goods supply chain , 2008 .

[6]  Min Young Chung,et al.  Identification of RFID Tags in Framed-Slotted ALOHA with Robust Estimation and Binary Selection , 2007, IEEE Communications Letters.

[7]  Tae-Jin Lee,et al.  An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags , 2008, IEEE Communications Letters.

[8]  Dursun Delen,et al.  An RFID network design methodology for asset tracking in healthcare , 2010, Decis. Support Syst..

[9]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[10]  Daniel W. Engels,et al.  HiQ: a hierarchical Q-learning algorithm to solve the reader collision problem , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[11]  Chae-Woo Lee,et al.  An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[12]  Daniel W. Engels,et al.  Colorwave: a MAC for RFID reader networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[13]  Jaideep Srivastava,et al.  Adaptive binary splitting for efficient RFID tag anti-collision , 2006, IEEE Communications Letters.

[14]  Mun Leng Ng,et al.  The reader collision problem in RFID systems , 2005, 2005 IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications.

[15]  Sadiq M. Sait,et al.  Iterative computer algorithms with applications in engineering - solving combinatorial optimization problems , 2000 .

[16]  Xiaolong Wang,et al.  Optimal resource allocation on grid systems for maximizing service reliability using a genetic algorithm , 2006, Reliab. Eng. Syst. Saf..