Improving the performance of the repeating permutation representation using morphogenic computation and generalised modified order crossover

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volumn 2, Issue , 2005, Pages 1372-1379

  Fenton, Pio ^a   Walsh, Paul ^a  

^a Munster Technological University   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

GENETIC OPERATORS; GENOTYPE MAPPING; PERMUTATION REPRESENTATION; SCHEDULING DOMAIN;

GENETIC ALGORITHMS;

EID: 27144516173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Mikkel T. Jensen, "Robust and Flexible Scheduling With Evolutionary Computation" 2001, Dept. of Computer Science, University of Aarhus, Denmark. (PhD thesis)
2. J. Wroblewski, "Theoretical Foundations of order-based Genetic Algorithms", Fundamenta Informaticae vol. 28, pp 423-430, 1996
3. P. J. Angeline "Morphogenic Evolutionary Computations: Introduction, Issues and Examples", Evolutionary Programming IV: The Fourth Annual Conference on Evolutionary Programming", 1995
4. nd Edition 2002, Prentice Hall.
5. E. D Taillard, "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem", 1994 ORSA Journal on Computing, Vol 6. No. 2 pp 108-117
6. M. R. Garey, D. S. Johnson and R. Sethi, "The Complexity of Flow Shop and Job Shop Scheduling" Math. of Oper. Research, 2:2 (May 1976), 117-129.
7. J.F. Gonçalves, J. M. Mendes, M. G. C. Resende "A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem" AT&T Labs Research Technical Report TD-5EAL6J, AT&T Labs Research, 180 Park Avenune, Florham Park, NJ 07932 USA, September 2002
8. L. Davis, Job shop scheduling with genetic algorithms, Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum, Hillsdale, 1985, pp. 136-140.
9. Takeshi Yamada & Ryohei Nakano, "Job-shop Scheduling" from Genetic Algorithms in Engineering Systems 1997, P.J. Fleming and A.M.S. Zalzala (eds.) Chapter 7 pp 134-160.
10. H. Fang. "Genetic Algorithms in Timetabling and Scheduling", Department of Artificial Intelligence. University of Edinburgh, Scotland (Ph.D. Thesis).
11. Shigenobu Kobayashi, Isao Ono & Masayuki Yamamura, "An Efficient Algorithm for Job Shop Scheduling Problems" 1995 Proc. of ICGA 1995
12. Liang, S, J-T., Lewis, J. M A sparse matrix representation for production scheduling using genetic algorithms Symposium on Applied Computing: Proceedings of the 1995 ACM symposium on Applied computing Pages 313-317
13. J.C. Bean "Genetic Algorithms and random keys for sequencing and optimisation", 1994 ORS A Journal on Computing 6:154-159
14. Georges Harik and David E. Goldberg, "Learning linkage," Foundations of Genetic Algorithms, Vol. 4, pp. 247-262, 1997.
15. (Also IlliGAL Report No. 96006).
16. Dimitri Knjazew OmeGa: A competent Genetic Algorithm for Solving Permutation and Scheduling Problems 2001, Kluwer Academic Press.
17. Hillol Kargupta " The Gene Expression Messy Genetic Algorithm" 1996, Conference of Evolutionary Computation.
18. P. Larrañaga, C. Kuijpers, R. Murga (1994). "Tackling the travelling salesman problem with evolutionary algorithms: representations and operators." Technical Report. EHU-KZAA-IK-2-94. University of the Basque Country.
19. C. Bierwirth, "A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms", OR-Spektrum, Special Issue: Applied Local Search, in: E. Pesch, S. Vo (Eds.), vol. 17 (213), 1995, pp. 87-92.
20. Dirk Christian Mattfeld, "Evolutionary Search and the Job-Shop: Investigations on Genetic Algorithms for Production Scheduling" 1995 Spinger- Verlag (PhD Thesis)
21. F. Rothlauf, D.E. Goldberg, "Redundant Representations in Evolutionary Computation", 2003 Evolutionary Computation (MIT) Vol 11. No. 4 pp 381-415
22. Giffler, B. and Thompson, G. L., "Algorithms for Solving Production-Scheduling Problems," Operations Research, Vol. 8, No. 4, July, 1960.
23. S. Lin, E.D. Goodman, W.F. Punch, "Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems", 1997 Evolutionary Programming VI, Proc. Sixth Internat. Conf., EP97, Springer Verlag, NY, P. J. Angeline, et al., eds.,Indianapolis, pp.383-394
24. Sieuwert Von Oterloo, "Evolutionary Algorithms and Scheduling Problems" 2002 University of Uthrecht. (Unpublished)
25. Shipman, R., Shackleton, M., Ebner, M., & Watson, R. (2000). "Neutral search spaces for artificial evolution: A lesson from life." In Bedau, M., McCaskill, J., Packard, N., & Rasmussen, S. (Eds.), Proceedings of Artificial Life VII (pp. section III (Evolutionary and Adaptive Dynamics)). MIT Press.
26. Bedau MA, Packard NH. "Evolution of evolvability via adaptation of mutation rates." Biosystems 69 2003 May; (2-3): 143-62, Elsevier Science
27. www.lancet.mit.edu/ga [online] (accessed November 04)
28. Muth, J. F. and Thompson, G. L., eds., Industrial Scheduling, Englewood Cliffs, N. J.: Prentice-Hall, Inc., 1963.
29. ta01-ta80 are from E. D. Taillard (1993), "Benchmarks for basic scheduling problems", European Journal of Operational Research 64, Pages 278-285.