Introducing the mallows model on estimation of distribution algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7063 LNCS, Issue PART 2, 2011, Pages 461-470

  Ceberio, Josu ^a   Mendiburu, Alexander ^a   Lozano, Jose A ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

Estimation of Distribution Algorithms; Flow Shop Scheduling Problem; Mallows Model; Permutations; Probabilistic Models

Indexed keywords

DISTANCE-BASED; EDA APPROACH; ESTIMATION OF DISTRIBUTION ALGORITHMS; EXPONENTIAL MODELS; FLOW SHOP SCHEDULING PROBLEM; OPTIMIZATION PROBLEMS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PERMUTATIONS; PROBABILISTIC MODELS; REAL-WORLD OPTIMIZATION;

DATA PROCESSING; ESTIMATION; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; REAL VARIABLES;

EVOLUTIONARY ALGORITHMS;

EID: 81855227251     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24958-7_54     Document Type: Conference Paper

References (20)

1. Bean, J.C.: Genetic Algorithms and Random Keys for Sequencing and Optimization. INFORMS Journal on Computing 6(2), 154-160 (1994)
2. Bengoetxea, E., Larrañaga, P., Bloch, I., Perchant, A., Boeres, C.: Inexact graph matching by means of estimation of distribution algorithms. Pattern Recognition 35(12), 2867-2880 (2002)
3. Bosman, P.A.N., Thierens, D.: Crossing the road to efficient IDEAs for permutation problems. In: Spector, L., et al. (eds.) Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2001, pp. 219-226. Morgan Kaufmann, San Francisco (2001)
4. Bosman, P.A.N., Thierens, D.: Permutation Optimization by Iterated Estimation of Random Keys Marginal Product Factorizations. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 331-340. Springer, Heidelberg (2002)
5. Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A review on Estimation of Distribution Algorithms in Permutation-based Combinatorial Optimization Problems. Progress in Artificial Intelligence (2011)
6. Ceberio, J., Mendiburu, A., Lozano, J.A.: A Preliminary Study on EDAs for Permutation Problems Based on Marginal-based Models. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO, pp. 609-616. ACM (2011)
7. Cohen, W.W., Schapire, R.E., Singer, Y.: Learning to order things. In: Proceedings of the 1997 Conference on Advances in Neural Information Processing Systems, NIPS 1997, vol. 10, pp. 451-457. MIT Press, Cambridge (1998)
8. Fligner, M.A., Verducci, J.S.: Distance based ranking Models. Journal of the Royal Statistical Society 48(3), 359-369 (1986)
9. Gupta, J., Stafford, J.E.: Flow shop scheduling research after five decades. European Journal of Operational Research (169), 699-711 (2006)
10. Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)
11. Lozano, J.A., Mendiburu, A.: Solving job schedulling with Estimation of Distribution Algorithms. In: Larrañaga, P., Lozano, J.A. (eds.) Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation, pp. 231-242. Kluwer Academic Publishers (2002)
12. Mallows, C.L.: Non-null ranking models. Biometrika 44(1-2), 114-130 (1957)
13. Mandhani, B., Meila, M.: Tractable search for learning exponential models of rankings. In: Artificial Intelligence and Statistics (AISTATS) (April 2009)
14. Meila, M., Phadnis, K., Patterson, A., Bilmes, J.: Consensus ranking under the exponential model. In: 22nd Conference on Uncertainty in Artificial Intelligence (UAI 2007), Vancouver, British Columbia (July 2007)
15. Mühlenbein, H., Paaß, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996, Part IV. LNCS, vol. 1141, pp. 178-187. Springer, Heidelberg (1996)
16. Pelikan, M., Goldberg, D.E.: Genetic Algorithms, Clustering, and the Breaking of Symmetry. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, Springer, Heidelberg (2000)
17. Robles, V., de Miguel, P., Larrañaga, P.: Solving the Traveling Salesman Problem with EDAs. In: Larrañaga, P., Lozano, J.A. (eds.) Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers (2002)
18. Romero, T., Larrañaga, P.: Triangulation of Bayesian networks with recursive Estimation of Distribution Algorithms. Int. J. Approx. Reasoning 50(3), 472-484 (2009)
19. Tsutsui, S.: Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 224-233. Springer, Heidelberg (2002)
20. Tsutsui, S., Pelikan, M., Goldberg, D.E.: Node Histogram vs. Edge Histogram: A Comparison of PMBGAs in Permutation Domains. Technical report, Medal (2006)