A preliminary study on EDAs for permutation problems based on marginal-based models

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 609-616

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

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

Author keywords

Estimation distribution algorithms; Marginals; Optimization; Permutations; Problabilistic models

Indexed keywords

DISTRIBUTION ALGORITHMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; MARGINALS; PERMUTATION PROBLEMS; PERMUTATIONS; PROBABILISTIC MODELS; PROBLABILISTIC MODELS; REAL-WORLD PROBLEM;

PROBABILITY DISTRIBUTIONS;

EVOLUTIONARY ALGORITHMS;

EID: 84860390286     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001660     Document Type: Conference Paper

References (30)

1. S. Agrawal, Z. Wang, and Y. Ye. Parimutuel betting on permutations. In Parimutuel Betting on Permutations. 4th International Workshop On Internet And Network Economics (WINE), Dec. 2008.
2. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical report, Carnegie Mellon Report, CMU-CS-94-163, 1994.
3. J. C. Bean. Genetic algorithms and random keys for sequencing and optimization. INFORMS Journal on Computing, 6(2):154-160, 1994.
4. E. Bengoetxea, P. Larrañaga, I. Bloch, A. Perchant, and C. Boeres. Inexact graph matching by means of estimation of distribution algorithms. Pattern Recognition, 35(12):2867-2880, 2002.
5. P. A. N. Bosman and D. Thierens. Crossing the road to efficient IDEAs for permutation problems. In L. S. et al. et al., editor, Genetic and Evolutionary Computation Conference, GECCO 2001, Proceedings, San Francisco, California, USA, 2001, pages 219-226. Morgan Kaufmann, 2001.
6. P. A. N. Bosman and D. Thierens. Permutation optimization by iterated estimation of random keys marginal product factorizations. In PPSN, pages 331-340, 2002.
7. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison/Wesley, Reading MA, 1989.
8. D. E. Goldberg and R. L. Jr. Alleleslociand the traveling salesman problem. In J. J. Grefenstette, editor, ICGA, pages 154-159. Lawrence Erlbaum Associates, 1985.
9. J. Gupta and J. E. Stafford. Flow shop scheduling research after five decades. European Journal of Operational Research, 169(3):699-711, March 2006. (Pubitemid 41492009)
10. M. Henrion. Propagating uncertainty in bayesian networks by probabilistic logic sampling. In UAI, pages 149-164, 1986.
11. I. Inza, P. Larrañaga, and B. Sierra. Feature Subset Selection by Estimation of Distribution Algorithms. In P. Larrañaga and J. A. Lozano, editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation, pages 269-294. Kluwer Academic Publishers, 2002.
12. P. Larrañaga, R. Etxeberria, J. A. Lozano, and J. M. Peña. 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, pages 201-204, Las Vegas, Nevada, USA, 2000.
13. P. Larrañaga and J. A. Lozano. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
14. J. A. Lozano, P. Larrañaga, I. Inza, and E. Bengoetxea. Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.
15. J. A. Lozano and A. Mendiburu. Estimation of Distribution Algorithms applied to the job schedulling problem. In P. Larrañaga and J. A. Lozano, editors, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
16. J. A. Lozano and A. Mendiburu. Solving job schedulling with Estimation of Distribution Algorithms. In P. Larrañaga and J. A. Lozano, editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation, pages 231-242. Kluwer Academic Publishers, 2002.
17. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions i. binary parameters. In Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature - PPSN IV, pages 178-187, 1996. (Pubitemid 126128306)
18. M. Pelikan and D. E. Goldberg. Genetic algorithms, clustering, and the breaking of symmetry. Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science 1917, 2000.
19. M. Pelikan, D. E. Goldberg, and F. G. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002. (Pubitemid 34172679)
20. M. Pelikan, K. Sastry, and E. Cantú-Paz. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.
21. M. Pelikan, S. Tsutsui, and R. Kalapala. Dependency trees, permutations, and quadratic assignment problem. Technical report, Medal Report No. 2007003, 2007.
22. G. Reinelt. Tsplib.
23. V. Robles, P. de Miguel, and P. Larrañaga. Solving the Traveling Salesman Problem with edas. In P. Larrañaga and J. A. Lozano, editors, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
24. T. Romero and P. Larrañaga. Triangulation of bayesian networks with recursive estimation of distribution algorithms. Int. J. Approx. Reasoning, 50(3):472-484, 2009.
25. R. Santana, P. Larrañaga, and J. A. Lozano. Protein folding in simplified models with estimation of distribution algorithms. IEEE Transactions On Evolutionary Computation, 12(4):418-438, 2008.
26. E. Taillard. Eric taillard's dataset. European Journal of Operational Research, 64(278):85, 1993.
27. M. J. B. Tjalling C. Koopmans. Assignment problems and the location of economic activities. Technical Report 4, Cowles Foundation for Research in Economics, Yale University, 1955.
28. S. Tsutsui. Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram. In PPSN, pages 224-233, 2002.
29. S. Tsutsui, M. Pelikan, and D. E. Goldberg. Using edge histogram models to solve permutation problems with probabilistic model-building genetic algorithms. Technical report, IlliGAL Report No. 2003022, 2003.
30. S. Tsutsui, M. Pelikan, and D. E. Goldberg. Node histogram vs. edge histogram: A comparison of pmbgas in permutation domains. Technical report, Medal, 2006.