1 |
Undurti, A., & How, J. (2010). A cross-entropy based approach for UAV task allocation with nonlinear reward. In AIAA Guidance, Navigation, and Control Conference (p. 7731).
|
2 |
Yun, Y.S. & Chuluunsukh, A. (2019). Green Supply Chain Network Model: Genetic Algorithm Approach. J ournal of the Korea Industrial Information Systems Research, 24(3), 31-38.
|
3 |
Huang, L., Qu, H., & Zuo, L. (2018). Multi-type UAVs cooperative task allocation under resource constraints. IEEE Access, 6, 17841-17850.
DOI
|
4 |
Alon, G., Kroese, D. P., Raviv, T., & Rubinstein, R. Y. (2005). Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment. Annals of Operations Research, 134(1), 137-151.
DOI
|
5 |
Kim, G. (2022). Approximation Algorithm for Multi Agents-Multi Tasks Assignment with Completion Probability. J ournal of the Korea Industrial Information Systems Research, 27(2), 61-69.
|
6 |
Altun, M., & Pekcan, O. (2017). A modified approach to cross entropy method: Elitist stepped distribution algorithm. Applied Soft Computing, 58, 756-769.
DOI
|
7 |
Cabo, M., & Possani, E. (2015). Considerations on applying cross entropy methods to the vehicle routing problem. International J ournal of Combinatorial Optimization Problems and Informatics, 6(3), 22-33.
|
8 |
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978). An analysis of approximations for maximizing submodular set functions-II. Berlin, Heidelberg. Polyhedral combinatorics, pp. 73-87.
|
9 |
Le Thi, H. A., Nguyen, D. M., & Dinh, T. P. (2012). Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches. Optimization Letters, 6(2), 315-329.
DOI
|
10 |
Li, J. J., Zhang, R. B., & Yang, Y. (2015). Meta-heuristic ant colony algorithm for multi-tasking assignment on collaborative AUVs. International J ournal of Grid and Distributed Computing, 8(3), 135-144.
|
11 |
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978). An analysis of approximations for maximizing submodular set functions-I. Mathematical programming, 14(1), 265-294.
DOI
|
12 |
Qu, G., Brown, D., & Li, N. (2019). Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions. Automatica, 105, 206-215.
DOI
|
13 |
Rubinstein, R. Y., & Kroese, D. P. (2004). The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning (Vol. 133). New York: Springer.
|
14 |
Sun, X., Cassandras, C. G., & Meng, X. (2017, December). A submodularity-based approach for multi-agent optimal coverage problems. 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 4082-4087.
|
15 |
Rubinstein, R. Y. (1997). Optimization of computer simulation models with rare events. European J ournal of Operational Research, 99(1), 89-112.
DOI
|
16 |
Bai, X., Yan, W., Ge, S. S., & Cao, M. (2018). An integrated multi-population genetic algorithm for multi-vehicle task assignment in a drift field. Information Sciences, 453, 227-238.
DOI
|
17 |
Lee, J.H. & Shin M.I (2016), Stochastic Weapon Target Assignment Problem under Uncertainty in Targeting Accuracy, The Korean Operations Research and Management Science Society, 41(3), 23-36.
|
18 |
Schrijver, A. (2005). On the history of combinatorial optimization (till 1960). Handbooks in operations research and management science , 12, 1-68.
DOI
|