{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:02:04Z","timestamp":1781298124295,"version":"3.54.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107554","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T06:55:23Z","timestamp":1779864923000},"page":"107554","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["List-based simulated annealing algorithm with novel encoding structure for the bounded diameter minimum spanning tree problem"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-2622-5712","authenticated-orcid":false,"given":"Fuyuan","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9742-986X","authenticated-orcid":false,"given":"Ning","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1766-974X","authenticated-orcid":false,"given":"Juan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiwen","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.cor.2026.107554_b1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1080\/00207160211289","article-title":"Random-tree diameter and the diameter-constrained MST","volume":"79","author":"Abdalla","year":"2002","journal-title":"Int. J. Comput. Math."},{"issue":"11","key":"10.1016\/j.cor.2026.107554_b2","doi-asserted-by":"crossref","first-page":"1977","DOI":"10.1007\/s00500-012-0869-6","article-title":"An adaptive heuristic to the bounded-diameter minimum spanning tree problem","volume":"16","author":"Akbari Torkestani","year":"2012","journal-title":"Soft Comput."},{"key":"10.1016\/j.cor.2026.107554_b3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s11235-013-9760-8","article-title":"A stable virtual backbone for wireless MANETS","volume":"55","author":"Akbari Torkestani","year":"2014","journal-title":"Telecommun. Syst."},{"issue":"1","key":"10.1016\/j.cor.2026.107554_b4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/s11263-013-0661-9","article-title":"Using bounded diameter minimum spanning trees to build dense active appearance models","volume":"110","author":"Anderson","year":"2014","journal-title":"Int. J. Comput. Vis."},{"key":"10.1016\/j.cor.2026.107554_b5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.asoc.2018.11.019","article-title":"Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems","volume":"75","author":"Ardjmand","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107554_b6","series-title":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","first-page":"3128","article-title":"A new hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem","author":"Binh","year":"2008"},{"issue":"4","key":"10.1016\/j.cor.2026.107554_b7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0306-4379(91)90030-D","article-title":"Compression of correlated bit-vectors","volume":"16","author":"Bookstein","year":"1991","journal-title":"Inf. Syst."},{"issue":"5","key":"10.1016\/j.cor.2026.107554_b8","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1007\/s10732-021-09481-1","article-title":"An adaptive large neighbourhood search algorithm for diameter bounded network design problems","volume":"27","author":"Garraffa","year":"2021","journal-title":"J. Heuristics"},{"issue":"3","key":"10.1016\/j.cor.2026.107554_b9","doi-asserted-by":"crossref","first-page":"2265","DOI":"10.1007\/s10462-019-09733-4","article-title":"A comprehensive survey on symbiotic organisms search algorithms","volume":"53","author":"Gharehchopogh","year":"2020","journal-title":"Artif. Intell. Rev."},{"issue":"3","key":"10.1016\/j.cor.2026.107554_b10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.10069","article-title":"Network flow models for designing diameter-constrained minimum-spanning and steiner trees","volume":"41","author":"Gouveia","year":"2003","journal-title":"Networks: Int. J."},{"issue":"1","key":"10.1016\/j.cor.2026.107554_b11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","article-title":"Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs","volume":"128","author":"Gouveia","year":"2011","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107554_b12","series-title":"Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation","first-page":"1187","article-title":"Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO","author":"Gruber","year":"2006"},{"issue":"1","key":"10.1016\/j.cor.2026.107554_b13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/1024022","article-title":"Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson)","volume":"24","author":"Hartmanis","year":"1982","journal-title":"SIAM Rev."},{"key":"10.1016\/j.cor.2026.107554_b14","series-title":"2025 Symposium on Simplicity in Algorithms","first-page":"341","article-title":"Simple length-constrained minimum spanning trees","author":"Hershkowitz","year":"2025"},{"key":"10.1016\/j.cor.2026.107554_b15","series-title":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","first-page":"215","article-title":"Simulated annealing algorithm for the bounded diameter minimum spanning tree problem","author":"Hong","year":"2023"},{"issue":"4","key":"10.1016\/j.cor.2026.107554_b16","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1093\/jigpal\/jzac028","article-title":"A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for the travelling salesman problem","volume":"31","author":"Ilin","year":"2023","journal-title":"Log. J. IGPL"},{"key":"10.1016\/j.cor.2026.107554_b17","article-title":"Greedy heuristics for the bounded diameter minimum spanning tree problem","volume":"14","author":"Julstrom","year":"2010","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"10.1016\/j.cor.2026.107554_b18","unstructured":"Julstrom, B., Raidl, G., 2003. A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Genetic and Evolutionary Computation Conference\u2019s Workshops Proceedings: Workshop on Analysis and Design of Representations. pp. 2\u20137."},{"issue":"3","key":"10.1016\/j.cor.2026.107554_b19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10898-009-9430-2","article-title":"A hybrid heuristic for the diameter constrained minimum spanning tree problem","volume":"46","author":"Lucena","year":"2010","journal-title":"J. Global Optim."},{"issue":"3","key":"10.1016\/j.cor.2026.107554_b20","first-page":"281","article-title":"Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem","volume":"39","author":"Patvardhan","year":"2015","journal-title":"Informatica"},{"key":"10.1016\/j.cor.2026.107554_b21","series-title":"International Conference on Mathematical Optimization Theory and Operations Research","first-page":"390","article-title":"Constructive heuristics for min-power bounded-hops symmetric connectivity problem","author":"Plotnikov","year":"2019"},{"issue":"6","key":"10.1016\/j.cor.2026.107554_b22","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"10.1016\/j.cor.2026.107554_b23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","article-title":"Edge sets: an effective evolutionary coding of spanning trees","volume":"7","author":"Raidl","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107554_b24","series-title":"Proceedings of the 2003 ACM Symposium on Applied Computing","first-page":"747","article-title":"Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem","author":"Raidl","year":"2003"},{"issue":"1","key":"10.1016\/j.cor.2026.107554_b25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","article-title":"A tree-based algorithm for distributed mutual exclusion","volume":"7","author":"Raymond","year":"1989","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.1016\/j.cor.2026.107554_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105822","article-title":"Finding bounded diameter minimum spanning tree in general graphs","volume":"144","author":"Segal","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"10.1016\/j.cor.2026.107554_b27","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1007\/s00500-006-0142-y","article-title":"Improved heuristics for the bounded diameter minimum spanning tree problem","volume":"11","author":"Singh","year":"2007","journal-title":"Soft Comput."},{"issue":"16","key":"10.1016\/j.cor.2026.107554_b28","doi-asserted-by":"crossref","first-page":"11289","DOI":"10.1007\/s00500-021-05913-z","article-title":"Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem","volume":"25","author":"Singh","year":"2021","journal-title":"Soft Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107554_b29","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1287\/ijoc.2014.0617","article-title":"New heuristic approaches for the bounded-diameter minimum spanning tree problem","volume":"27","author":"Steitz","year":"2015","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107554_b30","doi-asserted-by":"crossref","DOI":"10.1111\/exsy.12610","article-title":"Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem","volume":"38","author":"Vuppuluri","year":"2021","journal-title":"Expert Syst."},{"key":"10.1016\/j.cor.2026.107554_b31","doi-asserted-by":"crossref","first-page":"144366","DOI":"10.1109\/ACCESS.2019.2945570","article-title":"Enhanced list-based simulated annealing algorithm for large-scale traveling salesman problem","volume":"7","author":"Wang","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.cor.2026.107554_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101791","article-title":"Population-based simulated annealing algorithm for the min-degree constrained minimum spanning tree problem","volume":"92","author":"Wu","year":"2025","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107554_b33","article-title":"List-based simulated annealing algorithm for traveling salesman problem","volume":"2016","author":"Zhan","year":"2016","journal-title":"Comput. Intell. Neurosci."},{"key":"10.1016\/j.cor.2026.107554_b34","doi-asserted-by":"crossref","first-page":"54447","DOI":"10.1109\/ACCESS.2018.2872533","article-title":"List-based simulated annealing algorithm with hybrid greedy repair and optimization operator for 0\u20131 knapsack problem","volume":"6","author":"Zhan","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.cor.2026.107554_b35","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","article-title":"Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem","volume":"42","author":"Zhong","year":"2018","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107554_b36","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.swevo.2019.04.002","article-title":"Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem","volume":"48","author":"Zhong","year":"2019","journal-title":"Swarm Evol. Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001723?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001723?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:38:33Z","timestamp":1781296713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":36,"alternative-id":["S0305054826001723"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107554","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"List-based simulated annealing algorithm with novel encoding structure for the bounded diameter minimum spanning tree problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107554","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107554"}}