{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T06:51:21Z","timestamp":1770706281919,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,13]],"date-time":"2012-01-13T00:00:00Z","timestamp":1326412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Prog Artif Intell"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s13748-011-0005-3","type":"journal-article","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T12:08:13Z","timestamp":1326715693000},"page":"103-117","source":"Crossref","is-referenced-by-count":116,"title":["A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems"],"prefix":"10.1007","volume":"1","author":[{"given":"Josu","family":"Ceberio","sequence":"first","affiliation":[]},{"given":"Ekhine","family":"Irurozki","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Mendiburu","sequence":"additional","affiliation":[]},{"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,13]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Wang, Z., Ye, Y.: Parimutuel betting on permutations. In: Internet and Network Economics. Lecture Notes in Computer Science, vol. 5385, pp. 126\u2013137. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-92185-1_21"},{"issue":"2","key":"5_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"C.J. Bean","year":"1994","unstructured":"Bean C.J.: Genetic algorithms and random keys for sequencing and optimization. INFORMS J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"INFORMS J. Comput."},{"issue":"12","key":"5_CR3","doi-asserted-by":"crossref","first-page":"2867","DOI":"10.1016\/S0031-3203(01)00232-1","volume":"35","author":"E. Bengoetxea","year":"2002","unstructured":"Bengoetxea E., Larra\u00f1aga P., Bloch I., Perchant A., Boeres C.: Inexact graph matching by means of estimation of distribution algorithms. Pattern Recognit. 35(12), 2867\u20132880 (2002)","journal-title":"Pattern Recognit."},{"key":"5_CR4","first-page":"767","volume-title":"PPSN. Lecture Notes in Computer Science vol. 1917","author":"P.A.N. Bosman","year":"2000","unstructured":"Bosman P.A.N., Thierens D.: Expanding from discrete to continuous estimation of distribution algorithms: the IDEA. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Guerv\u00f3s, J.J.M., Schwefel, H.P (eds) PPSN. Lecture Notes in Computer Science vol. 1917., pp. 767\u2013776. Springer, Berlin (2000)"},{"key":"5_CR5","first-page":"219","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2001, Proceedings, San Francisco, California, USA, 2001","author":"P.A.N. Bosman","year":"2001","unstructured":"Bosman P.A.N., Thierens D. et\u00a0al.: Crossing the road to efficient IDEAs for permutation problems. In: Spector, L. (eds) Genetic and Evolutionary Computation Conference, GECCO 2001, Proceedings, San Francisco, California, USA, 2001., pp. 219\u2013226. Morgan Kaufmann, Massachusetts (2001)"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/1389095.1389179","volume-title":"GECCO","author":"A.E.I. Brownlee","year":"2008","unstructured":"Brownlee A.E.I., Pelikan M., McCall J.A.W., Petrovski A.: An application of a multivariate estimation of distribution algorithm to cancer chemotherapy. In: Ryan, C., Keijzer, M. (eds) GECCO., pp. 463\u2013464. ACM, New York (2008)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chen, S., Chen, M.: Bi-variate artificial chromosomes with genetic algorithm for single machine scheduling problems with sequence-dependent setup times. In: Proceedings of the Congress on Evolutionary Computation (2011)","DOI":"10.1109\/CEC.2011.5949596"},{"issue":"3","key":"5_CR8","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C. Chow","year":"1968","unstructured":"Chow C., Liu C.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Inf. Theory 14(3), 462\u2013467 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR9","unstructured":"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 10, NIPS \u201997, pp. 451\u2013457. MIT Press, Cambridge (1998)"},{"key":"5_CR10","volume-title":"Advances in Neural Information Processing Systems vol 9","author":"J.S. De Bonet","year":"1997","unstructured":"De Bonet J.S., Isbell C.L., Viola P.: MIMIC: Finding optima by estimating probability densities. In: Mozer, M., Jordan, M., Petsche, Th (eds) Advances in Neural Information Processing Systems vol 9., MIT Press, Cambridge (1997)"},{"issue":"3","key":"5_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1111\/j.2517-6161.1986.tb01420.x","volume":"48","author":"A.M. Fligner","year":"1986","unstructured":"Fligner A.M., Verducci S.J. Verducci: Distance based ranking Models. J. Royal Stat. Soc. 48(3), 359\u2013369 (1986)","journal-title":"J. Royal Stat. Soc."},{"key":"5_CR12","first-page":"2677","volume":"9","author":"S. Garcia","year":"2008","unstructured":"Garcia S., Herrera F.: An extension on \u201cStatistical Comparisons of Classifiers over Multiple Data Set\u201d for all pairwise comparisons. J. Mach. Learn. Res. 9, 2677\u20132694 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"5_CR13","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S. Garcia","year":"2009","unstructured":"Garcia S., Molina D., Lozano M., Herrera F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 Special Session on Real Parameter Optimization. J. Heuristics 15(6), 617\u2013644 (2009)","journal-title":"J. Heuristics"},{"key":"5_CR14","volume-title":"Genetic algorithms in search optimization and machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg D.E.: Genetic algorithms in search optimization and machine learning. Addison\/Wesley, Reading (1989)"},{"key":"5_CR15","unstructured":"Goldberg, D.E., Lingle Jr., R.: Alleles Loci and the traveling salesman problem. In: ICGA, pp. 154\u2013159 (1985)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Guiver, J., Snelson, E.: Bayesian inference for Plackett-Luce ranking models. In: International Conference on Machine Learning (ICML 2009), ICML\u201909, pp. 377\u2013384. ACM, New York (2009)","DOI":"10.1145\/1553374.1553423"},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"J. Gupta","year":"2006","unstructured":"Gupta J., Stafford E.J. Stafford: Flow shop scheduling research after five decades. Eur. J. Oper. Res. 169, 699\u2013711 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR18","first-page":"149","volume-title":"UAI","author":"M. Henrion","year":"1986","unstructured":"Henrion M.: Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In: Lemmer, J.F., Kanal, L.N. (eds) UAI., pp. 149\u2013164. Elsevier, Amsterdam (1986)"},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1214\/aos\/1079120141","volume":"32","author":"R.D. Hunter","year":"2004","unstructured":"Hunter R.D. Hunter: MM Algorithms for generalized Bradley\u2013Terry models. Ann. Stat. 32(1), 384\u2013406 (2004)","journal-title":"Ann. Stat."},{"issue":"9","key":"5_CR20","doi-asserted-by":"crossref","first-page":"2638","DOI":"10.1016\/j.cor.2008.11.004","volume":"36","author":"B. Jarboui","year":"2009","unstructured":"Jarboui B., Eddaly M., Siarry P.: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput. OR 36(9), 2638\u20132646 (2009)","journal-title":"Comput. OR"},{"issue":"11\u201312","key":"5_CR21","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.anucene.2006.03.012","volume":"33","author":"S. Jiang","year":"2006","unstructured":"Jiang S., Ziver A., Carter J., Pain C., Goddard A., Franklin S., Phillips H.: Estimation of distribution algorithms for nuclear reactor fuel management optimisation. Ann. Nuclear Energy 33(11\u201312), 1039\u20131057 (2006)","journal-title":"Ann. Nuclear Energy"},{"key":"5_CR22","unstructured":"Knjazew, D., Goldberg, D.E.: Omega\u2014ordering messy ga: solving permutation problems with the fast genetic algorithm and random keys. In: GECCO, pp. 181\u2013188 (2000)"},{"key":"5_CR23","unstructured":"Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Cowles Foundation Discussion Papers 4, Cowles Foundation for Research in Economics, Yale University. http:\/\/ideas.repec.org\/p\/cwl\/cwldpp\/4.html (1955)"},{"key":"5_CR24","unstructured":"Larra\u00f1aga, P., Etxeberria, R., Lozano, J.A., Pe\u00f1a, J.M.: Combinatorial optimization by learning and simulation of Bayesian networks. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, UAI 2000, pp. 343\u2013352, Stanford (2000)"},{"key":"5_CR25","unstructured":"Larra\u00f1aga, P., Etxeberria, R., Lozano, J.A., Pe\u00f1a J.M.: Optimization in continuous domains by learning and simulation of Gaussian networks. In: Proceedings of the Workshop in Optimization by Building and using Probabilistic Models. A Workshop within the 2000 Genetic and Evolutionary Computation Conference, GECCO 2000, pp. 201\u2013204, Las Vegas (2000)"},{"key":"5_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of distribution algorithms a new tool for evolutionary computation","author":"P. Larra\u00f1aga","year":"2002","unstructured":"Larra\u00f1aga P., Lozano J.A.: Estimation of distribution algorithms a new tool for evolutionary computation. Kluwer, Dordrecht (2002)"},{"key":"5_CR27","first-page":"2401","volume":"9","author":"G. Lebanon","year":"2008","unstructured":"Lebanon G., Mao Y.: Non-Parametric modeling of partially ranked data. J. Mach. Learn. Res. (JMLR) 9, 2401\u20132429 (2008)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"key":"5_CR28","doi-asserted-by":"crossref","first-page":"4348","DOI":"10.1016\/j.eswa.2010.09.104","volume":"38","author":"H. Liu","year":"2011","unstructured":"Liu H., Gao L., Pan Q.: A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem. Expert Syst. Appl. 38, 4348\u20134360 (2011)","journal-title":"Expert Syst. Appl."},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Lozano, J.A., Larra\u00f1aga, P., Inza, I., Bengoetxea, E.: Towards a new evolutionary computation: advances on estimation of distribution algorithms (Studies in Fuzziness and Soft Computing). Springer, New York (2006)","DOI":"10.1007\/3-540-32494-1"},{"key":"5_CR30","first-page":"1","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"J.A. Lozano","year":"2002","unstructured":"Lozano J.A., Mendiburu A.: Estimation of Distribution Algorithms applied to the job schedulling problem. In: Larra\u00f1aga, P., Lozano, J.A. (eds) Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation., pp. 1\u20132. Kluwer, Dordrecht (2002)"},{"key":"5_CR31","volume-title":"Individual Choice Behavior","author":"R.D. Luce","year":"1959","unstructured":"Luce R.D.: Individual Choice Behavior. Wiley, New York (1959)"},{"issue":"1\u20132","key":"5_CR32","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","volume":"44","author":"L.C. Mallows","year":"1957","unstructured":"Mallows L.C. Mallows: Non-null ranking models. Biometrika 44(1\u20132), 114\u2013130 (1957)","journal-title":"Biometrika"},{"key":"5_CR33","unstructured":"Mandhani, B., Meila, M.: Tractable search for learning exponential models of rankings. In: Artificial Intelligence and Statistics (AISTATS), April (2009)"},{"issue":"4","key":"5_CR34","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/TEVC.2005.850299","volume":"9","author":"A. Mendiburu","year":"2005","unstructured":"Mendiburu A., Lozano J.A., Miguel-Alonso J.: Parallel implementation of EDAs based on probabilistic graphical models. IEEE Trans. Evol. Comput. 9(4), 406\u2013423 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"5_CR35","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1016\/j.jpdc.2006.03.001","volume":"66","author":"A. Mendiburu","year":"2006","unstructured":"Mendiburu A., Miguel-Alonso J., Lozano J.A., Ostra M., Ubide C.: Parallel EDAs to create multivariate calibration models for quantitative chemical applications. J. Parallel Distrib. Comput. 66(8), 1002\u20131013 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature\u2014PPSN IV, pp. 178\u2013187 (1996)","DOI":"10.1007\/3-540-61723-X_982"},{"key":"5_CR37","unstructured":"Pelikan, M., Goldberg, D.E.: Hierarchical problem solving and the Bayesian optimization algorithm. In: Whitley, D., Goldberg, D.E., Cant\u00fa-Paz, E., Spector, L., Parmee, I., Beyer, H.G. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, vol. 1, pp. 267\u2013274. Morgan Kaufmann Publishers, Menlo Park (2000)"},{"issue":"1","key":"5_CR38","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M. Pelikan","year":"2002","unstructured":"Pelikan M., Goldberg D.E., Lobo F.G.: A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 21(1), 5\u201320 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Sastry, K., Cant\u00fa-Paz, E.: Scalable optimization via probabilistic modeling: from algorithms to applications (Studies in Computational Intelligence). Springer, New York (2006)","DOI":"10.1007\/978-3-540-34954-9"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Tsutsui, S., Kalapala, R.: Dependency trees, permutations, and quadratic assignment problem. Technical report, Medal Report No. 2007003 (2007)","DOI":"10.1145\/1276958.1277089"},{"issue":"10","key":"5_CR41","first-page":"193","volume":"24","author":"R.L. Plackett","year":"1975","unstructured":"Plackett R.L.: The analysis of permutations. J. Royal Stat. Soc. 24(10), 193\u2013202 (1975)","journal-title":"J. Royal Stat. Soc."},{"key":"5_CR42","volume-title":"Estimation of distribution algorithms a new tool for evolutionary computation","author":"V. Robles","year":"2002","unstructured":"Robles V., de Miguel P., Larra\u00f1aga P.: Solving the traveling salesman problem with EDAs. In: Larra\u00f1aga, P., Lozano, J.A. (eds) Estimation of distribution algorithms a new tool for evolutionary computation., Kluwer, Dordrecht (2002)"},{"issue":"3","key":"5_CR43","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ijar.2008.09.002","volume":"50","author":"T. Romero","year":"2009","unstructured":"Romero T., Larra\u00f1aga P.: Triangulation of Bayesian networks with recursive estimation of distribution algorithms. Int. J. Approx. Reason. 50(3), 472\u2013484 (2009)","journal-title":"Int. J. Approx. Reason."},{"issue":"2","key":"5_CR44","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ejor.2004.08.006","volume":"169","author":"R. Sagarna","year":"2006","unstructured":"Sagarna R., Lozano J.A.: Scatter Search in software testing, comparison and collaboration with estimation of distribution algorithms. Eur. J. Oper. Res. 169(2), 392\u2013412 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"5_CR45","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TEVC.2007.906095","volume":"12","author":"R. Santana","year":"2008","unstructured":"Santana R., Larra\u00f1aga P., Lozano J.A.: Protein folding in simplified models with estimation of distribution algorithms. IEEE Trans. Evol. Comput. 12(4), 418\u2013438 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Tsutsui, S.: Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram. In: PPSN, pp. 224\u2013233 (2002)","DOI":"10.1007\/3-540-45712-7_22"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Tsutsui, S.: A comparative study of sampling methods in node histogram models with probabilistic model-building genetic algorithms. In: IEEE International Conference on Systems, Man, and Cybernetics. 8\u201311 October 2006, Taipei, vol. 4, pp. 3132\u20133137 (2006)","DOI":"10.1109\/ICSMC.2006.384597"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Tsutsui, S.: Effect of using partial solutions in edge histogram sampling algorithms with different local searches. In: SMC, pp. 2137\u20132142 (2009)","DOI":"10.1109\/ICSMC.2009.5346283"},{"key":"5_CR49","unstructured":"Tsutsui, S., Miki, M.: Solving flow shop scheduling problems with probabilistic model-building genetic algorithms using edge histograms. In: 4th Asia-Pacific Conference on Simulated Evolution And Learning (SEAL 02), pp. 776\u2013780 (2002)"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Tsutsui, S., Pelikan, M., Goldberg, D.E.: Using edge histogram models to solve permutation problems with probabilistic model-building genetic algorithms. Technical report, IlliGAL Report No. 2003022 (2003)","DOI":"10.1142\/9789812561794_0013"},{"key":"5_CR51","unstructured":"Tsutsui, S., Pelikan, M., Goldberg, D.E.: Node histogram vs. edge histogram: a comparison of PMBGAs in permutation domains. Technical report, Medal (2006)"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Tsutsui, S., Wilson, G.: Solving capacitated vehicle routing problems using edge histogram based sampling algorithms. In: Proceedings of the IEEE Conference on Evolutionary Computation, Portland, Oregon (USA), pp. 1150\u20131157 (2004)","DOI":"10.1109\/CEC.2004.1330991"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Yuan, B., Orlowska, M.E., Sadiq, S.W.: Finding the optimal path in 3d spaces using EDAs\u2014the wireless sensor networks scenario. In: ICANNGA (1), pp. 536\u2013545 (2007)","DOI":"10.1007\/978-3-540-71618-1_59"},{"key":"5_CR54","unstructured":"Zhang, Q., Sun, J., Tsang, E., Ford, J.: Combination of guided local search and estimation of distribution algorithm for solving quadratic assignment problem. In: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pp. 42\u201348 (2004)"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Sun, J., Tsang, E., Ford, J.: Estimation of distribution algorithm with 2-opt local search for the quadratic assignment problem. Stud. Fuzziness Soft Comput. 192\/2006:281\u2013292 (2006)","DOI":"10.1007\/11007937_12"},{"key":"5_CR56","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3436-1","volume-title":"Theory of Global Random Search","author":"A.A. Zhigljavsky","year":"1991","unstructured":"Zhigljavsky A.A.: Theory of Global Random Search. Kluwer, Dordrecht (1991)"}],"container-title":["Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-011-0005-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13748-011-0005-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-011-0005-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T21:41:01Z","timestamp":1742334061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13748-011-0005-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,13]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1007\/s13748-011-0005-3","relation":{},"ISSN":["2192-6352","2192-6360"],"issn-type":[{"value":"2192-6352","type":"print"},{"value":"2192-6360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,13]]}}}