{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T07:44:14Z","timestamp":1777880654809,"version":"3.51.4"},"reference-count":65,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["102.01-2025.69"],"award-info":[{"award-number":["102.01-2025.69"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.knosys.2026.115595","type":"journal-article","created":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T00:24:50Z","timestamp":1771633490000},"page":"115595","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["ALSB : A problem-aware hybrid optimization framework for k-Coverage and k-connectivity in wireless sensor networks"],"prefix":"10.1016","volume":"339","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6579-3983","authenticated-orcid":false,"given":"Quan","family":"La Van","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7129-4833","authenticated-orcid":false,"given":"Thai","family":"Tran Quoc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6700-1477","authenticated-orcid":false,"given":"Cuong","family":"Van Duc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9141-7409","authenticated-orcid":false,"given":"Minh","family":"Nguyen Dinh Tuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8188-4984","authenticated-orcid":false,"given":"Son","family":"Nguyen Van","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7929-3329","authenticated-orcid":false,"given":"Hanh","family":"Nguyen Thi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1976-6113","authenticated-orcid":false,"given":"Binh","family":"Huynh Thi Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.115595_bib0001","series-title":"2020 7th International Conference on Smart Structures and Systems (ICSSS)","first-page":"1","article-title":"Analysis of QoS for conveying authorisation based on internet of things (IoT) in wireless sensor networks (WSN)","author":"Prakash","year":"2020"},{"key":"10.1016\/j.knosys.2026.115595_bib0002","series-title":"2020 International Conference on Electrical Engineering (ICEE)","first-page":"1","article-title":"A new IoT application for dynamic WiFi based wireless sensor network","author":"Ertam","year":"2020"},{"key":"10.1016\/j.knosys.2026.115595_bib0003","series-title":"Proceedings of the UGC Sponsored National Conference on Advanced Networking and Applications","first-page":"19","article-title":"Challenges of wireless sensor networks and issues associated with time synchronization","author":"Karthik","year":"2015"},{"key":"10.1016\/j.knosys.2026.115595_bib0004","series-title":"Coverage Control in Sensor Networks","author":"Wang","year":"2010"},{"issue":"4","key":"10.1016\/j.knosys.2026.115595_bib0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1978802.1978811","article-title":"Coverage problems in sensor networks: a survey","volume":"43","author":"Wang","year":"2011","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0006","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/JCN.2019.000005","article-title":"Coverage protocols for wireless sensor networks: review and future directions","volume":"21","author":"Elhabyan","year":"2019","journal-title":"J. Commun. Netw."},{"key":"10.1016\/j.knosys.2026.115595_bib0007","series-title":"2011 Seventh International Conference on Mobile Ad-hoc and Sensor Networks","first-page":"408","article-title":"Target coverage in wireless sensor networks","author":"Yu","year":"2011"},{"issue":"2","key":"10.1016\/j.knosys.2026.115595_bib0008","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1080\/09720529.2020.1729511","article-title":"Target K-coverage problem in wireless sensor networks","volume":"23","author":"Manju","year":"2020","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"10.1016\/j.knosys.2026.115595_bib0009","article-title":"A genetic algorithm-based approach for solving the target Q-coverage problem in over and under provisioned directional sensor networks","volume":"54","author":"allah Mottaki","year":"2022","journal-title":"Phys. Commun."},{"issue":"3","key":"10.1016\/j.knosys.2026.115595_bib0010","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.pmcj.2008.02.001","article-title":"Coverage and connectivity issues in wireless sensor networks: a survey","volume":"4","author":"Ghosh","year":"2008","journal-title":"Pervasive Mob. Comput."},{"key":"10.1016\/j.knosys.2026.115595_bib0011","unstructured":"M. Michalik, Base station for wireless sensor network, Diss. Masarykova univerzita, Fakulta informatiky(2013)."},{"issue":"3","key":"10.1016\/j.knosys.2026.115595_bib0012","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1109\/MNET.124.2100767","article-title":"K-connectivity in wireless sensor networks: overview and future research directions","volume":"37","author":"Dagdeviren","year":"2022","journal-title":"IEEE Netw."},{"key":"10.1016\/j.knosys.2026.115595_bib0013","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2022.103578","article-title":"Node placement optimization under Q-Coverage and Q-connectivity constraints in wireless sensor networks","volume":"212","author":"Hanh","year":"2023","journal-title":"J. Netw. Comput. Appl."},{"issue":"2","key":"10.1016\/j.knosys.2026.115595_bib0014","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/261342.571216","article-title":"Approximation algorithms for NP-hard problems","volume":"28","author":"Hochba","year":"1997","journal-title":"ACM Sigact News"},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0015","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/230514.571645","article-title":"Introduction to the theory of computation","volume":"27","author":"Sipser","year":"1996","journal-title":"ACM Sigact News"},{"issue":"01","key":"10.1016\/j.knosys.2026.115595_bib0016","article-title":"Solving the k-coverage and m-connected problem in wireless sensor networks through the imperialist competitive algorithm","volume":"20","author":"Sheikhi","year":"2020","journal-title":"J. Interconnection Netw."},{"key":"10.1016\/j.knosys.2026.115595_bib0017","series-title":"2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT)","first-page":"607","article-title":"Irregular honeycomb network: revolutionizing k-Coverage in spatial wireless sensor networks","author":"Maddala","year":"2024"},{"key":"10.1016\/j.knosys.2026.115595_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.compag.2021.106120","article-title":"Corn cash price forecasting with neural networks","volume":"184","author":"Xu","year":"2021","journal-title":"Comput. Electron. Agric."},{"issue":"6","key":"10.1016\/j.knosys.2026.115595_bib0019","doi-asserted-by":"crossref","first-page":"1927","DOI":"10.1108\/JM2-12-2023-0315","article-title":"Pre-owned housing price index forecasts using Gaussian process regressions","volume":"19","author":"Jin","year":"2024","journal-title":"J. Modell. Manage."},{"issue":"3","key":"10.1016\/j.knosys.2026.115595_bib0020","first-page":"398","article-title":"Contemporaneous causal orderings among prices of retail properties: evidence from Chinese cities through vector error-correction modeling and directed acyclic graphs","volume":"30","author":"Jin","year":"2025","journal-title":"J. Financ. Manage. Property Constr."},{"key":"10.1016\/j.knosys.2026.115595_bib0021","article-title":"Individual time series and composite forecasting of the Chinese stock index","volume":"5","author":"Xu","year":"2021","journal-title":"Mach. Learn. Appl."},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0022","first-page":"7","article-title":"Metaheuristic algorithms in optimization and its application: a review","volume":"6","author":"Kareem","year":"2022","journal-title":"JAREE J. Adv. Res. Electr. Eng."},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0023","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0024","first-page":"01","article-title":"Application of simulated annealing in various field","volume":"1","author":"Venkateswaran","year":"2022","journal-title":"Mater. Charact."},{"key":"10.1016\/j.knosys.2026.115595_bib0025","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.plrev.2024.09.014","article-title":"Ant colony optimization: a bibliometric review","volume":"51","author":"Blum","year":"2024","journal-title":"Phys. Life Rev."},{"key":"10.1016\/j.knosys.2026.115595_bib0026","series-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"issue":"4598","key":"10.1016\/j.knosys.2026.115595_bib0027","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.knosys.2026.115595_bib0028","series-title":"Evolutionary Algorithms","author":"P\u00e9trowski","year":"2017"},{"key":"10.1016\/j.knosys.2026.115595_bib0029","series-title":"Artificial Neural Networks: An Introduction to ANN Theory and Practice","first-page":"157","article-title":"Local Search in Combinatorial Optimization","author":"Crama","year":"2005"},{"key":"10.1016\/j.knosys.2026.115595_bib0030","series-title":"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","first-page":"1470","article-title":"Ant colony optimization: a new meta-heuristic","volume":"2","author":"Dorigo","year":"1999"},{"issue":"5","key":"10.1016\/j.knosys.2026.115595_bib0031","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TC.2007.1019","article-title":"Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is NP-complete","volume":"56","author":"Ke","year":"2007","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/j.knosys.2026.115595_bib0032","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.comnet.2011.03.004","article-title":"The critical-square-grid coverage problem in wireless sensor networks is NP-complete","volume":"55","author":"Ke","year":"2011","journal-title":"Comput. Netw."},{"key":"10.1016\/j.knosys.2026.115595_bib0033","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120160","article-title":"A machine learning approach to predict the k-coverage probability of wireless multihop networks considering boundary and shadowing effects","volume":"226","author":"Nagar","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.knosys.2026.115595_bib0034","article-title":"Optimizing wireless sensor network lifetime through K-coverage maximization and memetic search","volume":"40","author":"Hanh","year":"2023","journal-title":"Sustainable Comput. Inf. Syst."},{"key":"10.1016\/j.knosys.2026.115595_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124878","article-title":"Optimizing k-coverage in energy-saving wireless sensor networks based on the elite global growth optimizer","volume":"256","author":"Chen","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.knosys.2026.115595_bib0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110609","article-title":"Discrete grey wolf optimization algorithm for solving k-coverage problem in directional sensor networks with network lifetime maximization viewpoint","volume":"146","author":"Ekhlas","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.knosys.2026.115595_bib0037","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3713074","article-title":"Hierarchical deployment and square tessellation for connected k-Coverage in heterogeneous planar wireless sensor networks","volume":"21","author":"Nakka","year":"2025","journal-title":"ACM Trans. Sens. Netw."},{"issue":"1-2","key":"10.1016\/j.knosys.2026.115595_bib0038","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3547145","article-title":"A collective adaptive approach to decentralised k-coverage in multi-robot systems","volume":"17","author":"Pianini","year":"2022","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"10.1016\/j.knosys.2026.115595_bib0039","series-title":"Ambient Communications and Computer Systems: RACCCS-2018","first-page":"3","article-title":"EERP: energy-efficient relay node placement for k-connected wireless sensor networks using genetic algorithm","author":"Srivastava","year":"2019"},{"issue":"23","key":"10.1016\/j.knosys.2026.115595_bib0040","doi-asserted-by":"crossref","first-page":"24444","DOI":"10.1109\/JIOT.2022.3188558","article-title":"On the tradeoff between network lifetime and k-connectivity-based reliability in UWSNs","volume":"9","author":"Cobanlar","year":"2022","journal-title":"IEEE Internet Things J."},{"issue":"22","key":"10.1016\/j.knosys.2026.115595_bib0041","doi-asserted-by":"crossref","first-page":"47817","DOI":"10.1109\/JIOT.2025.3603829","article-title":"Mitigating energy cost of connection reliability in UWSNs through non-uniform k-Connectivity","volume":"12","author":"Karagul","year":"2025","journal-title":"IEEE Internet Things J."},{"issue":"19","key":"10.1016\/j.knosys.2026.115595_bib0042","doi-asserted-by":"crossref","first-page":"6418","DOI":"10.3390\/s21196418","article-title":"PINC: pickup non-critical node based k-connectivity restoration in wireless sensor networks","volume":"21","author":"Khalilpour Akram","year":"2021","journal-title":"Sensors"},{"key":"10.1016\/j.knosys.2026.115595_bib0043","doi-asserted-by":"crossref","DOI":"10.1016\/j.csi.2024.103941","article-title":"Enhancing drone network resilience: investigating strategies for k-connectivity restoration","volume":"92","author":"Asci","year":"2025","journal-title":"Comput. Stand. Interfaces"},{"issue":"5","key":"10.1016\/j.knosys.2026.115595_bib0044","doi-asserted-by":"crossref","first-page":"1712","DOI":"10.3390\/s22051712","article-title":"Area coverage maximization under connectivity constraint in wireless sensor networks","volume":"22","author":"Tossa","year":"2022","journal-title":"Sensors"},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0045","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-025-00184-2","article-title":"Coverage and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization","volume":"15","author":"Shaikh","year":"2025","journal-title":"Sci. Rep."},{"key":"10.1016\/j.knosys.2026.115595_bib0046","doi-asserted-by":"crossref","DOI":"10.1016\/j.adhoc.2023.103353","article-title":"An energy-efficient irregular hexagonal tessellation-based approach for connected k-coverage in planar wireless sensor networks","volume":"154","author":"Nakka","year":"2024","journal-title":"Ad Hoc Netw."},{"issue":"23","key":"10.1016\/j.knosys.2026.115595_bib0047","doi-asserted-by":"crossref","first-page":"4841","DOI":"10.3390\/electronics13234841","article-title":"Particle swarm optimization for k-coverage and 1-connectivity in wireless sensor networks","volume":"13","author":"Siamantas","year":"2024","journal-title":"Electronics"},{"key":"10.1016\/j.knosys.2026.115595_bib0048","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2022.107959","article-title":"A new and reliable intelligent model for deployment of sensor nodes for IoT applications","volume":"101","author":"Dash","year":"2022","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.knosys.2026.115595_bib0049","series-title":"IFIP International Conference on Network and Parallel Computing","first-page":"478","article-title":"Constructing k-connected k-cover set in wireless sensor networks based on self-pruning","author":"Jiang","year":"2005"},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0050","doi-asserted-by":"crossref","first-page":"7","DOI":"10.31449\/inf.v49i1.6750","article-title":"Memetic algorithm for maximizing K-coverage and K-connectivity in wireless sensors network","volume":"49","author":"Nguyen","year":"2025","journal-title":"Informatica"},{"key":"10.1016\/j.knosys.2026.115595_bib0051","series-title":"IEEE Symposium Series on Computational Intelligence (SSCI)","article-title":"Node placement optimization under K-Coverage and K-Connectivity constraints in wireless sensor networks","author":"Hanh","year":"2022"},{"issue":"3","key":"10.1016\/j.knosys.2026.115595_bib0052","first-page":"208","article-title":"Using simulated annealing and ant-colony optimization algorithms to solve the scheduling problem","volume":"1","author":"Chmait","year":"2013","journal-title":"Comput. Sci. Inf. Technol."},{"key":"10.1016\/j.knosys.2026.115595_bib0053","first-page":"1","article-title":"Simulated annealing: from basics to applications","author":"Delahaye","year":"2019","journal-title":"Handb. Metaheuristics"},{"issue":"5","key":"10.1016\/j.knosys.2026.115595_bib0054","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/0952-1976(96)00049-8","article-title":"Adaptive simulated annealing genetic algorithm for system identification","volume":"9","author":"Jeong","year":"1996","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0055","doi-asserted-by":"crossref","DOI":"10.1155\/2018\/1453898","article-title":"A genetic simulated annealing algorithm to optimize the small-world network generating process","volume":"2018","author":"Du","year":"2018","journal-title":"Complexity"},{"issue":"8","key":"10.1016\/j.knosys.2026.115595_bib0056","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1080\/0020739X.2015.1036947","article-title":"An algebraic approach to finding the Fermat\u2013Torricelli point","volume":"46","author":"Palacios-V\u00e9lez","year":"2015","journal-title":"Int. J. Math. Educ. Sci. Technol."},{"issue":"490","key":"10.1016\/j.knosys.2026.115595_bib0057","doi-asserted-by":"crossref","first-page":"37","DOI":"10.2307\/3618766","article-title":"The Fermat-Torricelli problem once more","volume":"81","author":"Eriksson","year":"1997","journal-title":"Math. Gaz."},{"issue":"3","key":"10.1016\/j.knosys.2026.115595_bib0058","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1080\/0020739X.2014.979894","article-title":"Fermat\u2019s point from five perspectives","volume":"46","author":"Park","year":"2015","journal-title":"Int. J. Math. Educ. Sci. Technol."},{"issue":"5","key":"10.1016\/j.knosys.2026.115595_bib0059","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1080\/0025570X.1997.11996577","article-title":"On the Fermat-Torricelli points of tetrahedra and of higher dimensional simplexes","volume":"70","author":"Abu-Saymeh","year":"1997","journal-title":"Math. Mag.e"},{"key":"10.1016\/j.knosys.2026.115595_bib0060","series-title":"The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics","author":"Grimwood","year":"1994"},{"key":"10.1016\/j.knosys.2026.115595_bib0061","doi-asserted-by":"crossref","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","article-title":"An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem","volume":"7","author":"Deng","year":"2019","journal-title":"IEEE Access"},{"issue":"4","key":"10.1016\/j.knosys.2026.115595_bib0062","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1007\/s40747-020-00138-3","article-title":"Improving ant colony optimization algorithm with epsilon greedy and Levy flight","volume":"7","author":"Liu","year":"2021","journal-title":"Complex Intell. Syst."},{"issue":"9","key":"10.1016\/j.knosys.2026.115595_bib0063","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0257317","article-title":"An improved ant colony optimization algorithm based on context for tourism route planning","volume":"16","author":"Liang","year":"2021","journal-title":"PLoS ONE"},{"issue":"1","key":"10.1016\/j.knosys.2026.115595_bib0064","article-title":"An improved ant colony optimization based on an adaptive heuristic factor for the traveling salesman problem","volume":"2021","author":"Du","year":"2021","journal-title":"J. Adv. Transp."},{"key":"10.1016\/j.knosys.2026.115595_bib0065","series-title":"2021 2nd International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)","first-page":"87","article-title":"Improved ant colony algorithm based on parameters optimization for AGV path planning","author":"Yang","year":"2021"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126003357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126003357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:17:50Z","timestamp":1777594670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126003357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":65,"alternative-id":["S0950705126003357"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115595","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"ALSB : A problem-aware hybrid optimization framework for k-Coverage and k-connectivity in wireless sensor networks","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115595","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115595"}}