Author:
Ayodele Mayowa,McCall John,Regnier-Coudert Olivier
Publisher
Springer International Publishing
Reference17 articles.
1. Bengoetxea, E., Larrañaga, P., Bloch, I., Perchant, A., Boeres, C.: Inexact graph matching by means of estimation of distribution algorithms. Pattern Recogn. 35(12), 2867–2880 (2002)
2. Bosman, P.A., Thierens, D.: Crossing the road to efficient IDEAs for permutation problems. In: Proceedings of the 6th annual conference on Genetic and evolutionary computation, pp. 219–226. ACM (2001)
3. Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Prog. Artif. Intell. 1(1), 103–117 (2012)
4. Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans. Evolut. Comput. 18(2), 286–300 (2014)
5. Ceberio, J., Mendiburu, A., Lozano, J.A.: The plackett-luce ranking model on permutation-based optimization problems. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 494–501. IEEE (2013)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献