The performance of the proposed method has been investigated in details viasome test cases constructed for the multi-target tracking problems.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In this paper, a specialized Genetic Algorithm is proposed and applied for the solution of the GeneralizedAssignment Problem.
📊
Temel Bulgular & Veri:Special crossover and the mutation operators called Common Element Crossover (CEX) andIn-Pool Mutation (IPM) respectively has been defined by focusing on the special needs and nature of theGeneralized Assignment Problem.
💡
Sonuç & Katkı:The performance of the proposed method has been investigated in details viasome test cases constructed for the multi-target tracking problems.
🔬Tür:Laboratuvar & Saha Deneyi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
Abstract
In this paper, a specialized Genetic Algorithm is proposed and applied for the solution of the GeneralizedAssignment Problem. Special crossover and the mutation operators called Common Element Crossover (CEX) andIn-Pool Mutation (IPM) respectively has been defined by focusing on the special needs and nature of theGeneralized Assignment Problem. The performance of the proposed method has been investigated in details viasome test cases constructed for the multi-target tracking problems.
🔖
Bu Makaleye Atıf Yap
AKBULUT, M. B., YILMAZ, A. E. (2022). A modified genetic algorithm for the generalized assignment problems. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 9 - Sayı: 2, 951–958. https://ajindex.com/articles/543733
Deb, K., Optimization for Engineering Design- Algorithms and Examples, Prentice Hall of India, New Delhi, 1995
Sakawa, M., Genetic Algorithms and Fuzzy Multiobjective Optimization, Kluwer Academic Publishers, 2002
Gen, M., Cheng, R., Genetic Algorithms and Engineering Design, Wiley, New York, 1997
Davis, L., Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991
Catrysse, D., van Wassenhove, L. N., “A survey of algorithms for the generalized assignment problem”, European Journal of Operational Research, Vol: 60, pp. 260-272, 1992
Chu, P.C., Beasley, J.E., “A genetic algorithm for the generalized assignment problem”, Computers and Operations Research, Vol: 48, pp. 17-23, 1997
Lorena L., Narciso, M.G., “Relaxation heuristics for a generalized assignment problem”, European Journal of Operational Research, Vol: 91, pp. 600- 610, 1996
Ross, G.T., Soland, R.M., “A branch and bound algorithm for the generalized assignment problem”, Mathematical Programming, Vol: 8, pp. 91-103, 1975
Wilson, J.M., “A genetic algorithm for the generalized assignment problem”, Journal of the Operational Research Society, Vol: 48, pp. 804-809, 1997
Bradley, D., Martin, J., “Continuous personnel scheduling algorithms: a literature review”, Journal of the Society for Health Systems, Vol. 2, pp. 8-23, 1990
Easton, F., Mansour, N., “A distributed Genetic Algorithm for employee staffing and scheduling problems”, Proceedings of the Fifth International Reference on Genetic Algorithms, San Mateo: Morgan Kaufmann Publishers, pp. 360-367, 1993
Tanomaru, J., “Staff scheduling by a Genetic Algorithm with heuristic operators”, Proceedings of the IEEE Conference on Evolutionary Computation, New York, pp. 456-461, 1995
Dowsland, K.A., “Nurse scheduling with Tabu search and strategic oscillation”, European Journal of Operational Research, Vol: 106, pp. 393-407, 1998
Dowsland, K.A., Thompson, J. M., “Nurse scheduling with knapsacks, networks and Tabu Search”, Journal of the Operational Research Society, pp. 825-833, 2000