Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems

International Journal of Production Economics

Volumn 141, Issue 1, 2013, Pages 24-33

  Chen, Shih Hsin ^a   Chen, Min Chih ^b  

^a NANHUA UNIVERSITY   (Taiwan)

^b WUFENG INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Estimation of Distribution Algorithms; Permutation flowshop scheduling problem; Self Guided Genetic Algorithm; Single machine scheduling problem

Indexed keywords

COMPUTATION EFFORT; ESTIMATION OF DISTRIBUTION ALGORITHMS; NP-HARD; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; POPULATION CHARACTERISTICS; PROBABILISTIC MODELS; SCHEDULING PROBLEM; SINGLE MACHINE SCHEDULING PROBLEMS; UNIVARIATE;

GENETIC ALGORITHMS; PROBABILITY DISTRIBUTIONS; SCHEDULING;

PROBABILISTIC LOGICS;

EID: 84869497021     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2012.05.010     Document Type: Article

References (51)

1. U. Aickelin, E.K. Burke, and J. Li An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering Journal of the Operational Research Society 58 12 2007 1574 1585
2. Baluja, S.; 1994. Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Technical Report.
3. 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 2002 2867 2880
4. Bosman, P.A.N.; Thierens, D.; 2001. Crossing the road to efficient ideas for permutation problems. In: A Workshop Within the 2001 Genetic and Evolutionary Computation Conference.
5. Branke, J.; Lode, C.; Shapiro, J.L.; 2007. Addressing sampling errors and diversity loss in UMDA. In: Proceedings of the Ninth Annual Conference on Genetic and Evolutionary Computation. ACM, pp. 508-515.
6. Brownlee, A.E.I.; McCall, J.A.W.; Zhang, Q.; Brown, D.F.; 2008. Approaches to selection and their effect on fitness modelling in an estimation of distribution algorithm. In: IEEE Congress on Evolutionary Computation, 2008. IEEE, pp. 2621-2628.
7. J.E. Ceberio, A.M. Irurozki, and J. Lozano A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems Progress in Artificial Intelligence 1 1 2012 103 117
8. P. Chang, S.H. Chen, and C.Y. Fan Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems Annals of Operations Research 180 1 2010 197 211
9. P.C. Chang, S.H. Chen, and C.Y. Fan Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems Applied Mathematics and Computation 205 2 2008 550 561
10. P.C. Chang, S.H. Chen, and C.Y. Fan Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems Applied Soft Computing Journal 8 1 2008 767 777
11. S.H. Chen, P.C. Chang, T.C.E. Cheng, and Q. Zhang A self-guided genetic algorithm for permutation flowshop scheduling problems Computers and Operations Research 39 7 2012 1450 1457
12. S.H. Chen, P.C. Chang, Q. Zhang, and C.B. Wang A guided memetic algorithm with probabilistic model Information and Control 5 12 2009 4753 4764
13. S.H. Chen, M.C. Chen, P.C. Chang, and Y.M. Chen Ea/g-ga for single machine scheduling problems with earliness/tardiness costs Entropy 13 6 2011 1152 1169
14. S.H. Chen, M.C. Chen, P.C. Chang, Q. Zhang, and Y.M. Chen Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems Expert Systems with Applications 37 9 2010 6441 6451
15. Y.M. Chen, M.C. Chen, P.C. Chang, and S.H. Chen Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems Computers and Industrial Engineering 62 2 2012 536 545
16. J.M. Framinan, J.N.D. Gupta, and R. Leisten A review and classification of heuristics for permutation flow-shop scheduling with makespan objective Journal of the Operational Research Society 55 12 2004 1243 1255
17. T. Goel, R. Haftka, W. Shyy, and N. Queipo Ensemble of surrogates Structural and Multidisciplinary Optimization 33 3 2007 199 216
18. P. Hansen, and N. Mladenović Variable neighborhood search: principles and applications European Journal of Operational Research 130 3 2001 449 467
19. M. Hauschild, and M. Pelikan An introduction and survey of estimation of distribution algorithms Swarm and Evolutionary Computation 1 3 2011 111 128
20. S.R. Hejazi, and S. Saghafian Flowshop-scheduling problems with makespan criterion: a review International Journal of Production Research 43 14 2005 2895 2929
21. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers and Operations Research 36 9 2009 2638 2646
22. Larrañaga, P.; Etxeberria, R.; Lozano, J.; Peña, J.; 2000. Optimization in continuous domains by learning and simulation of gaussian networks. In: A Workshop within the 2000 Genetic and Evolutionary Computation Conference. Citeseer.
23. J. Lenstra, A. Kan, and P. Brucker Complexity of machine scheduling problems Annals of Discrete Mathematics 1 1977 343 362
24. G. Li Single machine earliness and tardiness scheduling European Journal of Operational Research 96 3 1997 546 558
25. D. Lim, Y. Jin, Y. Ong, and B. Sendhoff Generalizing surrogate-assisted evolutionary computation IEEE Transactions on Evolutionary Computation 14 3 2010 329 355
26. Lima, C.; Pelikan, M.; Lobo, F.; Goldberg, D.; 2009. Loopy substructural local search for the Bayesian optimization algorithm. In: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, pp. 61-75.
27. H. Liu, L. Gao, and Q. Pan A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem Expert Systems with Applications 38 4 2011 4348 4360
28. J.A. Lozano, P. Larranaga, and I. Inza Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms 2006 Springer
29. G. Minella, R. Ruiz, and M. Ciavotta A review and evaluation of multiobjective algorithms for the flowshop scheduling problem INFORMS Journal on Computing 20 3 2008 451 471
30. D. Montgomery Design and Analysis of Experiments 2008 John Wiley & Sons Inc
31. Murata, T.; Ishibuchi, H.; 1994. Performance evaluation of genetic algorithms for flowshop scheduling problems. In: Proceedings of the First IEEE World Congress on Computational Intelligence. IEEE, pp. 812-817.
32. M. Nawaz, E.E. Enscore, and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem Omega 11 1 1983 91 95
33. P.S. Ow, and T.E. Morton The single machine early/tardy problem Management Science 35 2 1989 177 191
34. Q. Pan, and R. Ruiz An estimation of distribution algorithm for lot-streaming flow shop problems with setup times Omega 40 2 2012 166 180
35. 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 2002 5 20
36. Pelikan, M.; Tsutsui, S.; Kalapala, R.; 2007. Dependency trees, permutations, and quadratic assignment problem. In: Proceedings of the Ninth Annual Conference on Genetic and Evolutionary Computation, July, pp. 7-11.
37. C.R. Reeves A genetic algorithm for flowshop sequencing Computers and Operations Research 22 1 1995 5 13
38. R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2 2005 479 494
39. A. Samad, K. Kim, T. Goel, R. Haftka, and W. Shyy Multiple surrogate modeling for axial compressor blade shape optimization Journal of Propulsion and Power 24 2 2008 302 310
40. K. Sastry, M. Pelikan, and D.E. Goldberg Efficiency enhancement of estimation of distribution algorithms Computational Intelligence 33 2006 161 185
41. Shapiro, J.; 2006. Diversity loss in general estimation of distribution algorithms. In: Parallel Problem Solving from Nature - PPSN IX. Springer, pp. 92-101.
42. F. Sourd, and S. Kedad-Sidhoum The one-machine problem with earliness and tardiness penalties Journal of Scheduling 6 6 2003 533 549
43. Tsutsui, S.; 2006. 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, 2006, SMC'06, vol. 4. IEEE, pp. 3132-3137.
44. Tsutsui, S.; 2009. Effect of using partial solutions in edge histogram sampling algorithms with different local searches. In: IEEE International Conference on Systems, Man and Cybernetics, 2009. IEEE, pp. 2137-2142.
45. Tsutsui, S.; Miki, M.; 2002. Solving flow shop scheduling problems with probabilistic model-building genetic algorithms using edge histograms. In: Proceedings of the Fourth Asia-Pacific Conference on Simulated Evolution And Learning (SEAL02).
46. J. Wang, Y. Cai, Y. Zhou, R. Wang, and C. Li Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems Computers and Industrial Engineering 60 4 2011 566 575
47. L. Wang, and C. Fang An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem Computers and Operations Research 39 2 2012 449 460
48. L. Wang, and C. Fang A hybrid estimation of distribution algorithm for solving the resource-constrained project scheduling problem Expert Systems with Applications 39 3 2012 2451 2460
49. S.D. Wu, R.H. Storer, and P.C. Chang One-machine rescheduling heuristics with efficiency and stability as criteria Computers and Operations Research 20 1 1993 1 14
50. Q. Zhang, J. Sun, and E. Tsang An evolutionary algorithm with guided mutation for the maximum clique problem IEEE Transactions on Evolutionary Computation 9 2 2005 192 200
51. Y. Zhang, and X. Li Estimation of distribution algorithm for permutation flow shops with total flowtime minimization Computers and Industrial Engineering 60 4 2011 706 718