Usage of metaheuristics in engineering: A literature review

Meta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance

Volumn , Issue , 2012, Pages 484-528

  Senvar, Ozlem ^a   Turanoglu, Ebru ^b   Kahraman, Cengiz ^c  

^a MARMARA UNIVERSITY   (Turkey)

^b SELCUK UNIVERSITY   (Turkey)

^c ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84895928416     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-4666-2086-5.ch016     Document Type: Chapter

References (236)

1. Agatonovic-Kustrin, S., & Beresford, R. (2000). Basic concepts of artificial neural network (ANN) modeling and its application in pharmaceutical research. Journal of Pharmaceutical and Biomedical Analysis, 22, 717-727. doi:10.1016/S0731-7085(99)00272-1
2. Ai, J., & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 36(5), 1693-1702. doi:10.1016/j.cor.2008.04.003
3. Alatas, B. (2010). Chaotic bee colony algorithms for global numerical optimization. Expert Systems with Applications, 37(8), 5682-5687. doi:10.1016/j.eswa.2010.02.042
4. Anghinolfi, D., & Paolucci, M. (2009). A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 193(1), 73-85. doi:10.1016/j.ejor.2007.10.044
5. Angira, R., & Babu, B. V. (2006). Optimization of process synthesis and design problems: A modified differential evolution approach. Chemical Engineering Science, 61(14), 4707-4721. doi:10.1016/j.ces.2006.03.004
6. Assareh, E., Behrang, M. A., Assari, M. R., & Ghanbarzadeh, A. (2010). Application of PSO and GA techniques on demand estimation of oil in Iran. Energy, 35, 5223-5229. doi:10.1016/j.energy.2010.07.043
7. Azadeh, A., Moghaddam, M., & Khakzad, M. (2011). A flexible neural network fuzzy mathematical programming algorithm for improvement of oil price estimation and forecasting. Computers & Industrial Engineering, 62(2). doi:10.1016/j.cie.2011.06.019
8. Baker, B. M., & Ayechew, M. A. (2003). A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30, 787-800. doi:10.1016/S0305-0548(02)00051-5
9. Bar-Yam, Y. (Ed.). (1997). Dynamics of complex systems. Addison-Wesley.
10. Baykasoǧlu, A., & Gindy, N. N. Z. (2004). Erratum to "A simulated annealing algorithm for dynamic layout problem". Computers & Operations Research, 31(2), 313-315. doi:10.1016/S0305-0548(03)00205-3
11. Bell, J. E., & McMullen, P. R. (2004). Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics, 18, 41-48. doi:10.1016/j.aei.2004.07.001
12. Ben-Daya, M., & Al-Fawzan, M. (1998). A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research, 9, 88-95. doi:10.1016/S0377-2217(97)00136-7
13. Bin, Y., Zhong-Zhen, Y., & Baozhen, Y. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196, 171-176. doi:10.1016/j.ejor.2008.02.028
14. Blum, C. (2005). Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & Operations Research, 32(6), 1565-1591. doi:10.1016/j.cor.2003.11.018
15. Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, 11, 4135-4151. doi:10.1016/j.asoc.2011.02.032
16. Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3), 268-308. doi:10.1145/937503.937505
17. Blum, C., Roli, A., & Sampels, M. (Eds.). (2008). Hybrid metaheuristics: An emerging approach to optimization series. Studies in Computational Intelligence, 114.
18. Blum, C., & Sampels, M. (2004). An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling and Algorithms, 3(3), 285-308. doi:10.1023/B:JMMA.0000038614.39977.6f
19. Bonabeou, E., & Meyer, C. (Eds.). (2001). Swarm intelligence: A whole new way to think about business. Harvard Business Review.
20. Bos, J. (1993). Zoning in forest management: A quadratic assignment problem solved by simulated annealing. Journal of Environmental Management, 37(2), 127-145. doi:10.1006/jema.1993.1010
21. Bouleimen, K., & Lecocq, H. (2003). A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research, 149(2), 268-281. doi:10.1016/S0377-2217(02)00761-0
22. Braglia, M. (1996). Optimisation of a simulatedannealing-based heuristic for single row machine layout problem by genetic algorithm. International Transactions in Operational Research, 3(1), 37-49. doi:10.1111/j.1475-3995.1996.tb00034.x
23. Brandão, J. (2004). A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 157, 552-564. doi:10.1016/S0377-2217(03)00238-8
24. Brandão, J. (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 173, 540-555. doi:10.1016/j.ejor.2005.01.042
25. Brandão, J., & Eglese, R. (2008). A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research, 35, 1112-1126. doi:10.1016/j.cor.2006.07.007
26. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1997). A new rank-based version of the ant system: A computational study. Central. European Journal of Operational Research and Economics, 7(1), 25-38.
27. Burke, E. K., & Newall, J. P. (1999). A multistage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 3(1), 63-74. doi:10.1109/4235.752921
28. Cakir, B., Altiparmak, F., & Dengi, B. (2011). Multi-objective optimization of a stochastic assembly line balancing: A hybrid simulated annealing algorithm. Computers & Industrial Engineering, 60(3), 376-384. doi:10.1016/j.cie.2010.08.013
29. Cerny, V. (1985). A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41-51. doi:10.1007/BF00940812
30. Chau, K. W. (2006). Particle swarm optimization training algorithm for ANNs in stage prediction of Shing Mun River. Journal of Hydrology (Amsterdam), 329(3-4), 363-367. doi:10.1016/j.jhydrol.2006.02.025
31. Chen, M.-T., Lin, B. M. T., & Tseng, S.-S. (2011). Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion. Engineering Applications of Artificial Intelligence, 24(2), 295-305. doi:10.1016/j.engappai.2010.05.010
32. Chen, R.-M. (2011). Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem. Expert Systems with Applications, 38(6), 7102-7111. doi:10.1016/j.eswa.2010.12.059
33. Chen, S. H., Jakeman, A. J., & Norton, J. P. (2008). Artificial intelligence techniques: An introduction to their use for modeling environmental systems. Mathematics and Computers in Simulation, 78(2-3), 379-400. doi:10.1016/j.matcom.2008.01.028
34. Chen, S.-M., & Chien, C.-Y. (2011). Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Systems with Applications, 38(4), 3873-3883. doi:10.1016/j.eswa.2010.09.048
35. Chen, S.-M., & Chien, C.-Y. (in press). Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. [in press]. Expert Systems with Applications.
36. Chen, Y., & Zhang, P. (2006). Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution. Physica A. Statistical and Theoretical Physics, 371(2), 627-632. doi:10.1016/j.physa.2006.04.052
37. Cheng, H., Wang, X., Yang, S., & Huang, M. (2009). A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks. Applied Soft Computing, 9(2), 677-684. doi:10.1016/j.asoc.2008.09.008
38. Chica, M., Cordon, O., Damas, S., & Bautista, J. (2009). Adding diversity to two multiobjective constructive metaheuristics for time and space assembly line balancing. Frontiers of Assembly and Manufacturing (pp. 211-226). Springer.
39. Chow, M.-Y., Sharpe, R. N., & Hung, J. C. (1993). On the application and design of artificial neural networks for motor fault detection-part I. IEEE Transactions on Industrial Electronics, 40(2).
40. Chwif, L., Barretto, M. R. P., & Moscato, L. A. (1998). A solution to the facility layout problem using simulated annealing. Computers in Industry, 36(1-2), 125-132. doi:10.1016/S0166-3615(97)00106-1
41. Cockshott, A. R., & Hartman, B. E. (2001). Improving the fermentation medium for Echinocandin B production part II: Particle swarm optimization. Process Biochemistry, 36(7), 661-669. doi:10.1016/S0032-9592(00)00261-2
42. Colorni, A., Dorigo, M., & Maniezzo, V. (1991). Distributed optimization by ant colonies. In Proceedings of the First European Conference on Artificial Life (pp. 134-142). Paris, France: Elsevier Publishing.
43. Cordon, O., Fernandez de Viana, I., Herrera, F., & Moreno, L. (2000). A new ACO model integrating evolutionary computation concepts: The best-worst ant system. In M. Dorigo, M. Middendorf, & T. Stützle (Eds.), Abstract Proceedings of ANTS2000-From Ant Colonies to Artificial Ants: A Series of International Workshops on Ant Algorithms, (pp. 22-29). IRIDIA, Universite Libre de Bruxelles, Belgium.
44. Da Silva, E. L., Ortiz, J. M. A., De Oliveira, G. C., & Binato, S. (2001). Transmission network expansion planning under a Tabu Search approach. IEEE Transactions on Power Systems, 16(1), 62-68. doi:10.1109/59.910782
45. Das, H., Cummings, H. P. T., & Le Van, M. D. (1990). Scheduling of serial multiproduct batch processes via simulated annealing. Computers & Chemical Engineering, 14(12), 1351-1362. doi:10.1016/0098-1354(90)80017-6
46. Das, S., Konar, A., & Chakraborty, U. K. (2005). An efficient evolutionary algorithm applied to the design of two-dimensional IIR □lters. In Proceedings of the 2005 conference on Genetic and evolutionary computation. Washington, DC, USA.
47. Dawson, C. W., & Wilby, R. (1998). An artificial neural network approach to rainfall-runoff Modelling. Hydrological Sciences-Journal-des Sciences Hydrologiques, 43(1).
48. Demirel, N. Ç., & Toksari, M. D. (2006). Optimization of the quadratic assignment problem using an ant colony algorithm. Applied Mathematics and Computation, 183, 427-435. doi:10.1016/j.amc.2006.05.073
49. Den Besten, M. L., Stutzle, T., & Dorigo, M. (2000). Ant colony optimization for the total weighted tardiness problem. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, H.-P. Schwefel (Eds.), Proceedings of PPSNVI, Sixth Internat. Conf. on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 1917 (pp. 611-620). Berlin, Germany: Springer.
50. Deng, A.-M., Mao, C., & Zhou, Y.-T. (2009). Optimizing research of an improved simulated annealing algorithm to soft time windows vehicle routing problem with pick-up and delivery. Systems Engineering - Theory & Practice, 29(5), 186-192.
51. Deng, G.-F., & Lin, W.-T. (2011). Ant colony optimization-based algorithm for airline crew scheduling problem. Expert Systems with Applications, 38(5), 5787-5793. doi:10.1016/j.eswa.2010.10.053
52. Deschinkel, K., Farges, J.-L., & Delahaye, D. (2002). Optimizing and assigning price levels for air traffic management. Transportation Research Part E, Logistics and Transportation Review, 38(3-4), 221-237. doi:10.1016/S1366-5545(02)00007-8
53. Dodin, B., Elimam, A. A., & Rolland, E. (1998). Tabu search in audit scheduling. European Journal of Operational Research, 106(2), 373-392. doi:10.1016/S0377-2217(97)00280-4
54. Donati, V. A., Montemanni, R., Casagrande, N., Rizzoli, A. E., & Gambardella, L. M. (2008). Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research, 185(3), 1174-1191. doi:10.1016/j.ejor.2006.06.047
55. Dong, M., Wu, C., & Hou, F. (2009). Shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment. Expert Systems with Applications, 36(8), 11221-11232. doi:10.1016/j.eswa.2009.02.091
56. Dorigo, M. (1992). Optimization, learning and natural algorithms. Unpublished doctoral dissertation, University of Politecnico di Milano, Italy.
57. Dorigo, M., & Gambardella, L. M. (1997a). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1, 53-66. doi:10.1109/4235.585892
58. Dorigo, M., & Gambardella, L. M. (1997b). Ant colonies for the travelling salesman problem. Bio Systems, 43, 73-81. doi:10.1016/S0303-2647(97)01708-5
59. Dorigo, M., Maniezzo, V., & Colorni, A. (1991). The ant system: An autocatalytic optimizing process. Technical Report TR91-016, Politecnico di Milano.
60. Dorigo, M., & Stützle, T. (Eds.). (2004). Ant colony optimization. Cambridge, MA: MIT Press. doi:10.1007/b99492
61. Eberhart, R. C., & Shi, Y. (2001). Particle swarm optimization: Developments, applications and resources. In Proceedings of Congress on Evolutionary Computation, Seoul, Korea. Piscataway, NJ: IEEE Service Center.
62. El-Bouri, A., Azizi, N., & Zolfaghari, S. (2007). A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling. European Journal of Operational Research, 177(3), 1894-1910. doi:10.1016/j.ejor.2005.12.013
63. El-Telbany, M., & El-Karmi, F. (2008). Short-term forecasting of Jordanian electricity demand using particle swarm optimization. Electric Power Systems Research, 78(3), 425-433. doi:10.1016/j.epsr.2007.03.011
64. Farmahini-Farahani, A., Vakili, S., Fakhraie, S. M., Safari, S., & Lucas, C. (2010). Parallel scalable hardware implementation of asynchronous discrete particle swarm optimization. Engineering Applications of Artificial Intelligence, 23(2), 177-187. doi:10.1016/j.engappai.2009.12.001
65. Fogel, G. B., & Corne, D. W. (Eds.). (2002). Evolutionary computation in bioinformatics. Oxford, UK: Elsevier LTD, Academic Press.
66. Fonseca, C. M., & Fleming, P. J. (1998). Multiobjective optimization and multiple constraint handling with evolutionary algorithms - Part I: A uni□ed formulation. IEEE Transactions on Systems, Man, and Cybernetics. Part A, Systems and Humans, 28(1), 26-37. doi:10.1109/3468.650319
67. Fournier, J. R. L., & Pierre, S. (2005). Assigning cells to switches in mobile networks using an ant colony optimization heuristic. Computer Communications, 28, 65-73. doi:10.1016/j.com-com.2004.07.006
68. Fuellerer, G., Doerner, K. F., Hartl, R. F., & Iori, M. (2010). Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research, 201(3), 751-759. doi:10.1016/j.ejor.2009.03.046
69. Gagne, C., Price, W. L., & Gravel, M. (2002). Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. The Journal of the Operational Research Society, 53, 895-906. doi:10.1057/palgrave.jors.2601390
70. Gajpal, Y., & Rajendran, C. (2006). An antcolony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics, 101(2), 259-272. doi:10.1016/j.ijpe.2005.01.003
71. Gallego, R. A., Romero, R., & Monticelli, A. J. (2000). Tabu search algorithm for network synthesis. IEEE Transactions on Power Systems, 15(2). doi:10.1109/59.867130
72. Gambardella, L. M., & Dorigo, M. (1995). Ant-Q: A reinforcement learning approach to the travelling salesman problem. In Proceedings of the Twelfth International Conference on Machine Learning, California, USA.
73. Gambardella, L. M., & Dorigo, M. (1996). Solving symmetric and asymmetric TSPs by ant colonies. In Proceedings of the IEEE Conference on Evolutionary Computation (pp. 622-627). Nagoya, Japan.
74. Gambardella, L. M., & Dorigo, M. (2000). Ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing, 12(3), 237-255. doi:10.1287/ijoc.12.3.237.12636
75. Gambardella, L. M., Taillard, E. D., & Agazzi, G. (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In Corne, D., Dorigo, M., & Glover, F. (Eds.), New ideas in optimization (pp. 63-76). London, UK: McGraw-Hill.
76. Gangadharan, R., & Rajendran, C. (1994). A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Computers & Industrial Engineering, 27(1-4), 473-476. doi:10.1016/0360-8352(94)90337-9
77. García-Martínez, C., Cordón, O., & Herrera, F. (2007). A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. European Journal of Operational Research, 180(1), 116-148. doi:10.1016/j.ejor.2006.03.041
78. Geethanjali, M., Slochanal, S. M. R., & Bhavani, R. (2008). PSO trained ANN-based differential protection scheme for power transformers. Neurocomputing, 71(4-6), 904-918. doi:10.1016/j.neucom.2007.02.014
79. Geiger, M. J. (Ed.). (2009). Metaheuristics in the service industry. Berlin, Germany: SpringerVerlag.
80. Geng, X., Chen, Z., Yang, W., Shi, D., & Zhao, K. (2011). Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Applied Soft Computing, 11(4), 3680-3689. doi:10.1016/j.asoc.2011.01.039
81. Genovese, K., Lamberti, L., & Pappalettere, C. (2005). Improved global-local simulated annealing formulation for solving non-smooth engineering optimization problems. International Journal of Solids and Structures, 42(1), 203-237. doi:10.1016/j.ijsolstr.2004.07.015
82. German, S., & German, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Proceedings Pattern Analysis and Machine Intelligence, 6(6), 721-741.
83. Geyik, F., & Cedimoglu, I. H. (2004). The strategies and parameters of tabu search for job-shop scheduling problem. Journal of Intelligent Manufacturing, 15, 439-448. doi:10.1023/B:JIMS.0000034106.86434.46
84. Glover, F. (2005). Adaptive memory projection methods for integer programming. In Rego, C., & Alidaee, B. (Eds.), Metaheuristic optimization via memory and evolution (pp. 425-440). Kluwer Academic Publishers. doi:10.1007/0-387-23667-8_19
85. Glover, F., & Kochenberger, G. A. (2003). Handbook of metaheuristics. Springer.
86. Goldberg, D. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley.
87. Hamam, Y., & Hindi, K. S. (2000). Assignment of program modules to processors: A simulated annealing approach. European Journal of Operational Research, 122(2), 509-513. doi:10.1016/S0377-2217(99)00251-9
88. Han, K.-H., & Kim, J. H. (2002). Quantuminspired evolutionary algorithm for a class of combinatorial optimization. IEEE Transactions on Evolutionary Computation, 6(6), 580-593. doi:10.1109/TEVC.2002.804320
89. Handa, H., Lin, D., Chapman, L., & Yao, X. (2006). Robust solution of salting route optimisation using evolutionary algorithms. In Proceedings of the IEEE Congress on Evolutionary Computation (pp. 3098-3105).
90. Hanke, M., & Li, P. (2000). Simulated annealing for the optimization of batch distillation processes. Computers & Chemical Engineering, 24(1), 1-8. doi:10.1016/S0098-1354(00)00317-3
91. Hasançebi, O., & Erbatur, F. (2002). Layout optimisation of trusses using simulated annealing. Advances in Engineering Software, 33(7-10), 681-696. doi:10.1016/S0965-9978(02)00049-2
92. Hasteer, G., & Banerjee, P. (1997). Simulated annealing based parallel state assignment of finite state machines. Journal of Parallel and Distributed Computing, 43(1), 21-35. doi:10.1006/jpdc.1997.1325
93. He, Z., Wang, N., Jia, T., & Xu, Y. (2009). Simulated annealing and tabu search for multi-mode project payment scheduling. European Journal of Operational Research, 198(3), 688-696. doi:10.1016/j.ejor.2008.10.005
94. He, Z., Yang, T., & Tiger, A. (1996). An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling. European Journal of Operational Research, 91(1), 99-117. doi:10.1016/0377-2217(94)00361-0
95. Hertz, A., Taillard, E., & Werra, D. (2005). A tutorial on Tabu search. Retrieved April 14, 2005, from http://www.cs.colostate.edu/~whitley/CS640/hertz92tutorial.pdf
96. Hillier, F. S., & Lieberman, G. J. (2005). Introduction to operations research (8th ed.). New York, NY: McGraw-Hill.
97. Holland, J. H. (Ed.). (1975). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. Ann Arbor, MI: University of Michigan Press.
98. Hsieh, T.-J., Hsiao, H.-F., & Yeh, W.-C. (2011). Forecasting stock markets using wavelet transforms and recurrent neural networks: An integrated system based on artificial bee colony algorithm. Applied Soft Computing, 11(2), 2510-2525. doi:10.1016/j.asoc.2010.09.007
99. Hu, P., Cao, G.-Y., Zhu, X.-J., & Li, J. (2010). Modeling of a proton exchange membrane fuel cell based on the hybrid particle swarm optimization with Levenberg-Marquardt neural network. Simulation Modelling Practice and Theory, 18(5), 574-588. doi:10.1016/j.simpat.2010.01.001
100. Huang, Y.-M., & Lin, J.-C. (2011). A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems. Expert Systems with Applications, 38(5), 5438-5447. doi:10.1016/j.eswa.2010.10.010
101. Jansen, P. W., & Perez, R. E. (2011). Constrained structural design optimization via a parallel augmented Lagrangian particle swarm optimization approach. Computers & Structures, 89(13-14), 1352-1366. doi:10.1016/j.compstruc.2011.03.011
102. Jeffcoat, D. E., & Bulfin, R. L. (1993). Simulated annealing for resource-constrained scheduling. European Journal of Operational Research, 70(1), 43-51. doi:10.1016/0377-2217(93)90231-B
103. Jeong, C.-S., & Kim, M.-H. (1991). Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections. Parallel Computing, 17(2-3), 221-228. doi:10.1016/S0167-8191(05)80107-3
104. Kang, F., Li, J., & Ma, Z. (2011). Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions. Information Science, 181(16), 3508-3531. doi:10.1016/j.ins.2011.04.024
105. Karaboǧa, D. (2005). An idea based on honeybee swarm for numerical optimization. Technical Report TR06, Erciyes University.
106. Karaboga, D., & Akay, B. (2011). A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Applied Soft Computing, 11(3), 3021-3031. doi:10.1016/j.asoc.2010.12.001
107. Karaboǧa, D., & Akay, B. A. (2009). Comparative study of artificial bee colony algorithm. Applied Mathematics and Computation, 214, 108-132. doi:10.1016/j.amc.2009.03.090
108. Karaboǧa, D., & Baştük, B. (2007b). Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. LNCS: Advances in Soft Computing: Foundations of Fuzzy Logic and Soft Computing, 4529, 789-798. doi:10.1007/978-3-540-72950-1_77
109. Karaboǧa, D., & Baştürk, B. (2007a). A powerful and efficient algorithm for numerical optimization: Artificial bee colony (ABC) algorithm. Journal of Global Optimization, 39(3), 459-471. doi:10.1007/s10898-007-9149-x
110. Karaboǧa, D., & Baştürk, B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing, 8(1), 687-697. doi:10.1016/j.asoc.2007.05.007
111. Karaboga, D., & Ökdem, S. (2004). A simple and global optimization algorithm for engineering problems: Differential evolution algorithm. Turkish Journal of Electrical Engineering, 12(1).
112. Kariuki, B. M., Serrano-Gonzalez, H., Johnston, R. L., & Harris, K. D. M. (1997). The application of a genetic algorithm for solving crystal structures from powder diffraction data. Chemical Physics Letters, 280, 189-195. doi:10.1016/S0009-2614(97)01156-1
113. Karr, C. L., & Gentry, E. J. (1993). Fuzzy control of pH using genetic algorithms. IEEE Transactions on Fuzzy Systems, 1(1). doi:10.1109/TFUZZ.1993.390283
114. Kayhan, A. H., Ceylan, H., Ayvaz, M. T., & Gurarslan, G. (2010). PSOLVER: A new hybrid particle swarm optimization algorithm for solving continuous optimization problems. Expert Systems with Applications, 37(10), 6798-6808. doi:10.1016/j.eswa.2010.03.046
115. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the 1995 IEEE International Conference on Neural Networks (pp. 1942-1948). Perth, Australia. Piscataway, NJ: IEEE Service Center.
116. Kim, D.-W., Kim, K.-H., Jang, W., & Chen, F. F. (2002). Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer-integrated Manufacturing, 18(3-4), 223-231. doi:10.1016/S0736-5845(02)00013-3
117. Kim, H.-S., & Cho, S.-B. (2000). Application of interactive genetic algorithm to fashion design. Engineering Applications of Artificial Intelligence, 13, 635-644. doi:10.1016/S0952-1976(00)00045-2
118. Kim, J. Y., & Kim, Y. K. (2005). Multileveled symbiotic evolutionary algorithm: Application to FMS loading problems. Applied Intelligence, 22, 233-249. doi:10.1007/s10791-005-6621-4
119. Kirpatrick, S., Gelat, C. D. Jr, & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671-680. doi:10.1126/sci-ence.220.4598.671
120. Kouvelis, P., Chiang, W.-C., & Fitzsimmons, J. (1992). Simulated annealing for machine layout problems in the presence of zoning constraints. European Journal of Operational Research, 57(2), 203-223. doi:10.1016/0377-2217(92)90043-9
121. Kuo, Y. (2010). Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Computers & Industrial Engineering, 59(1), 157-165. doi:10.1016/j.cie.2010.03.012
122. Lee, I., Sikora, R., & Shaw, M. J. (1997). A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes. IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics, 27(1), 36-54. doi:10.1109/3477.552184
123. Lee, S., Ryu, J.-H., Won, J.-S., & Park, H.-J. (2004). Determination and application of the weights for landslide susceptibility mapping using an artificial neural network. Engineering Geology, 71, 289-302. doi:10.1016/S0013-7952(03)00142-X
124. Lek, S., & Guegan, J. F. (1999). Artificial neural networks as a tool in ecological modelling, an introduction. Ecological Modelling, 120, 65-73. doi:10.1016/S0304-3800(99)00092-7
125. Leung, C. W., Wong, T. N., Mak, K. L., & Fung, R. Y. K. (2010). Integrated process planning and scheduling by an agent-based ant colony optimization. Computers & Industrial Engineering, 59(1), 166-180. doi:10.1016/j.cie.2009.09.003
126. Lian, Z., Gu, X., & Jiao, B. (2006). A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation, 175(1), 773-785. doi:10.1016/j.amc.2005.07.042
127. Liang, R.-H., & Wang, Y. S. (2001). Main transformer ULTC and capacitors scheduling by simulated annealing approach. International Journal of Electrical Power & Energy Systems, 23(7), 531-538. doi:10.1016/S0142-0615(00)00086-7
128. Liao, C.-J., Tseng, C.-T., & Luarn, P. (2007). A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research, 34(10), 3099-3111. doi:10.1016/j.cor.2005.11.017
129. Lin, B., & Miller, D. C. (2004). Solving heat exchanger network synthesis problems with Tabu Search. Computers & Chemical Engineering, 28, 1451-1464. doi:10.1016/j.compche-meng.2003.10.004
130. Lin, L.-C. (2009). Optimal chiller loading by particle swarm algorithm for reducing energy consumption. Applied Thermal Engineering, 29(8-9), 1730-1734. doi:10.1016/j.appltherma-leng.2008.08.004
131. Lin, S.-Y., Horng, S.-J., Kao, T.-W., Huang, D.K., Fahn, C.-S., & Lai, J.-L. (2010). An efficient bi-objective personnel assignment algorithm based on a hybrid particle swarm optimization model. Expert Systems with Applications, 37(12), 7825-7830. doi:10.1016/j.eswa.2010.04.056
132. Lin, T.-L., Horng, S.-J., Kao, T.-W., Chen, Y.-H., Run, R.-S., & Chen, R.-J. (2010). An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Systems with Applications, 37(3), 2629-2636. doi:10.1016/j.eswa.2009.08.015
133. Liu, H., Abraham, A., & Clerc, M. (2007). Chaotic dynamic characteristics in swarm intelligence. Applied Soft Computing, 7(3), 1019-1026. doi:10.1016/j.asoc.2006.10.006
134. Liu, J., Li, G., Chen, D., Liu, W., & Wang, Y. (2010). Two-dimensional equilibrium constraint layout using simulated annealing. Computers & Industrial Engineering, 59(4), 530-536. doi:10.1016/j.cie.2010.06.009
135. Lo, Z.-P., & Bavarian, B. (1992). Optimization of job scheduling on parallel machines by simulated annealing algorithms. Expert Systems with Applications, 4(3), 323-328. doi:10.1016/0957-4174(92)90068-4
136. Low, C. (2005). Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers & Operations Research, 32(8), 2013-2025. doi:10.1016/j.cor.2004.01.003
137. Lu, M., Lam, H.-C., & Dai, F. (2008). Resourceconstrained critical path analysis based on discrete event simulation and particle swarm optimization. Automation in Construction, 17(6), 670-681. doi:10.1016/j.autcon.2007.11.004
138. Luh, G.-C., Lin, Y.-S., & Lin, C.-Y. (2011). A binary particle swarm optimization for continuum structural topology optimization. Applied Soft Computing, 11(2), 2833-2844. doi:10.1016/j.asoc.2010.11.013
139. Maniezzo, V., & Colorni, A. (1999). The ant system applied to the quadratic assignment problem. IEEE Transaction Data Knowledge Engineering, 11(5), 769-778. doi:10.1109/69.806935
140. Mariano, A. P., Costa, C. B. B., Vasco de Toledo, E. C., Melo, D. N. C., & Filho, R. M. (in press). Analysis of the particle swarm algorithm in the optimization of a three-phase slurry catalytic reactor. [in press]. Computers & Chemical Engineering.
141. Marimuthu, S., Ponnambalam, S. G., & Jawahar, N. (2009). Threshold accepting and Ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of Materials Processing Technology, 209(2), 1026-1041. doi:10.1016/j.jmatprotec.2008.03.013
142. Marinakis, Y., & Marinak, M. (2010). A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Computers & Operations Research, 37(3), 432-442. doi:10.1016/j.cor.2009.03.004
143. McKendall, A. R. Jr, Shang, J., & Kuppusamy, S. (2006). Simulated annealing heuristics for the dynamic facility layout problem. Computers & Operations Research, 33(8), 2431-2444. doi:10.1016/j.cor.2005.02.021
144. Melouk, S., Damodaran, P., & Chang, P.-Y. (2004). Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics, 87(2), 141-147. doi:10.1016/S0925-5273(03)00092-6
145. Merkle, D., Middendorf, M., & Schmeck, H. (2002). Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation, 6(4), 333-346. doi:10.1109/TEVC.2002.802450
146. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., & Teller, E. (1953). Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6), 1087-1092. doi:10.1063/1.1699114
147. MirHassani, S. A., & Abolghasemi, N. (2011). A particle swarm optimization algorithm for open vehicle routing problem. Expert Systems with Applications, 38(9), 11547-11551. doi:10.1016/j.eswa.2011.03.032
148. Nearchou, A. C. (2007). Balancing large assembly lines by a new heuristic based on differential evolution method. International Journal of Advanced Manufacturing Technology, 34, 1016-1029. doi:10.1007/s00170-006-0655-7
149. Nearchou, A. C. (2011). Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization. International Journal of Production Economics, 129(2), 242-250. doi:10.1016/j.ijpe.2010.10.016
150. Nickolay, B., Schneider, B., & Jacob, S. (1997). Parameter optimisation of an image processing system using evolutionary algorithms. In Computer Analysis of Images and Patterns, Proceedings of the 7th International Conference, Vol. 1296. Lecture Notes in Computer Science (pp. 637-644). Berlin, Germany: Springer.
151. Obayashi, S. (1998). Multidisciplinary design optimization of aircraft wing planform based on evolutionary algorithms. In Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. La Jolla, CA: IEEE Press.
152. Ogura, T., & Sato, C. (2006). A fully automatic 3D reconstruction method using simulated annealing enables accurate posterioric angular assignment of protein projections. Journal of Structural Biology, 156(3), 371-386. doi:10.1016/j.jsb.2006.05.016
153. Oh, S.-K., Kim, W.-D., Pedrycz, W., & Park, B.-J. (2011). Polynomial-based radial basis function neural networks (P-RBF NNs) realized with the aid of particle swarm optimization. Fuzzy Sets and Systems, 163(1), 54-77. doi:10.1016/j.fss.2010.08.007
154. Ólafsson, S. (2006). Metaheuristics. In Nelson, B. L., & Henderson, S. G. (Eds.), Handbook on simulation, handbooks in operations research and management science VII (pp. 633-654). Elsevier.
155. Oliveira, I. M. S., & Schirru, R. (2011). Swarm intelligence of artificial bees applied to in-core fuel management optimization. Annals of Nuclear Energy, 38(5), 1039-1045. doi:10.1016/j.anu-cene.2011.01.009
156. Önüt, S., Tuzkaya, U. R., & Doǧaç, B. (2008). A particle swarm optimization algorithm for the multiple-level warehouse layout design problem. Computers & Industrial Engineering, 54, 783-799. doi:10.1016/j.cie.2007.10.012
157. Onwubolu, G., & Davendra, D. (2006). Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research, 171, 674-692. doi:10.1016/j.ejor.2004.08.043
158. Ozbakir, L., Baykasoglu, L. A., Gorkemli, B., & Gorkemli, L. (2011). Multiple-colony ant algorithm for parallel assembly line balancing problem. Applied Soft Computing, 11(3), 3186-3198. doi:10.1016/j.asoc.2010.12.021
159. Özcan, U. (2010). Balancing stochastic two-sided assembly lines: A chance-constrained, piecewiselinear, mixed integer program and a simulated annealing algorithm. European Journal of Operational Research, 205(1), 81-97. doi:10.1016/j.ejor.2009.11.033
160. Pan, Q.-K., Tasgetiren, M. F., Suganthan, P. N., & Chen, A. T.-J. (2011). A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 181(12), 2455-2468. doi:10.1016/j.ins.2009.12.025
161. Park, D. C., & El-Sharkawi, M. A., & Marks 11, R. J. (1991). Electric load forecasting using artificial neural network. IEEE Transactions on Power Systems, 6(2). doi:10.1109/59.76685
162. Paul, G. (2010). Comparative performance of Tabu search and simulated annealing heuristics for the quadratic assignment problem. Operations Research Letters, 38(6), 577-581. doi:10.1016/j.orl.2010.09.009
163. Peng, T., Huanchen, W., & Dongme, Z. (1996). Simulated annealing for the quadratic assignment problem: A further study. Computers & Industrial Engineering, 31(3-4), 925-928. doi:10.1016/S0360-8352(96)00265-3
164. Perez, R. E., & Behdinan, K. (2007). Particle swarm approach for structural design optimization. Computers & Structures, 85(19-20), 1579-1588. doi:10.1016/j.compstruc.2006.10.013
165. Pham, D. T., & Karaboga, D. (2000). Intelligent optimisation techniques - Genetic algorithms, Tabu search, simulated annealing and neural networks. London, UK: Springer-Verlag.
166. Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization. Swarm Intelligence, 1(1), 33-57. doi:10.1007/s11721-007-0002-0
167. Puris, A., Bello, R., & Herrera, F. (2010). Analysis of the efficacy of a two-stage methodology for ant colony optimization: Case of study with TSP and QAP. Expert Systems with Applications, 37(7), 5443-5453. doi:10.1016/j.eswa.2010.02.069
168. Raaymakers, W. H. M., & Hoogeveen, J. A. (2000). Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research, 126(1), 131-151. doi:10.1016/S0377-2217(99)00285-4
169. Rehman, S., & Mohandes, M. (2008). Artificial neural network estimation of global solar radiation using air temperature and relative humidity. Energy Policy, 36, 571-576. doi:10.1016/j.enpol.2007.09.033
170. Resende, M. G. C., & De Sousa, J. P. (Eds.). (2004). Metaheuristics: Computer decision making. Netherlands: Kluwer Academic Publishers.
171. Reynolds, A. P., & McKeown, G. P. (1999). Scheduling a manufacturing plant using simulated annealing and simulation. Computers & Industrial Engineering, 37(1-2), 63-67. doi:10.1016/S0360-8352(99)00024-8
172. Roh, S.-B., Ahn, T.-C., & Pedrycz, W. (2010). The design methodology of radial basis function neural networks based on fuzzy K-nearest neighbors approach. Fuzzy Sets and Systems, 161(13), 1803-1822. doi:10.1016/j.fss.2009.10.014
173. Rossi, A., & Dini, G. (2007). Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robotics and Computer-integrated Manufacturing, 23(5), 503-516. doi:10.1016/j.rcim.2006.06.004
174. Sabuncuoglu, I., Erel, E., & Alp, A. (2009). Ant colony optimization for the single model U-type assembly line balancing problem. International Journal of Production Economics, 120(2), 287-300. doi:10.1016/j.ijpe.2008.11.017
175. Şahin, R. (2011). A simulated annealing algorithm for solving the bi-objective facility layout problem. Expert Systems with Applications, 38(4), 4460-4465. doi:10.1016/j.eswa.2010.09.117
176. Salleh, S., & Zomaya, A. Y. (1998). Multiprocessor scheduling using mean-field annealing. Future Generation Computer Systems, 14(5-6), 393-408. doi:10.1016/S0167-739X(98)00042-9
177. Salman, A., Ahmad, I., & Al-Mada, S. (2002). Particle swarm optimization for task assignment problem. Microprocessors and Microsystems, 26(8), 363-371. doi:10.1016/S0141-9331(02)00053-4
178. Santos de Oliveira, I. M., & Schirru, R. (2011). Swarm intelligence of artificial bees applied to in-core fuel management optimization. Annals of Nuclear Energy, 38(5), 1039-1045. doi:10.1016/j.anucene.2011.01.009
179. Saraiva, J. T., Pereira, M. L., Mendes, V. T., & Sousa, J. C. (2011). A simulated annealing based approach to solve the generator maintenance scheduling problem. Electric Power Systems Research, 81(7), 1283-1291. doi:10.1016/j.epsr.2011.01.013
180. Şenkal, O., & Kuleli, T. (2009). Estimation of solar radiation over Turkey using artificial neural network and satellite data. Applied Energy, 86, 1222-1228. doi:10.1016/j.apenergy.2008.06.003
181. Sha, D. Y., & Hsu, C.-Y. (2008). A new particle swarm optimization for the open shop scheduling problem. Computers & Operations Research, 35(10), 3243-3261. doi:10.1016/j.cor.2007.02.019
182. Shafie-Khah, M., Moghaddam, M. P., & SheikhEl-Eslami, M. K. (2011). Price forecasting of day-ahead electricity markets using a hybrid forecast method. Energy Conversion and Management, 52(5), 2165-2169. doi:10.1016/j.encon-man.2010.10.047
183. Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., & Wang, Q. X. (2007). Particle swarm optimizationbased algorithms for TSP and generalized TSP. Information Processing Letters, 103(5), 169-176. doi:10.1016/j.ipl.2007.03.010
184. Shi, Y., & Eberhart, R. (1998). A modified particle swarm optimizer. Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence (pp. 69-73). Anchorage, AK, USA.
185. Shin, K.-S., & Lee, Y.-J. (2002). A genetic algorithm application in bankruptcy prediction modeling. Expert Systems with Applications, 23(3), 321-328. doi:10.1016/S0957-4174(02)00051-9
186. Shyu, S. J., Lin, B. M. T., & Hsiao, T.-S. (2006). Ant colony optimization for the cell assignment problem in PCS networks. Computers & Operations Research, 33, 1713-1740. doi:10.1016/j.cor.2004.11.026
187. Simaria, A. S., & Vilarinho, P. M. (2009). 2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines. Computers & Industrial Engineering, 56(2), 489-506. doi:10.1016/j.cie.2007.10.007
188. Socha, K., & Dorigo, M. (2008). Ant colony optimization for continuous domains. European Journal of Operational Research, 185, 1155-1173. doi:10.1016/j.ejor.2006.06.046
189. Sonmez, M. (2011). Artificial bee colony algorithm for optimization of truss structures. Applied Soft Computing, 11(2), 2406-2418. doi:10.1016/j.asoc.2010.09.003
190. Souilah, A. (1995). Simulated annealing for manufacturing systems layout design. European Journal of Operational Research, 82(3), 592-614. doi:10.1016/0377-2217(93)E0336-V
191. Stumberger, G., Dolinar, D., Pahner, U., & Hamayer, K. (2000). Optimization of radial active magnetic bearings using the finite element technique and differential evolution algorithm. IEEE Transactions on Magnetics, 36(4).
192. Stützle, T. (1998). An ant approach to the flow shop problem. In Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (pp. 1560-1564). Aachen, Germany: Verlag Mainz.
193. Stützle, T., & Hoos, H. (1996). Improving the ant system: A detailed report on the MAX-MIN ant system. Technical Report AIDA-96-12, FG Intellektik, FN Informatik, TU Darmstadt, Germany.
194. Stützle, T., & Hoos, H. (2000). MAX-MIN ant system. Future Generation Computer Systems, 16(8), 889-904.
195. Suman, B., Hoda, N., & Jha, S. (2010). Orthogonal simulated annealing for multiobjective optimization. Computers & Chemical Engineering, 34(10), 1618-1631. doi:10.1016/j.compche-meng.2009.11.015
196. Sun, M., Aronson, J. E., McKeown, P. G., & Drinka, D. (1998). A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research, 106, 441-456. doi:10.1016/S0377-2217(97)00284-1
197. Sundhararajan, S., & Pahwa, A. (1994). Optimal selection of capacitors for radial distribution systems using a genetic algorithm. IEEE Transactions on Power Systems, 9(3), 1499-1507. doi:10.1109/59.336111
198. Szeto, W. Y., Wu, Y., & Ho, S. C. (2011). An artificial bee colony algorithm for the capacitated vehicle routing problem. European Journal of Operational Research, 215(1), 126-135. doi:10.1016/j.ejor.2011.06.006
199. Talbi, El-G. (Ed.). (1965). Metaheuristics: From design to implementation. Hoboken, NJ: John Wiley & Sons.
200. Tao, Q., Chang, H.-Y., Yi, Y., Gu, C.-Q., & Li, W.-J. (2011). A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow. Computers & Operations Research, 38(5), 824-836. doi:10.1016/j.cor.2010.09.012
201. Tasgetiren, M. F., Pan, Q.-K., Suganthan, P. N., & Chen, A. H.-L. (2010). A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences, 181(16), 3459-3475. doi:10.1016/j.ins.2011.04.018
202. Tavakkoli-Moghaddam, R., Safaei, N., & Gholipour, Y. (2006). A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation, 176(2), 445-454. doi:10.1016/j.amc.2005.09.040
203. Tavakkoli-Moghaddam, R., Safaei, N., Kah, M. M. O., & Rabbani, M. (2007). A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. Journal of the Franklin Institute, 344(5), 406-425. doi:10.1016/j.jfranklin.2005.12.002
204. Toksari, M. D. (2009). Estimating the net electricity energy generation and demand using the ant colony optimization approach: Case of Turkey. Energy Policy, 37(3), 1181-1187. doi:10.1016/j.enpol.2008.11.017
205. Trigueros, D. E. G., Módenes, A. N., Kroumov, A. D., & Espinoza-Quiñones, F. R. (2010). Modeling of biodegradation process of BTEX compounds: Kinetic parameters estimation by using particle swarm global optimizer. Process Biochemistry, 45(8), 1355-1361. doi:10.1016/j.procbio.2010.05.007
206. Uǧur, A., & Aydin, D. (2009). An interactive simulation and analysis software for solving tsp using ant colony optimization algorithms. Advances in Engineering Software, 40(5), 341-349. doi:10.1016/j.advengsoft.2008.05.004
207. Ünler, A. (2008). Improvement of energy demand forecasts using swarm intelligence: The case of Turkey with projections to 2025. Energy Policy, 36(6), 1937-1944. doi:10.1016/j.enpol.2008.02.018
208. Van Breedam, A. (1995). Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operational Research, 86(3), 480-490. doi:10.1016/0377-2217(94)00064-J
209. Varadharajan, T. K., & Rajendran, C. (2005). A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. European Journal of Operational Research, 167(3), 772-795. doi:10.1016/j.ejor.2004.07.020
210. Voß, S. (2001). Meta-heuristics: The state of the art. Lecture Notes in Computer Science, 2148, 1-23. doi:10.1007/3-540-45612-0_1
211. Wang, J., Cai, Y., Zhou, Y., Wang, R., & Li, C. (2011). Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems. Computers & Industrial Engineering, 60(4), 566-575. doi:10.1016/j.cie.2010.12.014
212. Wang, Q. J. (1991). The genetic algorithm and its application to calibrating conceptual rainfallrunoff models. Water Resources Research, 27(9), 2467-2471. doi:10.1029/91WR01305
213. Wang, T. Y., Wu, K. B., & Liu, Y. W. (2001). A simulated annealing algorithm for facility layout problems under variable demand in cellular manufacturing systems. Computers in Industry, 46(2), 181-188. doi:10.1016/S0166-3615(01)00107-5
214. Watanabe, K., & Hashem, M. M. A. (2004). Evolutionary computations - New algorithms and their applications to evolutionary robots. Studies in Fuzziness and Soft Computing. Berlin, Germany: Springer.
215. Weile, D. S., & Michielssen, E. (1997). Genetic algorithm optimization applied to electromagnetics: A review. IEEE Transactions on Antennas and Propagation, 45(3). doi:10.1109/8.558650
216. Wilson, W. G., & Vasudevan, K. (1991). Application of the genetic algorithm to residual statics estimation. Geophysical Research Letters, 18(12), 2118-2184. doi:10.1029/91GL02537
217. Xia, W., & Wu, Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48(2), 409-425. doi:10.1016/j.cie.2005.01.018
218. Xia, Y. (1996). A new neural network for solving linear programming problems and its application. IEEE Transactions on Neural Networks, 7(2).
219. Xinchao, Z. (2011). Simulated annealing algorithm with adaptive neighborhood. Applied Soft Computing, 11, 1827-1836. doi:10.1016/j.asoc.2010.05.029
220. Yagmahan, B. (2011). Mixed-model assembly line balancing using a multi-objective ant colony optimization approach. Expert Systems with Applications, 38(10), 12453-12461. doi:10.1016/j.eswa.2011.04.026
221. Yagmahan, B., & Yenisey, M. M. (2008). Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering, 54(3), 411-420. doi:10.1016/j.cie.2007.08.003
222. Yang, J., Shi, X., Marchese, M., & Liang, Y. (2008). An ant colony optimization method for generalized TSP problem. Progress in Natural Science, 18(11), 1417-1422. doi:10.1016/j.pnsc.2008.03.028
223. Yanxia, W., Longjun, Q., Zhi, G., & Lifeng, M. (2008). Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm. Journal of Systems Engineering and Electronics, 19(5), 939-944. doi:10.1016/S1004-4132(08)60179-6
224. Yaseen, S. G., & AL-Slamy, N. M. A. (2008). Ant colony optimization. IJCSNS International Journal of Computer Science and Network Security, 8(6), 351-357.
225. Yilmaz, I., & Yuksek, A. G. (2008). An example of artificial neural network (ANN) application for indirect estimation of rock parameters. Rock Mechanics and Rock Engineering, 41(5), 781-795. doi:10.1007/s00603-007-0138-7
226. Yin, P.-Y., Yu, S.-S., Wang, P.-P., & Wang, Y.-T. (2006). A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems. Computer Standards & Interfaces, 28(4), 441-450. doi:10.1016/j.csi.2005.03.005
227. Yu, B., & Yang, Z. Z. (2011). An ant colony optimization model: The period vehicle routing problem with time windows. Transportation Research Part E, Logistics and Transportation Review, 47(2), 166-181. doi:10.1016/j.tre.2010.09.010
228. Yu, V. F., Lin, S.-W., Lee, W., & Ting, C.-J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58(2), 288-299. doi:10.1016/j.cie.2009.10.007
229. Zarandi, M. H. F., Hemmati, A., & Davari, S. (2011). The multi-depot capacitated locationrouting problem with fuzzy travel times. Expert Systems with Applications, 38(8), 10075-10084. doi:10.1016/j.eswa.2011.02.006
230. Zegordi, S. H., Itoh, K., & Enkawa, T. (1995). Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge. European Journal of Operational Research, 85(3), 515-531. doi:10.1016/0377-2217(94)00021-4
231. Zhang, H., Li, X., Li, H., & Huang, F. (2005). Particle swarm optimization-based schemes for resource-constrained project scheduling. Automation in Construction, 14(3), 393-404. doi:10.1016/j.autcon.2004.08.006
232. Zhang, J.-R., Zhang, J., Lok, T.-M., & Lyu, M. R. (2007). A hybrid particle swarm optimization-back-propagation algorithm for feedforward neural network training. Applied Mathematics and Computation, 185(2), 1026-1037. doi:10.1016/j.amc.2006.07.025
233. Zhang, R., & Wu, C. (2010). A hybrid immune simulated annealing algorithm for the job shop scheduling problem. Applied Soft Computing, 10(1), 79-89. doi:10.1016/j.asoc.2009.06.008
234. Zhang, X., Yuan, X., & Yuan, Y. (2008). Improved hybrid simulated annealing algorithm for navigation scheduling for the two dams of the Three Gorges Project. Computers & Mathematics with Applications (Oxford, England), 56(1), 151-159. doi:10.1016/j.camwa.2007.11.041
235. Zhu, G., & Kwong, S. (2010). Gbest-guided artificial bee colony algorithm for numerical function optimization. Applied Mathematics and Computation, 217(7), 3166-3173. doi:10.1016/j.amc.2010.08.049
236. Ziarati, K., Akbari, R., & Zeighami, V. (2011). On the performance of bee algorithms for resource-constrained project scheduling problem. Applied Soft Computing, 11(4), 3720-3733. doi:10.1016/j.asoc.2011.02.002