A multi-population parallel genetic algorithm for highly constrained continuous galvanizing line scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4030 LNCS, Issue , 2006, Pages 28-41

  Kapanoglu, Muzaffer ^a   Koc, Ilker Ozan ^a  

^a ESKISEHIR OSMANGAZI UNIVERSITY   (Turkey)

Author keywords

Continuous galvanizing line; Multi population genetic algorithm; Real world application; Scheduling

Indexed keywords

CONSTRAINT THEORY; GALVANIZING; PROCESS CONTROL; SCHEDULING; STEELMAKING; STRATEGIC PLANNING;

CONTINUOUS GALVANIZING LINES; MULTI POPULATION GENETIC ALGORITHMS; REAL WORLD APPLICATIONS; STEEL COILS;

GENETIC ALGORITHMS;

EID: 33750079846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11890584_3     Document Type: Conference Paper

References (13)

1. Cantú-Paz, E.: A survey of parallel genetic algorithms. IlliGAL Report 97003, Illinois Genetic Algorithms Lab., University of Illinois (1997).
2. Cantú-Paz, E., Goldberg, D.E.: Efficient parallel genetic algorithms: theory and practice. Computer Methods in Applied Mechanics and Engineering, 186 (2000) 221-238.
3. Cohoon, J.P., Martin, W.N., Richards, D.S.: Genetic Algorithms and punctuated Equilibria in VLSI. In: Schwefel H.-P., Männer, R. (eds.): Parallel Problem Solving from Nature, Springer-Verlag (Berlin), (1991) 134-144.
4. Cohoon, J.P., Martin, W.N., Richards, D.S.: A multi-population genetic algorithm for solving the K-partition problem on hyper-cubes. In: Belew, R.K., Booker, L.B. (eds.): Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann (San Mateo, CA), (1991) 244-248.
5. Fang, H.-L., Tsai, C.-H.: A Genetic Algorithm Approach to Hot Strip Mill Rolling Scheduling Problems. In: Proceedings of the International Conference on Tools with Artificial Intelligence, IEEE, Piscataway, NJ (1998) 264 -271.
6. Grosso, P.B.: Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model, Ph.D. Thesis, The University of Michigan, (1985).
7. Kapanoglu, M., Koc, I.O., Kara, İ., Aktürk, M.S.: Multi-population genetic algorithm using a new genetic representation for the Euclidean traveling salesman problem. In: Durmusoglu M.B., Kahraman, C. (eds.): Proceedings of the 35th International Conference on Computers & Industrial Engineering. Turkey, Vol. 1 (2005) 1047-1052.
8. Lee, H.-S., Murthy, S.S., W. Haider, S., Morse, D. V.: Primary Production Scheduling at Steelmaking Industries. IBM Journal of Research and Development, 40 (1996) 231-252.
9. Lopez, L., Carter, M.W., Gendreau, M.: The Hot Strip Mill Production Scheduling Problem: A Tabu Search Approach, European Journal of Operational Research, 106 (1998) 317-335.
10. Okano, H., Davenport, A.J., Trumbo, M., Reddy, C., Yoda, K., Amano M.: Finishing line scheduling in steel industy. IBM Journal of Research and Development, 48, 5/6 (2004) 811-830.
11. Petty,C.B., Leuze, M.R., Grefenstette, J.J.: A parallel genetic algorithm. In: Grefenstette, J.J. (ed.), Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Erlbaum Associates (Hillsdale, NJ), (1987) 155-161.
12. Reinelt, G.: The traveling salesman problem: Computational Solutions for TSP Applications. Springer Lecture Notes in Computer Science 840, Springer-Verlag, Berlin (1994).
13. Yasuda, H., Tokuyama, H., Tarui, K., Tanimoto, Y., Nagano, M.: Two-Stage Algorithm for Production Scheduling of Hot Strip Mill. Operations Research, 32 (1984) 695-707.