{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:24:42Z","timestamp":1768537482154,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T00:00:00Z","timestamp":1715817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T00:00:00Z","timestamp":1715817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21B2029"],"award-info":[{"award-number":["U21B2029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51825502"],"award-info":[{"award-number":["51825502"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10479-024-06039-9","type":"journal-article","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T13:01:56Z","timestamp":1715864516000},"page":"925-945","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A uniform sampling method for permutation space"],"prefix":"10.1007","volume":"338","author":[{"given":"Lin","family":"Gui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3730-0360","authenticated-orcid":false,"given":"Xinyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,16]]},"reference":[{"issue":"3","key":"6039_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.6092\/issn.1973-2201\/8930","volume":"79","author":"C Aidara","year":"2019","unstructured":"Aidara, C. (2019). Quasi random resampling designs for multiple frame surveys. Statistica, 79(3), 321\u2013338. https:\/\/doi.org\/10.6092\/issn.1973-2201\/8930","journal-title":"Statistica"},{"key":"6039_CR2","doi-asserted-by":"publisher","first-page":"101319","DOI":"10.1016\/j.softx.2023.101319","volume":"21","author":"L Akritidis","year":"2023","unstructured":"Akritidis, L., Alamaniotis, M., & Bozanis, P. (2023). FLAGR: A flexible high-performance library for rank aggregation. SoftwareX, 21, 101319. https:\/\/doi.org\/10.1016\/j.softx.2023.101319","journal-title":"SoftwareX"},{"issue":"16","key":"6039_CR3","doi-asserted-by":"publisher","first-page":"11209","DOI":"10.1007\/s00500-021-05886-z","volume":"25","author":"HY Chong","year":"2021","unstructured":"Chong, H. Y., Yap, H. J., Tan, S. C., Yap, K. S., & Wong, S. Y. (2021). Advances of metaheuristic algorithms in training neural networks for industrial applications. Soft Computing, 25(16), 11209\u201311233. https:\/\/doi.org\/10.1007\/s00500-021-05886-z","journal-title":"Soft Computing"},{"issue":"1","key":"6039_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.matcom.2005.03.004","volume":"70","author":"H Chi","year":"2005","unstructured":"Chi, H., Mascagni, M., & Warnock, T. (2005). On the optimal Halton sequence. Mathematics and Computers in Simulation, 70(1), 9\u201321. https:\/\/doi.org\/10.1016\/j.matcom.2005.03.004","journal-title":"Mathematics and Computers in Simulation"},{"key":"6039_CR5","doi-asserted-by":"publisher","unstructured":"Cicirello, V. A. (2022). On fitness landscape analysis of permutation problems: From distance metrics to mutation operator selection. Mobile Networks and Applications, 1\u201311. https:\/\/doi.org\/10.1007\/s11036-022-02060-z.","DOI":"10.1007\/s11036-022-02060-z"},{"key":"6039_CR6","doi-asserted-by":"publisher","first-page":"101645","DOI":"10.1016\/j.jco.2022.101645","volume":"70","author":"F Cl\u00e9ment","year":"2022","unstructured":"Cl\u00e9ment, F., Doerr, C., & Paquete, L. (2022). Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions. Journal of Complexity, 70, 101645. https:\/\/doi.org\/10.1016\/j.jco.2022.101645","journal-title":"Journal of Complexity"},{"key":"6039_CR7","doi-asserted-by":"publisher","unstructured":"Deshwal, A., Belakaria, S., Doppa, J. R., & Kim, D. H. (2022). Bayesian optimization over permutation spaces. In Proceedings of the AAAI conference on artificial intelligence, 36(6), 6515\u20136523. https:\/\/doi.org\/10.1609\/aaai.v36i6.20604.","DOI":"10.1609\/aaai.v36i6.20604"},{"key":"6039_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00234-2","volume-title":"Encyclopedia of distances","author":"MM Deza","year":"2009","unstructured":"Deza, M. M., & Deza, E. (2009). Encyclopedia of distances (pp. 1\u2013583). Springer."},{"issue":"3","key":"6039_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1080\/00401706.2000.10486045","volume":"42","author":"KT Fang","year":"2000","unstructured":"Fang, K. T., Lin, D. K., Winker, P., & Zhang, Y. (2000). Uniform design: Theory and application. Technometrics, 42(3), 237\u2013248. https:\/\/doi.org\/10.1080\/00401706.2000.10486045","journal-title":"Technometrics"},{"key":"6039_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.inffus.2018.12.002","volume":"51","author":"A Hafezalkotob","year":"2019","unstructured":"Hafezalkotob, A., Liao, H., & Herrera, F. (2019). An overview of MULTIMOORA for multi-criteria decision-making: Theory, developments, applications, and challenges. Information Fusion, 51, 145\u2013177. https:\/\/doi.org\/10.1016\/j.inffus.2018.12.002","journal-title":"Information Fusion"},{"key":"6039_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10479-019-03412-x","volume":"289","author":"M Hassoun","year":"2020","unstructured":"Hassoun, M., Shoval, S., Simchon, E., & Yedidsion, L. (2020). The single line moving target traveling salesman problem with release times. Annals of Operations Research, 289, 449\u2013458. https:\/\/doi.org\/10.1007\/s10479-019-03412-x","journal-title":"Annals of Operations Research"},{"key":"6039_CR12","unstructured":"Irurozki, E. (2014). Sampling and learning distance-based probability models for permutation spaces (Doctoral dissertation)."},{"issue":"7","key":"6039_CR13","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1109\/tpami.2017.2719680","volume":"40","author":"Y Jiao","year":"2017","unstructured":"Jiao, Y., & Vert, J. P. (2017). The Kendall and Mallows kernels for permutations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(7), 1755\u20131769. https:\/\/doi.org\/10.1109\/tpami.2017.2719680","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6039_CR14","doi-asserted-by":"publisher","unstructured":"Kazimipour, B., Li, X., & Qin, A. K. (2014). A review of population initialization techniques for evolutionary algorithms. CEC 2014 (Institute of Electrical and Electronics Engineers, Beijing), 2585\u20132592. https:\/\/doi.org\/10.1109\/CEC.2014.6900618.","DOI":"10.1109\/CEC.2014.6900618"},{"key":"6039_CR15","doi-asserted-by":"publisher","first-page":"106193","DOI":"10.1016\/j.asoc.2020.106193","volume":"91","author":"Q Li","year":"2020","unstructured":"Li, Q., Liu, S. Y., & Yang, X. S. (2020). Influence of initialization on the performance of metaheuristic optimizers. Applied Soft Computing, 91, 106193. https:\/\/doi.org\/10.1016\/j.asoc.2020.106193","journal-title":"Applied Soft Computing"},{"key":"6039_CR16","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ins.2013.04.015","volume":"241","author":"KM Malan","year":"2013","unstructured":"Malan, K. M., & Engelbrecht, A. P. (2013). A survey of techniques for characterising fitness landscapes and some possible ways forward. Information Sciences, 241, 148\u2013163. https:\/\/doi.org\/10.1016\/j.ins.2013.04.015","journal-title":"Information Sciences"},{"issue":"12","key":"6039_CR17","doi-asserted-by":"publisher","first-page":"1885","DOI":"10.1016\/j.camwa.2003.07.011","volume":"47","author":"H Maaranen","year":"2004","unstructured":"Maaranen, H., Miettinen, K., & M\u00e4kel\u00e4, M. M. (2004). Quasi-random initial population for genetic algorithms. Computers & Mathematics with Applications, 47(12), 1885\u20131895. https:\/\/doi.org\/10.1016\/j.camwa.2003.07.011","journal-title":"Computers & Mathematics with Applications"},{"key":"6039_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/A:1018979424002","volume":"86","author":"DC Mattfeld","year":"1999","unstructured":"Mattfeld, D. C., Bierwirth, C., & Kopfer, H. (1999). A search space analysis of the job shop scheduling problem. Annals of Operations Research, 86, 441\u2013453. https:\/\/doi.org\/10.1023\/A:1018979424002","journal-title":"Annals of Operations Research"},{"issue":"6","key":"6039_CR19","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1137\/0915077","volume":"15","author":"WJ Morokoff","year":"1994","unstructured":"Morokoff, W. J., & Caflisch, R. E. (1994). Quasi-random sequences and their discrepancies. SIAM Journal on Scientific Computing, 15(6), 1251\u20131279. https:\/\/doi.org\/10.1137\/0915077","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"6039_CR20","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/TFUZZ.2020.2979119","volume":"29","author":"M Orouskhani","year":"2020","unstructured":"Orouskhani, M., Shi, D., & Cheng, X. (2020). A fuzzy adaptive dynamic NSGA-II with fuzzy-based borda ranking method and its application to multimedia data analysis. IEEE Transactions on Fuzzy Systems, 29(1), 118\u2013128. https:\/\/doi.org\/10.1109\/TFUZZ.2020.2979119","journal-title":"IEEE Transactions on Fuzzy Systems"},{"issue":"1","key":"6039_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0377-0427(92)90051-X","volume":"44","author":"G Pag\u00e8s","year":"1992","unstructured":"Pag\u00e8s, G. (1992). Van der Corput sequences, Kakutani transforms and one-dimensional numerical integration. Journal of Computational and Applied Mathematics, 44(1), 21\u201339. https:\/\/doi.org\/10.1016\/0377-0427(92)90051-X","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"6039_CR22","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10479-017-2560-x","volume":"261","author":"NEH Tellache","year":"2018","unstructured":"Tellache, N. E. H., & Boudhar, M. (2018). Flow shop scheduling problem with conflict graphs. Annals of Operations Research, 261, 339\u2013363. https:\/\/doi.org\/10.1007\/s10479-017-2560-x","journal-title":"Annals of Operations Research"},{"issue":"1","key":"6039_CR23","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R. A., & Fischer, M. J. (1974). The string-to-string correction problem. Journal of the ACM, 21(1), 168\u2013173. https:\/\/doi.org\/10.1145\/321796.321811","journal-title":"Journal of the ACM"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06039-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06039-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06039-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T14:18:50Z","timestamp":1722262730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06039-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,16]]},"references-count":23,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["6039"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06039-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,16]]},"assertion":[{"value":"28 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}