A universal model-learning-competing one is established for solving task assignment problem in National Economy Mobilization(NEM), in which local search was focused in learning model and global search in competing. Thereafter the strong points of the two models were amalgamated in the algorithm. A team of parameters was used to coordinating the correlation of the two models. Applying learning-competing model to an actual case, using greed algorithm in learning model, genetic algorithm in competing model, the results obtained were in coincidence with the analysis. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Wang, Z., Wang, H., Chen, X., & Jiang, Y. (2009). The heuristic algorithm based on learning-competing model and its application to task assignment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5551 LNCS, pp. 819–826). https://doi.org/10.1007/978-3-642-01507-6_92
Mendeley helps you to discover research relevant for your work.