{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T18:51:57Z","timestamp":1774291917061,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T00:00:00Z","timestamp":1733529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T00:00:00Z","timestamp":1733529600000},"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":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s13042-024-02466-z","type":"journal-article","created":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T12:18:06Z","timestamp":1733573886000},"page":"3557-3585","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum wavefunction optimization algorithm: application in solving traveling salesman problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Pritpal","family":"Singh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,7]]},"reference":[{"key":"2466_CR1","doi-asserted-by":"crossref","unstructured":"Sun J, Wang Y, Li J, Gao K (2011) Hybrid algorithm based on chemical reaction optimization and Lin-Kernighan local search for the traveling salesman problem, In: Proceeding of the 7th International Conference on Natural Computation, Shanghai, China, Nov. 2011, pp 1518\u20131521","DOI":"10.1109\/ICNC.2011.6022378"},{"issue":"2","key":"2466_CR2","first-page":"171","volume":"60","author":"RH Warren","year":"1994","unstructured":"Warren RH (1994) Special cases of the traveling salesman problem. Appl Math Comput 60(2):171\u2013177","journal-title":"Appl Math Comput"},{"issue":"8","key":"2466_CR3","doi-asserted-by":"publisher","first-page":"13549","DOI":"10.1109\/TITS.2021.3125721","volume":"23","author":"X Meng","year":"2022","unstructured":"Meng X, Li J, Zhou M, Dai X (2022) A dynamic colored traveling salesman problem with varying edge weights. IEEE Trans Intell Transp Syst 23(8):13549\u201313558","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2466_CR4","volume-title":"Graph theory with applications to engineering and computer science","author":"N Deo","year":"2017","unstructured":"Deo N (2017) Graph theory with applications to engineering and computer science. PHI Learning Private Limited, New Delhi"},{"issue":"2","key":"2466_CR5","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"issue":"3","key":"2466_CR6","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1016\/j.eswa.2009.07.066","volume":"37","author":"P-C Chang","year":"2010","unstructured":"Chang P-C, Huang W-H, Ting C-J (2010) Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems. Expert Syst Appl 37(3):1863\u20131878","journal-title":"Expert Syst Appl"},{"issue":"3","key":"2466_CR7","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore M, Nemhauser GL (1968) The traveling salesman problem: a survey. Oper Res 16(3):538\u2013558","journal-title":"Oper Res"},{"issue":"3","key":"2466_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.engappai.2007.08.006","volume":"21","author":"CA Silva","year":"2008","unstructured":"Silva CA, Sousa JMC, Runkler TA (2008) Rescheduling and optimization of logistic processes using GA and ACO. Eng Appl Artif Intell 21(3):343\u2013352","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"2466_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0965-8564(00)00037-9","volume":"36","author":"X Wang","year":"2002","unstructured":"Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Transp Res Part B 36(2):97\u2013112","journal-title":"Transp Res Part B"},{"issue":"1","key":"2466_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.comcom.2004.07.006","volume":"28","author":"JRL Fournier","year":"2005","unstructured":"Fournier JRL, Pierre S (2005) Assigning cells to switches in mobile networks using an ant colony optimization heuristic. Comput Commun 28(1):65\u201373","journal-title":"Comput Commun"},{"key":"2466_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cor.2018.05.001","volume":"98","author":"C Archetti","year":"2018","unstructured":"Archetti C, Feillet D, Mor A, Speranza MG (2018) An iterated local search for the traveling salesman problem with release dates and completion time minimization. Comput Oper Res 98:24\u201337","journal-title":"Comput Oper Res"},{"issue":"4598","key":"2466_CR12","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1","key":"2466_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ejor.2007.06.002","volume":"190","author":"S Irnich","year":"2008","unstructured":"Irnich S (2008) Solution of real-world postman problems. Eur J Oper Res 190(1):52\u201367","journal-title":"Eur J Oper Res"},{"key":"2466_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.cor.2018.08.006","volume":"101","author":"Y Lu","year":"2019","unstructured":"Lu Y, Benlic U, Wu Q (2019) A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Comput Oper Res 101:285\u2013297","journal-title":"Comput Oper Res"},{"key":"2466_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.dam.2015.03.009","volume":"192","author":"AF Alkaya","year":"2015","unstructured":"Alkaya AF, Duman E (2015) Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly. Discret Appl Math 192:2\u201316","journal-title":"Discret Appl Math"},{"key":"2466_CR16","volume":"407","author":"F Su","year":"2021","unstructured":"Su F, Kong L, Wang H, Wen Z (2021) Modeling and application for rolling scheduling problem based on TSP. Appl Math Comput 407:126333","journal-title":"Appl Math Comput"},{"issue":"2","key":"2466_CR17","first-page":"1237","volume":"190","author":"H Wang","year":"2007","unstructured":"Wang H, Shen J (2007) Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints. Appl Math Comput 190(2):1237\u20131249","journal-title":"Appl Math Comput"},{"issue":"2","key":"2466_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):231\u2013247","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2466_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0305-0548(98)00064-1","volume":"26","author":"G Gutin","year":"1999","unstructured":"Gutin G (1999) Exponential neighbourhood local search for the traveling salesman problem. Comput Oper Res 26(4):313\u2013320","journal-title":"Comput Oper Res"},{"issue":"1","key":"2466_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M Padberg","year":"1987","unstructured":"Padberg M, Rinaldi G (1987) Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper Res Lett 6(1):1\u20137","journal-title":"Oper Res Lett"},{"issue":"1","key":"2466_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman R (1962) Dynamic programming treatment of the travelling salesman problem. J Assoc Comput Mach 9(1):61\u201363","journal-title":"J Assoc Comput Mach"},{"issue":"3","key":"2466_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C-N Fiechter","year":"1994","unstructured":"Fiechter C-N (1994) A parallel tabu search algorithm for large traveling salesman problems. Discret Appl Math 51(3):243\u2013267","journal-title":"Discret Appl Math"},{"issue":"1","key":"2466_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"C-F Tsai","year":"2004","unstructured":"Tsai C-F, Tsai C-W, Tseng C-C (2004) A new hybrid heuristic approach for solving large traveling salesman problem. Inf Sci 166(1):67\u201381","journal-title":"Inf Sci"},{"issue":"2","key":"2466_CR24","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.physa.2006.04.052","volume":"371","author":"Y Chen","year":"2006","unstructured":"Chen Y, Zhang P (2006) Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution. Physica A 371(2):627\u2013632","journal-title":"Physica A"},{"issue":"3","key":"2466_CR25","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M Albayrak","year":"2011","unstructured":"Albayrak M, Allahverdi N (2011) Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Syst Appl 38(3):1313\u20131320","journal-title":"Expert Syst Appl"},{"issue":"5","key":"2466_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang QX (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103(5):169\u2013176","journal-title":"Inf Process Lett"},{"key":"2466_CR27","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","volume":"421","author":"Y Zhong","year":"2017","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2017) Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf Sci 421:70\u201384","journal-title":"Inf Sci"},{"key":"2466_CR28","doi-asserted-by":"crossref","unstructured":"Jati GK, Manurung R, Suyanto (2013) Discrete firefly algorithm for traveling salesman problem: a new movement scheme. In: Swarm Intelligence and Bio-Inspired Computation. Elsevier, pp 295\u2013312","DOI":"10.1016\/B978-0-12-405163-8.00013-2"},{"issue":"12","key":"2466_CR29","doi-asserted-by":"publisher","first-page":"6319","DOI":"10.1007\/s12652-020-02224-3","volume":"11","author":"J Li","year":"2020","unstructured":"Li J, Yang F (2020) Task assignment strategy for multi-robot based on improved grey wolf optimizer. J Ambient Intell Humaniz Comput 11(12):6319\u20136335","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"7","key":"2466_CR30","doi-asserted-by":"publisher","first-page":"3293","DOI":"10.1007\/s00500-021-06665-6","volume":"26","author":"BH Abed-alguni","year":"2022","unstructured":"Abed-alguni BH, Paul D (2022) Island-based cuckoo search with elite opposition-based learning and multiple mutation methods for solving optimization problems. Soft Comput 26(7):3293\u20133312","journal-title":"Soft Comput"},{"issue":"15","key":"2466_CR31","doi-asserted-by":"publisher","first-page":"10 167","DOI":"10.1007\/s00500-021-05939-3","volume":"25","author":"BH Abed-alguni","year":"2021","unstructured":"Abed-alguni BH, Alawad NA, Barhoush M, Hammad R (2021) Exploratory cuckoo search for solving single-objective optimization problems. Soft Comput 25(15):10 167-10 180","journal-title":"Soft Comput"},{"issue":"15","key":"2466_CR32","doi-asserted-by":"publisher","first-page":"17\u00a0217","DOI":"10.1007\/s10489-022-03269-x","volume":"52","author":"BH Abed-Alguni","year":"2022","unstructured":"Abed-Alguni BH, Paul D, Hammad R (2022) Improved salp swarm algorithm for solving single-objective continuous optimization problems. Appl Intell 52(15):17\u00a0217-17\u00a0236","journal-title":"Appl Intell"},{"key":"2466_CR33","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.swevo.2018.02.020","volume":"42","author":"H Xiong","year":"2018","unstructured":"Xiong H, Wu Z, Fan H, Li G, Jiang G (2018) Quantum rotation gate in quantum-inspired evolutionary algorithm: a review, analysis and comparison study. Swarm Evol Comput 42:43\u201357","journal-title":"Swarm Evol Comput"},{"issue":"6","key":"2466_CR34","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"K-H Han","year":"2002","unstructured":"Han K-H, Kim J-H (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evolut Comput 6(6):580\u2013593","journal-title":"IEEE Trans Evolut Comput"},{"issue":"6","key":"2466_CR35","first-page":"2516","volume":"218","author":"T-C Lu","year":"2011","unstructured":"Lu T-C, Juang J-C (2011) Quantum-inspired space search algorithm (QSSA) for global numerical optimization. Appl Math Comput 218(6):2516\u20132532","journal-title":"Appl Math Comput"},{"key":"2466_CR36","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.enconman.2014.07.060","volume":"87","author":"B Ji","year":"2014","unstructured":"Ji B, Li XYX, Li YHW (2014) Application of quantum-inspired binary gravitational search algorithm for thermal unit commitment with wind power integration. Energy Convers Manage 87:589\u2013598","journal-title":"Energy Convers Manage"},{"key":"2466_CR37","doi-asserted-by":"crossref","unstructured":"Cui L, Wang L, Deng J, Zhang J (2013) A new improved quantum evolution algorithm with local search procedure for capacitated vehicle routing problem. Math Prob Eng 2013","DOI":"10.1155\/2013\/159495"},{"key":"2466_CR38","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.swevo.2016.02.006","volume":"29","author":"R Pavithr","year":"2016","unstructured":"Pavithr R, Gursaran (2016) Quantum inspired social evolution (qse) algorithm for 0\u20131 knapsack problem. Swarm Evolut Comput 29:33\u201346","journal-title":"Swarm Evolut Comput"},{"issue":"3","key":"2466_CR39","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s11128-013-0686-6","volume":"13","author":"A SaiToh","year":"2014","unstructured":"SaiToh A, Rahimi R, Nakahara M (2014) A quantum genetic algorithm with quantum crossover and mutation operations. Quantum Inf Process 13(3):737\u2013755","journal-title":"Quantum Inf Process"},{"key":"2466_CR40","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.swevo.2016.06.003","volume":"31","author":"AEM Dahi","year":"2016","unstructured":"Dahi AEM, Mezioud C, Draa A (2016) A quantum-inspired genetic algorithm for solving the antenna positioning problem. Swarm Evol Comput 31:24\u201363","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"2466_CR41","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1162\/EVCO_a_00049","volume":"20","author":"J Sun","year":"2012","unstructured":"Sun J, Fang W, Wu X, Palade V, Xu W (2012) Quantum-behaved particle swarm optimization: analysis of individual particle behavior and parameter selection. Evol Comput 20(3):349\u2013393","journal-title":"Evol Comput"},{"key":"2466_CR42","doi-asserted-by":"crossref","unstructured":"Fang W, Zhang L, Zhou J, Wu X, Sun J (2017) A novel quantum-behaved particle swarm optimization with random selection for large scale optimization. In: Proceeding of IEEE Congress on Evolutionary Computation (CEC), Donostia-San Sebasti\u00e1n, Spain, Donostia, Spain, pp 2746\u20132751","DOI":"10.1109\/CEC.2017.7969641"},{"key":"2466_CR43","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ins.2014.08.030","volume":"289","author":"D Tang","year":"2014","unstructured":"Tang D, Cai Y, Zhao J, Xue Y (2014) A quantum-behaved particle swarm optimization with memetic algorithm and memory for continuous non-linear large scale problems. Inf Sci 289:162\u2013189","journal-title":"Inf Sci"},{"key":"2466_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100697","volume":"57","author":"B Cao","year":"2020","unstructured":"Cao B, Fan S, Zhao J, Yang P, Muhammad K, Tanveer M (2020) Quantum-enhanced multiobjective large-scale optimization via parallelism. Swarm Evol Comput 57:100697","journal-title":"Swarm Evol Comput"},{"key":"2466_CR45","doi-asserted-by":"publisher","first-page":"23568","DOI":"10.1109\/ACCESS.2020.2970105","volume":"8","author":"Y Li","year":"2020","unstructured":"Li Y, Tian M, Liu G, Peng C, Jiao L (2020) Quantum optimization and quantum learning: a survey. IEEE Access 8:23568\u201323593","journal-title":"IEEE Access"},{"key":"2466_CR46","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.compind.2019.06.004","volume":"111","author":"P Singh","year":"2019","unstructured":"Singh P, Huang Y-P (2019) A new hybrid time series forecasting model based on the neutrosophic set and quantum optimization algorithm. Comput Ind 111:121\u2013139","journal-title":"Comput Ind"},{"key":"2466_CR47","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ins.2021.02.024","volume":"566","author":"P Singh","year":"2021","unstructured":"Singh P (2021) FQTSFM: a fuzzy-quantum time series forecasting model. Inf Sci 566:57\u201379","journal-title":"Inf Sci"},{"key":"2466_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115637","volume":"185","author":"P Singh","year":"2021","unstructured":"Singh P, Bose SS (2021) A quantum-clustering optimization method for COVID-19 CT scan image segmentation. Expert Syst Appl 185:115637","journal-title":"Expert Syst Appl"},{"key":"2466_CR49","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.neucom.2014.01.078","volume":"151","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Luo Q, Chen H, He A, Wu J (2015) A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151:1227\u20131236","journal-title":"Neurocomputing"},{"key":"2466_CR50","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.asoc.2018.07.010","volume":"71","author":"M C\u00e1rdenas-Montes","year":"2018","unstructured":"C\u00e1rdenas-Montes M (2018) Creating hard-to-solve instances of travelling salesman problem. Appl Soft Comput 71:268\u2013276","journal-title":"Appl Soft Comput"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02466-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02466-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02466-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T09:02:57Z","timestamp":1749286977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02466-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,7]]},"references-count":50,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2466"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02466-z","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,7]]},"assertion":[{"value":"8 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Ethics approval was not required for this study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human participants and\/or animals"}}]}}