A comparative study of genetic algorithm components in simulation-based optimisation

Proceedings - Winter Simulation Conference

Volumn , Issue , 2008, Pages 1829-1837

  Can, Birkan ^a   Beham, Andreas ^b   Heavey, Cathal ^a  

^a UNIVERSITY OF LIMERICK   (Ireland)

^b UNIVERSITY OF APPLIED SCIENCES UPPER AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER ALLOCATIONS; COMPARATIVE STUDIES; CONSTRAINT HANDLINGS; FITNESS ASSIGNMENTS; OPTIMISATION; PENALTY FUNCTIONS; PROBLEM-SPECIFIC KNOWLEDGE; RECOMBINATION OPERATORS; SIMULATION-BASED; STOCHASTIC COMPONENTS;

GENETIC ALGORITHMS;

EID: 60749134420     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2008.4736272     Document Type: Conference Paper

References (40)

1. Ahmed, M. A. 2007, A modification of the simulated annealing algorithm for discrete stochastic optimization. Engineering Optimization 39 (6): 701-714.
2. Alexopoulos, C. 2006. A comprehensive review of methods for simulation output analysis. In Proceedings of the 2006 Winter Simulation Conference, Vols 1-5, 168-178. New York: leee.
3. Allen, T., W. Ittiwattana, and M. Bernshteyn. 2002. An elitist genetic algorithm incorporating sequential subset selection. Ph. D. thesis, The Ohio State University.
4. Altiok, T. 1997. Performance analysis of manufacturing systems. New York: Springer-Verlag.
5. Altiparmak, F., B, Dengiz, and A. A. Bulgak. 2007. Buffer allocation and performance modeling in asynchronous assembly system operations: An artificial neural network metamodeling approach. Applied Soft Computing 7 (3): 946-956.
6. Andradttir, S. 2006. Simulation optimization with countably infinite feasible regions: efficiency and convergence. Acm Transactions on Modeling and Computer Simulation 16 (4): 357-374.
7. Asadathorn, N., and X. Chao. 1999. A decomposition approximation for assemblydisassembly queueing networkswith finite buffer and blocking. Annals of Operations Research 87 (0): 247-261.
8. Belton, V., J. Hodgkin, and G. Montibeller. 2004. From design to decision: An integrated approach linking discrete event simulation, evolutionary multi-objective optimisation and multicriteria decision analysis. In 17th International Conference on Multiple Criteria Decision Analysis. Whistler, Canada.
9. Bordoloi, S. K., W. Cooper, and H. Matsuo. 1999. Flexibility, adaptability, and efficiency in manufacturing systems. Production and Operations Management Society 8 (2): 133-150.
10. Bulgak, A. A. 2006. Analysis and design of split and merge unpaced assembly systems by metamodelling and stochastic search. International Journal of Production Research 44:4067-4080.
11. Bulgak, A. A., P. D. Diwan, and B. Inozu. 1995. Buffer size optimization in asynchronous assembly systems using genetic algorithms. Computers and Industrial Engineering 28:309-322.
12. Chan, F. T. S., and E. Y. H. Ng. 2002. Comparative evaluations of buffer allocation strategies in a serial production line. International Journal of Advanced Manufacturing Technology 19 (11): 789-800.
13. Chang, L., and T. Feng-sheng. 1994. Buffer allocation via the genetic algorithm.
14. Chaudhry, S. S., and W. Luo. 2005. Application of genetic algorithms in production and operations management: a review. International Journal of Production Research 43:4083-4101.
15. Conway, R., W. Maxwell, J. O. McClain, and L. J. Thomas. 1988. The role of work-in progress inventory in serial production lines. Operations Research 36 (2): 229.
16. Dolgui, A., A. Eremeev, and V. Sigaev. 2007. Hbba: hybrid algorithm for buffer allocation in tandem production lines. Journal of Intelligent Manufacturing 18(3): 411-420.
17. Fu, M. C. 2002. Optimization for discrete-event simulation: Theory and practice. In System Simulation and Scientific Computing, ed. Z. J. Chen, 50-50. Beijing: Int Acad Publ Beijing World Publ Corp.
18. Gen, M., and R. Cheng. 1997. Genetic algorithms & engineering design. Engineering Design and Automation. New York, NY: John Wiley & Sons, Inc.
19. Gershwin, S. B., and J. E. Schor. 2000. Efficient algorithms for buffer space allocation. Annals of Operations Research 93 (1): 117-144.
20. Goldberg, D., and K. Deb. 1990. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms, ed. G. Rawlings, 69-93. San Mateo, CA: Morgan Kaufmann Publishers.
21. Harris, J. H., and S. G. Powell, 1999, An algorithm for optimal buffer placement in reliable serial lines. HE Transactions 31:287-302,
22. Heavey, C, H. T. Papadopoulos, and J. Browne. 1993. The throughput rate of multistation unreliable production lines. European Journal of Operational Research 68 (1): 69-89.
23. Hillier, F. S., and K. C. So. 1995. On the optimal design of tandem queueing systems with finite buffers. Queueing Systems 21 (3): 245-266.
24. Hillier, F. S., K. C. So, and R. W. Boling. 1993. Toward characterizing the optimal allocation of storage space in production line systems with variable processing times. Management Science 39 (1): 126-133.
25. Hillier, M. S. 2000. Characterizing the optimal allocation of storage space in production line systems with variable processing times. IIE Transactions 32 (1): 1-8.
26. Huang, M.-G., P.-L. Chang, and Y.-C. Chou. 2002. Buffer allocation in flow-shop-type production systems with general arrival and service patterns. Computers & Operations Research 29 (2): 103-121.
27. Lacksonen, T. 2001. Empirical comparison of search algorithms for discrete event simulation. Computers and Industrial Engineering 40 (1-2): 133-148.
28. LΈcuyer, P., and G. Yin. 1998. Budget-dependent convergence rate of stochastic approximation. SIAM J. on Optimization 8 (1): 217-247.
29. Lutz, C. M., K. R. Davis, and M. H. Sun. 1998. Determining buffer location and size in production lines using tabu search. European Journal of Operational Research 106 (2-3): 301-316.
30. Oduguwa, V., A. Tiwari, and R. Roy. 2005. Evolutionary computing in manufacturing industry: an overview of recent applications. Applied Soft Computing 5 (3): 281-299.
31. Papadopoulos, H. T., C. Heavey, and J. Browne. 1993. Queuing theory. Springer.
32. Papadopoulos, H. T., C. Heavey, and M. E. J. O'Kelly. 1989. Throughput rate of multistation reliable production lines with inter station buffers, (i) exponential case. Comput. Ind. 13 (3): 229-244.
33. Rudolph, G. 1996. Convergence of evolutionary algorithms in general search spaces. In Proceedings of IEEE International Conference on Evolutionary Computation, 50-54. Nagoya, Japan: IEEE.
34. Spinellis, D., C. Papadopoulos, and J. M. Smith. 2000. Large production line optimization using simulated annealing. International Journal of Production Research 38 (3): 509-541.
35. Srinivas, M., and L. M. Patnaik. 1994. Genetic algorithms: a survey. Computer 27 (6): 17-26.
36. Tekin, E.,and I. Sabuncuoglu. 2004. Simulation optimization: A comprehensive review on theory and applications. HE Transactions 36 (11): 1067-1081.
37. Turchyn, O. 2007. Comparative analysis of metaheuristics solving combinatorial optimization problems. In
38. CADSM '07. 9th International Conference The Experience of Designing and Applications of CAD Systems in Microelectronics., 276-277. Polyana, UKRAINE.
39. Wolpert, D., and W. Macready. 1997. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 (1): 67-82.
40. Yamashita, H., and T. Altiok. 1998. Buffer capacity allocation for a desired throughput in production lines. HE Transactions 30:883-892.