A comparison of multiobjective evolutionary algorithms with informed initialization and kuhn-munkres algorithm for the sailor assignment problem
暂无分享,去创建一个
Dipankar Dasgupta | Germán Hernández | Deon Garrett | James Simien | Aishwarya Kaushal | Pavan Kalyan Vejandla | Ramjee Yerneni
[1] Allen Holder,et al. Navy Personnel Planning and the Optimal Partition , 2005, Oper. Res..
[2] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[3] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[4] Harold W. Kuhn,et al. The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.
[5] François Bourgeois,et al. An extension of the Munkres algorithm for the assignment problem to rectangular matrices , 1971, CACM.
[6] Dipankar Dasgupta,et al. Applying Hybrid Multiobjective Evolutionary Algorithms to the Sailor Assignment Problem , 2007, Advances in Evolutionary Computing for System Design.
[7] Dipankar Dasgupta,et al. Genetic algorithms for the sailor assignment problem , 2005, GECCO '05.
[8] Marco Laumanns,et al. SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .
[9] Lee McCauley,et al. A large-scale multi-agent system for navy personnel distribution , 2002, Connect. Sci..