Evaluating performance advantages of grouping genetic algorithms

Engineering Applications of Artificial Intelligence

Volumn 18, Issue 1, 2005, Pages 1-12

  Brown, Evelyn C ^a   Sumichrast, Robert T ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Assembly line balancing; Bin packing; Constrained optimization; Genetic algorithm; Grouping genetic algorithm; Grouping problems; Machine part cell formation

Indexed keywords

ENCODING (SYMBOLS); EVALUATION; GENETIC ALGORITHMS; OPTIMIZATION; PERFORMANCE; PROBLEM SOLVING; VLSI CIRCUITS;

ASSEMBLY LINE BALANCING; BIN PACKING; CONSTRAINED OPTIMIZATION; GROUPING GENETIC ALGORITHMS; GROUPING PROBLEMS; MACHINE-PART CELL FORMATION;

GROUP TECHNOLOGY;

EID: 10844268667     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2004.08.024     Document Type: Article

References (41)

1. Anily, S., Bramel, J., Simchi-Levi, D., 1994. Worst-case analysis of heuristics for the bin packing problem with general cost structures.Operations Research 42 (2), 287-298.
2. Beasley, J.E., Chu, P.C., 1996. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (2), 392-404.
3. Brown, E.C., 1996. Using the facility location problem to explore operator policies and constraint-handling methods for genetic algorithms. Dissertation, University of Virginia, USA.
4. Brown, E.C., Sumichrast, R.T., 2001. CF-GGA: a grouping genetic algorithm for the cell formation problem. International Journal of Production Research 39 (16), 3651-3669.
5. Burbidge, J.L., 1963. Production flow analysis. Production Engineer 42, 742-752.
6. Carrie, A.S., 1973. Numerical taxonomy applied to group technology and plant layout. International Journal of Production Research 11, 399-416.
7. Chandrasekharan, M.P., Rajagopalan, R., 1986. An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. International Journal of Production Research 24, 451-464.
8. Chandrasekharan, M.P., Rajagopalan, R., 1989. GROUPABILITY: an analysis of the properties of binary data matrices for group technology. International Journal of Production Research 27, 1035-1052.
9. Chandresekharam, R., Subhramanian, S., Chaudhury, S., 1993. Genetic algorithm for node partitioning problem and applications in VLSI design. IEEE Proceedings-E 140 (5), 255-260.
10. Coffman, E.G., Garey, M.R., Johnson, D.S., 1978. An application of bin-packing to multiprocessor control. SIAM Journal of Computing 7 (1), 1-17.
11. Coffman, E.G., Garey, M.R., Johnson, D.S., 1997. Approximation algorithms for bin packing: a survey. In: Dorit, S.H. (Ed.), Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston.
12. Dyckhoff, H., Finke, U., 1992. Cutting and Packing in Production and Distribution: a Typology and Bibliography. Springer, Berlin.
13. Eilon, S., Christofides, N., 1971. The loading problem. Management Science 17 (6), 259-268.
14. Elsayed, A.E., Boucher, T.O., 1985. Analysis and Control of Production Systems. Prentice-Hall, Englewood Cliff, NJ.
15. Evolver 4.0, 2001. Palisade, www.palisade.com.
16. Falkenauer, E., 1992. The grouping genetic algorithms - widening the scope of the GAs. JORBEL - Belgian Journal of Operations Research, Statistics and Computer Science 33, 79-102.
17. Falkenauer, E., 1996. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5-30.
18. Falkenauer, E., 1998. Genetic Algorithms for Grouping Problems. Wiley, New York.
19. Falkenauer, E., Delchambre, A., 1992. A genetic algorithm for bin packing and line balancing. In: Proceedings of the IEEE 1992 International Conference on Robotics and Automation (RA92), May 10-15, Nice, France.
20. Fleszar, K., Hindi, K.S., 2002. New heuristics for one-dimensional binpacking. Computers and Operations Research 29, 821-839.
21. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability, A Guide to the Theory of NP Completeness. W.H. Freeman and Company, New York.
22. Goldberg, D., 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA.
23. Groover, M.P., 1996. Automation, Production Systems and Computer Integrated Manufacturing. Prentice-Hall of India, New Delhi.
24. Gutjahr, A.L., Nemhauser, G.L., 1964. An algorithm for the line balancing problem. Management Science 11 (2), 308-315.
25. Hoffman, T.R., 1963. Assembly line balancing with a precedence matrix. Management Science 9 (4), 551-562.
26. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications in Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor, MI.
27. Hussain, S.A., Sastry, V.U.K., 1997. Application of genetic algorithm for bin packing. International Journal of Computer Mathematics 63 (3/4), 203-214.
28. Joines, J., Culbreth, C.T., King, R.E., 1996. Manufacturing cell design: an integer programming model employing genetic algorithms. IEEE Transactions 28, 69-85.
29. Kim, Y.K., Kim, Y.J., Kim, Y., 1996. Genetic algorithms for assembly line balancing with various objectives. Computers and Industrial Engineering 30 (3), 397-409.
30. King, J.R., 1980. Machine-component grouping in production flow analysis: an approach using rank order clustering algorithm. International Journal of Production Research 18, 213-237.
31. Kumar, C.S., Chandrasekharan, M.P., 1990. Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. International Journal of Production Research 28, 233-243.
32. Martello, S., Toth, P., 1990. Knapsack Problems: Algorithms and Computer Implementations (Wiley Interscience Series on Discrete Mathematices and Optimization). John Wiley and Sons, New York.
33. Michalewicz, Z., 1994. Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York.
34. Ponnambalam, S.G., Aravindan, P., Mogileeswar Naidu, G., 1999. A comparative evaluation of assembly line balancing heuristics. International Journal of Advanced Manufacturing Technology 15, 577-586.
35. Radcliffe, N.J., 1991. Forma Analysis and Random Respectful Combination. Belew and Booker, pp. 222-229.
36. Reeves, C.R., 1995. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22, 5-13.
37. Sabuncuogle, I., Erel, E., Tanyer, M., 2000. Assembly line balancing using genetic algorithms. Journal of Intelligent Manufacturing 11, 295-310.
38. Scholl, A., Klein, R., 1999. Balancing assembly lines effectively, a computational comparison. European Journal of Operational Research 114, 50-58.
39. Tam, K.Y., 1992. Genetic algorithms, function optimization, and facility layout design. European Journal of Operational Research 63, 322-346.
40. Tonge, F.M., 1961. A Heuristic Program of Assembly Line Balancing. Prentice-Hall, Englewood Cliff, NJ.
41. Venugopal, V., 1999. Soft-computing-based approaches to the group technology problem: a state-of-the-art review. International Journal of Production Research 37, 3335-3357.