?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F465%2F&rft.title=Ant+Colony+Based+Hybrid+Approach+for+Optimal+Compromise+Sum-Difference+Patterns+Synthesis&rft.creator=Rocca%2C+Paolo&rft.creator=Manica%2C+Luca&rft.creator=Massa%2C+Andrea&rft.subject=TU+Technical+Reports+and+Publications&rft.description=Dealing+with+the+synthesis+of+monopulse+array+antennas%2C+many+stochastic+optimization+algorithms+have+been+used+for+the+solution+of+the+so-called+optimal+compromise+problem+between+sum+and+difference+patterns+when+sub-arrayed+feed+networks+are+considered.+More+recently%2C+hybrid+approaches%2C+exploiting+the+convexity+of+the+functional+with+respect+to+a+sub-set+of+the+unknowns+(i.e.%2C+the+sub-array+excitation+coefficients)+have+demonstrated+their+effectiveness.+In+this+letter%2C+an+hybrid+approach+based+on+the+Ant+Colony+Optimization+(ACO)+is+proposed.+At+the+first+step%2C+the+ACO+is+used+to+define+the+sub-array+membership+of+the+array+elements%2C+while%2C+at+the+second+step%2C+the+sub-array+weights+are+computed+by+solving+a+convex+programming+problem.+The+definitive+version+is+available+at+www3.interscience.wiley.com&rft.date=2010-01&rft.type=Technical+Report&rft.type=PeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F465%2F1%2FDISI-11-020.pdf&rft.identifier=++Rocca%2C+Paolo+and+Manica%2C+Luca+and+Massa%2C+Andrea++(2010)+Ant+Colony+Based+Hybrid+Approach+for+Optimal+Compromise+Sum-Difference+Patterns+Synthesis.++%5BTechnical+Report%5D+++++