Full Length Research Paper
References
|
Panduro M, Mendez A, Dominguez R, Romero G (2006). Design of non-uniform circular antenna arrays for side lobe reduction using the method of genetic algorithms, Int. J. Electron. Commun. (AEU) 60:713-717. Crossref |
||||
| Balanis CA (1997). Antenna Theory: Analysis and Design, John Wiley & Sons, New York. | ||||
| Shihab M, Najjar Y, Dib N, Khodier M (2008). Design of non -uniform circular antenna arrays using particle swarm optimization, J. Elect. Eng. 59(4):216-220. | ||||
|
Dessouky M, Sharshar H, Albagory Y (2006). Efficient Side lobe Reduction Technique For Small-Sized Concentric Circular Arrays, Progress In Electromagnetics Res. PIER 65:187-200. Crossref |
||||
|
Granville V, Krivanek M, Rasson JP (1994). Simulated annealing, A proof of convergence, IEEE Transactions On Pattern Analysis and Machine Intelligence, 16:652. Crossref |
||||
|
Locatelli M (2001).Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. Math. Methods. Oper. Res. 54:171-199. Crossref |
||||
|
Ingber L (1993). Simulated annealing: practice versus theory, J. Math. Comput. Model.18(11):29-57. Crossref |
||||
|
Aydin ME, Fogarty TC (2004). A distributed evolutionary simulated annealingalgorithm for combinatorial optimisation problems, J. Heuristics 10:269-292. Crossref |
||||
|
Low CY (2005). Simulated annealing heuristic forflowshop scheduling problems withunrelated parallel machines, Comput. Operat. Res. 32:2013-2025. Crossref |
||||
| Burke EK, Eckersley A, McCollum B (2003). Using simulated annealing to studybehaviour of various exam timetabling data sets, in: Proceedings of the Fifth Meta heuristics Int. Conference (MIC 2003), Kyoto, Japan, August. | ||||
| Framinana JM, Schusterb C (2006). An enhanced timetabling procedure for the nowait job shop problem: a complete local search approach, Comput. OperationsRes. 331:1200–1213. | ||||
|
Cerny V (1985). A thermodynamical approach to the travelling salesman problem: anefficient simulation algorithm, J. Optimization Theory Appl. 45:41-51. Crossref |
||||
|
Lin S, Kernighan BW (1973). An effective heuristic algorithm for the traveling salesman problem, Operations Res. 21(2):498-516. Crossref |
||||
|
Salcedo-Sanz S, Santiago-Mozos R, Bousono-Calzon C (2004). A hybrid hopfieldnetwork-simulated annealing approach for frequency assignment in satellitecommunications systems, IEEE Trans. Syst. Man Cybernet. Part B: Cybernet. 34(2):1108-1116. Crossref |
||||
|
Paik CH, Soni S (2007). A simulated annealing based solution approach for the two layered location registration and paging areas partitioning problem in cellularmobile networks, Eur. J. Operat. Res. 178:579-594. Crossref |
||||
|
Locatelli M (2000). Convergence of a simulated annealing algorithm for continuousglobal optimization, J. Global Optimization 18:219–234. Crossref |
||||
|
Smith K, Palaniswami M, Krishnamoorthy M (1998). "Neural techniques for combinatorial optimization with applications," Neural Networks, IEEE Transactions on, 9:1301-1318. Crossref |
||||
|
Koulmas AC, Antony SR, Jaen R (1994). A survey of simulated annealing applications to operations research problems, Omega, 22:41. Crossref |
||||
|
Kirkpatrick S, Gelatt CD, Vecchi MP (1983). Optimization by simulated annealing, Science 220(4598):671-680. Crossref |
||||
|
Pathak NN, Mahanti GK, Singh SK, Mishra JK, Chakraborty A (2009). "Synthesis of thinned planar circular array antennas using modified particle swarm optimization," Progress In Electromagnetics Res. Lett. 12:87-97. Crossref |
||||
Copyright © 2024 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0
