{"references": ["Andonov R, Poirriez V, Rajopadhye S, Unbounded knapsack problem:\nDynamic Programming revisited, European Journal of Operation Research,\nVol. 123, pp.394-407, 2000.", "Back T. Fogel D B, Michalewiez Z (eds.), Handbook of Evolutionary\nComputation, Oxford University Press, 1975.", "D.Beasley, D.R.Bull, and R.R.Martin ,An overview of genetic algorithms:\nPart I. fundamentals, University computing , 15, 58-69, 1993.", "D. Beasley, D.R.Bull, and R.R.Martin, An overview of genetic algorithms:\nPart II. Research topics, University computing ,15,170-181, 1993.", "Bellman R. and Dreyfus.S.E., Applied Dynamic Programming, Princeton\nUniversity Press, Princeton, NJ, 27-31 , 1962.", "Chanin Srisuwannapa, Peerayuth Charnsethikul, An Exact Algorithm for\nthe Unbounded Knapsack problem with Minimizing Maximum Processing\nTime, Journal of Computer Science 3 (3): 138-143, 2007.", "P.C.Chu and J.E.Beasely, A Genetic Algorithm for the Generalized\nAssignment Problem, Computer Ops. Res. , vol. 24, No.1, 17-23, 1997..", "P.C.Chu and J.E.Beasely, A Genetic Algorithm for the Multi-dimensional\nKnapsack problem, Journal of Heuristics, Vol. 4, 63-86,1998.", "Dudzinski.K, A note on dominance relation in unbounded knapsack\nproblems, Operation Research Letters, 10(7), 417-419, 1991.\n[10] Garey M R. Johnson D S, Computers and intractability, A guide to\ntheory of NP-Completeness, Freeman and Co., San Francisco, 1979.\n[11] D.E. Goldberg, Genetic Algorithms in search, optimization and machine\nlearning, Addition Wesley, Reading, MA,1989.\n[12] Hans Kellerer, Ulrich Pferschy, David Pisinger, Knapsack Problems,\nSpringer - Verlag , 2003.\n[13] Ken-li Li, Guang-ming Dal, Qing-hua Li, A Genetic Algorithm for the\nUnbounded Knapsack Problem, Proceedings of the Second International\nconference on Machine Learning and Cybernetics, Xi-an, IEEE, 2-5\nNovember 2003.\n[14] Kulanoot Araya , Algorithms for some hard knapsack problems , PhD\nThesis , Curtin University of Technology, 2000.\n[15] 15. Martello S Toth P, Knapsack problems: Algorithms and Computer\nimplementation, Wiley, New York, 1990.\n[16] Martello.S, toth.P., An exact algorithm for large unbounded knapsack\nproblems, Operation Research letters, 9(1), 15-20, 1990.\n[17] Osman K.Erol, Ibrahim Eksin, A new optimization method: Big Bang-\nBig Crunch, Advances in Engineering Software 37, 106-111, 2006.\n[18] Poirriez, V., Yanev, N., Andonov, R., A hybrid algorithm for the unbounded\nknapsack problem, Discrete Optimization, 6(1),110-124, 2009.\n[19] Rung-Ching Chen, Cheng-Huei Jian,Yung-Fa Huang, Solving Unbounded\nKnapsack Problem using an Adaptive Genetic Algorithm with\nElitism Strategy, International Journal of Smart Home, Vol. 2, No. 2,\n139-150, 2008.\n[20] Shih.w, A branch and bound method for the multi constraint 0-1\nknapsack problem, J.Oper.Res.Soc., 30, 369-378, 1979.\n[21] D.Venkatesan, K.Kannan, R.Saravanan, A genetic algorithm-based artificial\nneural network model for The optimization of machining processes,\nNeural Computing and Applications, 18,135-140, 2009."]}

In this paper a new Genetic Algorithm based on a heuristic operator and Centre of Mass selection operator (CMGA) is designed for the unbounded knapsack problem(UKP), which is NP-Hard combinatorial optimization problem. The proposed genetic algorithm is based on a heuristic operator, which utilizes problem specific knowledge. This center of mass operator when combined with other Genetic Operators forms a competitive algorithm to the existing ones. Computational results show that the proposed algorithm is capable of obtaining high quality solutions for problems of standard randomly generated knapsack instances. Comparative study of CMGA with simple GA in terms of results for unbounded knapsack instances of size up to 200 show the superiority of CMGA. Thus CMGA is an efficient tool of solving UKP and this algorithm is competitive with other Genetic Algorithms also.