Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems

Computers and Industrial Engineering

Volumn 62, Issue 2, 2012, Pages 536-545

  Chen, Yuh Min ^a   Chen, Min Chih ^a   Chang, Pei Chann ^b   Chen, Shih Hsin ^c  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b YUAN ZE UNIVERSITY   (Taiwan)

^c NANHUA UNIVERSITY   (Taiwan)

Author keywords

Estimation of distribution algorithms; Evolutionary algorithm with probabilistic models; Scheduling problems

Indexed keywords

ARTIFICIAL CHROMOSOMES; AVERAGE ERRORS; COMPUTATION EFFICIENCY; ESTIMATION OF DISTRIBUTION ALGORITHMS; MAKESPAN CRITERION; PERFORMANCE MEASURE; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PROBABILISTIC MODELS; SCHEDULING PROBLEM; SCHEDULING PROBLEMS; SOLUTION QUALITY; UNIVARIATE; VARIABLE NEIGHBORHOOD SEARCH;

CHROMOSOMES; COMPUTATIONAL EFFICIENCY; GENETIC ALGORITHMS; PROBABILISTIC LOGICS; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 84855799851     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.11.002     Document Type: Article

References (31)

1. Baluja, S., & Davies, S. (1998). Fast probabilistic modeling for combinatorial optimization. In Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence table of contents (pp. 469-476).
2. 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
3. P. Bosman, and D. Thierens Crossing the road to efficient idfas for permutation problems A workshop within the 2001 genetic and evolutionary computation conference 2001 Citeseer
4. J. Branke, C. Lode, and J. Shapiro Addressing sampling errors and diversity loss in UMDA Proceedings of the 9th annual conference on genetic and evolutionary computation 2007 ACM 515
5. Ceberio, J. E., Irurozki, A. M., & Lozano, J. (2012). A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Progress in Artificial Intelligence, in press. doi:10.1007/s13748-011-0005-3.
6. 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
7. S. Chen, M. Chen, P. Chang, Q. Zhang, and Y. Chen Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems Expert Systems with Applications 37 9 2010 6441 6451
8. S.H. Chen, P.C. Chang, T.C.E. Cheng, and Q. Zhang A self-guided genetic algorithm for permutation flowshop scheduling problems Computers & Operations Research 39 7 2012 1450 1457
9. P. Hansen, and N. Mladenovi Variable neighborhood search: Principles and applications European Journal of Operational Research 130 3 2001 449 467 (Pubitemid 32875304)
10. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers & Operations Research 36 9 2009 2638 2646
11. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimisation for solving permutation flowshop problems Computers & Industrial Engineering 54 3 2008 526 538 (Pubitemid 351199803)
12. P. Larrañaga, R. Etxeberria, J. Lozano, and J. Peña Optimization in continuous domains by learning and simulation of gaussian networks A workshop within the 2000 genetic and evolutionary computation conference 2000 Citeseer
13. P. Larrañaga, and J.A. Lozano Estimation of distribution algorithms: A new tool for evolutionary computation 2002 Kluwer Academic Publishers
14. J. Lozano, P. Larranaga, I. Inza, and E. Bengoetxea Towards a new evolutionary computation: Advances in the estimation of distribution algorithms 2006 Springer
15. N. Mladenovic, and P. Hansen Variable neighborhood search Computers & Operations Research 24 11 1997 1097 1100
16. D. Montgomery Design and analysis of experiments 2008 John Wiley & Sons Inc
17. Muruta, T., & Ishibuchi, H., 1994. Performance evolution of genetic algorithms for flowshop scheduling problems. In Proceedings of first IEEE international conference on evolutionary computation.
18. A. Nareyek Constraint-based agents: An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds 2001 Springer
19. Q. Pan, M. Tasgetiren, and Y. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers & Industrial Engineering 55 4 2008 795 816
20. Q.K. Pan, and R. Ruiz An estimation of distribution algorithm for lot-streaming flow shop problems with setup times Omega 40 2 2012 166 180
21. M. Pelikan, S. Tsutsui, and R. Kalapala Dependency trees, permutations, and quadratic assignment problem Proceedings of the 9th annual conference on Genetic and evolutionary computation 2007 Citeseer 7 11
22. J. Pena, V. Robles, P. Larranaga, V. Herves, F. Rosales, and M. Pérez GA-EDA: Hybrid evolutionary algorithm using genetic and estimation of distribution algorithms Innovations in Applied Artificial Intelligence 2004 361 371 (Pubitemid 38761241)
23. T. Romero, and P. Larrañaga Triangulation of bayesian networks with recursive estimation of distribution algorithms International Journal of Approximate Reasoning 50 3 2009 472 484
24. R. Ruiz, C. Maroto, and J. Alcaraz Two new robust genetic algorithms for the flowshop scheduling problem Omega 34 5 2006 461 476 (Pubitemid 43046058)
25. M. Sevkli, and M. Aydin Variable neighbourhood search for job shop scheduling problems Journal of Software 1 2 2009 34
26. J. Shapiro Diversity loss in general estimation of distribution algorithms Parallel Problem Solving from Nature-PPSN IX 2006 92 101 (Pubitemid 44609385)
27. E. Taillard Benchmarks for basic scheduling instances European Journal of Operational Research 64 1993 278 285
28. M. Tasgetiren, Y. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 3 2007 1930 1947 (Pubitemid 44780934)
29. S. Tsutsui A comparative study of sampling methods in node histogram models with probabilistic model-building genetic algorithms IEEE international conference on systems, man and cybernetics, 2006. SMC'06 Vol. 4 2006 IEEE 3132 3137
30. S. Tsutsui Effect of using partial solutions in edge histogram sampling algorithms with different local searches IEEE international conference on systems, man and cybernetics, 2009. SMC 2009 2009 IEEE 2137 2142
31. Tsutsui, S., & Miki, M., 2002. Solving flow shop scheduling problems with probabilistic model-building genetic algorithms using edge histograms. In Proc. of the 4th Asia-Pacific conference on simulated evolution and learning (SEAL02).