{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:25:33Z","timestamp":1773761133858,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11277-022-09909-2","type":"journal-article","created":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T07:03:42Z","timestamp":1662015822000},"page":"3041-3059","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["An Improved Harmony Search Approach for Block Placement for VLSI Design Automation"],"prefix":"10.1007","volume":"127","author":[{"given":"Shaik","family":"Karimullah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Vishnuvardhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3820-2081","authenticated-orcid":false,"given":"Vidhyacharan","family":"Bhaskar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,1]]},"reference":[{"key":"9909_CR1","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, G., Periyasamy, S., & Rajamanickam, K. P. (2019). Minimization of test time in system on chip using artificial intelligence-based test scheduling techniques. Neural Computing and Applications,1\u201310","DOI":"10.1007\/s00521-019-04039-6"},{"key":"9909_CR2","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1016\/j.cma.2018.08.015","volume":"346","author":"C Wu","year":"2019","unstructured":"Wu, C., Fang, J., & Li, Q. (2019). Multi-material topology optimization for thermal buckling criteria. Computer Methods in Applied Mechanics and Engineering, 346, 1136\u20131155","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"9909_CR3","unstructured":"Sivasubramanian, K., & Jayanthi, K. B. (2015). Music-inspired harmony search algorithm for fixed outline non-slicing VLSI floorplanning. World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering, 9(6), 512\u2013519"},{"issue":"2","key":"9909_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0167-9260(99)00015-2","volume":"28","author":"BH Gwee","year":"1999","unstructured":"Gwee, B. H., & Lim, M. H. (1999). A GA with heuristic-based decoder for IC floorplanning. Integration, 28(2), 157\u2013172","journal-title":"Integration"},{"key":"9909_CR5","doi-asserted-by":"crossref","unstructured":"Shaik Karimullah, & D. Vishnu Vardhan (2022). Pin density technique for congestion estimation and reduction of optimized design during placement and routing. Applied Nanoscience.","DOI":"10.1007\/s13204-021-02173-z"},{"key":"9909_CR6","unstructured":"Fernando, P. R. (2009). Genetic algorithm based design and optimization of VLSI ASICs and reconfigurable hardware"},{"key":"9909_CR7","unstructured":"Grefenstette, J., Gopal, R., Rosmaita, B., & Van Gucht, D. (1985, July). Genetic algorithms for the traveling salesman problem. In Proceedings of the first International Conference on Genetic Algorithms and their Applications (Vol.\u00a0160, No. 168, pp.\u00a0160\u2013168). Lawrence Erlbaum"},{"key":"9909_CR8","unstructured":"Karimullah, S., & Vishnuvardhan, D.  (2018) A review paper on optimization of placement and routing techniques.  International Journal of Engineering and Techniques."},{"issue":"8","key":"9909_CR9","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1109\/43.511573","volume":"15","author":"M Rebaudengo","year":"1996","unstructured":"Rebaudengo, M., & Reorda, M. S. (1996). GALLO: A genetic algorithm for floorplan area optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(8), 943\u2013951","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"1","key":"9909_CR10","first-page":"311","volume":"10","author":"S Venkatraman","year":"2017","unstructured":"Venkatraman, S., & Sundhararajan, M. (2017). Optimization of VLSI floorplanning using genetic algorithm. J Chem Pharm Sci JCPS, 10(1), 311\u2013316","journal-title":"J Chem Pharm Sci JCPS"},{"key":"9909_CR11","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1007\/978-981-15-1420-3_197","volume-title":"ICDSMLA 2019","author":"S Karimullah","year":"2020","unstructured":"Karimullah, S., Vardhan, D. V., & Basha, S. J. (2020). Floorplanning for Placement of Modules in VLSI Physical Design Using Harmony Search Technique. ICDSMLA 2019 (pp. 1929\u20131936). Singapore: Springer"},{"key":"9909_CR12","unstructured":"Yang, X. S. (2010). Biology-derived algorithms in engineering optimization. arXiv preprint arXiv:1003.1888"},{"key":"9909_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.vlsi.2015.07.001","volume":"52","author":"J Funke","year":"2016","unstructured":"Funke, J., Hougardy, S., & Schneider, J. (2016). An exact algorithm for wirelength optimal placements in VLSI design. Integration, 52, 355\u2013366","journal-title":"Integration"},{"key":"9909_CR14","doi-asserted-by":"crossref","unstructured":"Kureychik, V., & Kulakov, A. (2017, December). Algorithm of Thermal Optimization of Placement of Basic Elements of VLSI. In IV International research conference\u201d Information technologies in Science, Management, Social sphere and Medicine (ITSMSSM 2017). Atlantis Press","DOI":"10.2991\/itsmssm-17.2017.14"},{"issue":"9","key":"9909_CR15","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/s42452-019-1116-x","volume":"1","author":"G Chandrasekaran","year":"2019","unstructured":"Chandrasekaran, G., Periyasamy, S., & Karthikeyan, P. R. (2019). Test scheduling for system on chip using modified firefly and modified ABC algorithms. SN Applied Sciences, 1(9), 1079","journal-title":"SN Applied Sciences"},{"key":"9909_CR16","doi-asserted-by":"crossref","unstructured":"Shaik Karimullah, S. J., Basha, P., Guruvyshnavi, K., & Sathish Kumar Reddy (2020). B Navyatha \u201dA Genetic Algorithm with Fixed Open Approach for Placements and Routings\u201d ICCCE (pp. 599\u2013610). Publisher Springer","DOI":"10.1007\/978-981-15-7961-5_58"},{"key":"9909_CR17","unstructured":"Vishnuvardhan, D. D., Shaik Karimullah\u201d Monitering Physiological Variables Of Mining Workers\u201d Ncetimes#1.0, Ijet Issn:2395-1303-2018"},{"key":"9909_CR18","unstructured":"Jeevitheswari, B., S. Karimullah, Vishnu Vardhan (2017). A Low Power DFT Based CMOS Receiver with Dual Use of Power Lines\u201d IJSETR 6(22), 4470\u20134475"},{"issue":"1","key":"9909_CR19","first-page":"311","volume":"10","author":"S venkatraman","year":"2017","unstructured":"venkatraman, S., & Sundhararajan, M. (2017). Particle Swarm Optimization Algorithm For VLSI Floorplanning Problem. J Chem Pharm Sci Jcps, 10(1), 311\u2013316","journal-title":"J Chem Pharm Sci Jcps"},{"issue":"6","key":"9909_CR20","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1109\/TSMCB.2012.2227469","volume":"43","author":"B Xue","year":"2012","unstructured":"Xue, B., Zhang, M., & Browne, W. N. (2012). Particle swarm optimization for feature selection in classification: A multi-objective approach. IEEE transactions on cybernetics, 43(6), 1656\u20131671","journal-title":"IEEE transactions on cybernetics"},{"key":"9909_CR21","doi-asserted-by":"crossref","unstructured":"Maji, K. B., Ghosh, A., Kar, R., Mandal, D., & Ghoshal, S. P. (2015, November). An evolutionary algorithm based approach for VLSI floor-planning. In 2015 International Conference on Science and Technology (TICST) (pp.\u00a0248\u2013253). IEEE","DOI":"10.1109\/TICST.2015.7369366"},{"key":"9909_CR22","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.procs.2017.12.107","volume":"125","author":"LL Laudis","year":"2018","unstructured":"Laudis, L. L., Shyam, S., Jemila, C., & Suresh, V. (2018). MOBA: multi objective bat algorithm for combinatorial optimization in VLSI. Procedia Computer Science, 125, 840\u2013846","journal-title":"Procedia Computer Science"},{"issue":"1","key":"9909_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.vlsi.2012.04.004","volume":"46","author":"S Basir-Kazeruni","year":"2013","unstructured":"Basir-Kazeruni, S., Yu, H., Gong, F., Hu, Y., Liu, C., & He, L. (2013). SPECO: Stochastic Perturbation based Clock tree Optimization considering temperature uncertainty. Integration, 46(1), 22\u201332","journal-title":"Integration"},{"key":"9909_CR24","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.asoc.2014.03.033","volume":"21","author":"P Yang","year":"2014","unstructured":"Yang, P., Yang, H., Qiu, W., Wang, S., & Li, C. (2014). Optimal approach on net routing for VLSI physical design based on Tabu-ant colonies modeling. Applied Soft Computing, 21, 376\u2013381","journal-title":"Applied Soft Computing"},{"issue":"4","key":"9909_CR25","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/j.isatra.2014.03.008","volume":"53","author":"S Ghosh","year":"2014","unstructured":"Ghosh, S., & Samanta, S. (2014). Fixed structure compensator design using a constrained hybrid evolutionary optimization approach. ISA transactions, 53(4), 1119\u20131130","journal-title":"ISA transactions"},{"key":"9909_CR26","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1007\/978-981-15-1420-3_199","volume-title":"ICDSMLA 2019","author":"S Karimullah","year":"2020","unstructured":"Karimullah, S., & Vishnuvardhan, D. (2020). Iterative Analysis of Optimization Algotithms for Placement and Routing in Asic Design. ICDSMLA 2019 (pp. 1947\u20131958). Singapore: Springer"},{"key":"9909_CR27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.vlsi.2016.12.006","volume":"58","author":"T Kourany","year":"2017","unstructured":"Kourany, T., Ghoneima, M., Hegazi, E., & Ismail, Y. (2017). Passiot: a pareto-optimal multi-objective optimization approach for synthesis of analog circuits using sobol\u2019indices-based engine. Integration, 58, 9\u201321","journal-title":"Integration"},{"key":"9909_CR28","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.vlsi.2017.03.006","volume":"58","author":"J Chen","year":"2017","unstructured":"Chen, J., Liu, Y., Zhu, Z., & Zhu, W. (2017). An adaptive hybrid memetic algorithm for thermal-aware non-slicing VLSI floorplanning. Integration, 58, 245\u2013252","journal-title":"Integration"},{"issue":"11","key":"9909_CR29","doi-asserted-by":"publisher","first-page":"3521","DOI":"10.1007\/s00034-015-0020-x","volume":"34","author":"P Sivaranjani","year":"2015","unstructured":"Sivaranjani, P., & Kumar, A. S. (2015). Thermal-aware non-slicing VLSI floorplanning using a smart decision-making PSO-GA based hybrid algorithm. Circuits Systems and Signal Processing, 34(11), 3521\u20133542","journal-title":"Circuits Systems and Signal Processing"},{"key":"9909_CR30","first-page":"908","volume-title":"Experimental Analysis of Optimization Techniques for Placement and Routing in ASIC Design. In ICDSMLA 2019","author":"S Karimullah","year":"2020","unstructured":"Karimullah, S., & Vishnuvardhan, D. (2020). Experimental Analysis of Optimization Techniques for Placement and Routing in ASIC Design. In ICDSMLA 2019 (pp. 908\u2013917). Singapore: Springer"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-022-09909-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-022-09909-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-022-09909-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T09:20:16Z","timestamp":1670577616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-022-09909-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,1]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["9909"],"URL":"https:\/\/doi.org\/10.1007\/s11277-022-09909-2","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,1]]},"assertion":[{"value":"15 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest\/Competing interests"}}]}}