{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:44:16Z","timestamp":1773798256629,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00500-019-03805-x","type":"journal-article","created":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T15:07:16Z","timestamp":1549033636000},"page":"12547-12560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Apply the quantum particle swarm optimization for the K-traveling repairman problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Sirine","family":"Jmal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1620-0993","authenticated-orcid":false,"given":"Boukthir","family":"Haddar","sequence":"additional","affiliation":[]},{"given":"Habib","family":"Chabchoub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,1]]},"reference":[{"key":"3805_CR1","volume-title":"Swarm intelligence: foundations, perspectives and applications","author":"A Abraham","year":"2006","unstructured":"Abraham A, Guo H, Liu H (2006) Swarm intelligence: foundations, perspectives and applications. Springer, New York"},{"issue":"1","key":"3805_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1051\/ita\/1986200100791","volume":"20","author":"F Afrati","year":"1986","unstructured":"Afrati F, Cosmadakis S, Papadimitriou CH, Papageorgiou G, Papakostantinou N (1986) The complexity of the travelling repairman problem. RAIRO Theor Inf Appl 20(1):79\u201387","journal-title":"RAIRO Theor Inf Appl"},{"key":"3805_CR3","unstructured":"Angel-Bello F, Cardona-Vald\u00e9s Y, \u00c1lvarez A (2017) Mixed integer formulations for the multiple minimum latency problem. Oper Res 1\u201330"},{"key":"3805_CR4","unstructured":"Augerat P, Corberan A, Benavent E, Belenguer J (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Tech. Rep. RR 949-M, Universit\u00e9 Grenoble 1. IMAG (Saint Martin d\u2019H\u00e8res)"},{"key":"3805_CR5","doi-asserted-by":"crossref","unstructured":"Ausiello G, Leonardi S, Marchetti-Spaccamela A (2000) On salesmen, repairmen, spiders, and other traveling agents. In: Algorithms and complexity, 4th Italian conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp 1\u201316","DOI":"10.1007\/3-540-46521-9_1"},{"issue":"3","key":"3805_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.15625\/1813-9663\/33\/3\/10511","volume":"33","author":"BH Bang","year":"2017","unstructured":"Bang BH (2017) A grasp+ vnd algorithm for the multiple traveling repairman problem with distance constraints. J Comput Sci Cybern 33(3):272\u2013288","journal-title":"J Comput Sci Cybern"},{"key":"3805_CR7","doi-asserted-by":"crossref","unstructured":"Bansal S (2018) Nature-inspired-based multi-objective hybrid algorithms to find near-OGRS for optical WDM systems and their comparison. In: Handbook of research on biomimicry in information retrieval and knowledge management. IGI Global, pp 175\u2013211, pp 175\u2013211","DOI":"10.4018\/978-1-5225-3004-6.ch011"},{"key":"3805_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.asoc.2014.04.015","volume":"22","author":"S Bansal","year":"2014","unstructured":"Bansal S (2014) Optimal golomb ruler sequence generation for fwm crosstalk elimination: soft computing versus conventional approaches. Appl Soft Comput 22:443\u2013457","journal-title":"Appl Soft Comput"},{"issue":"1","key":"3805_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s40031-016-0249-1","volume":"98","author":"S Bansal","year":"2017","unstructured":"Bansal S, Singh AK, Gupta N (2017) Optimal golomb ruler sequences generation for optical wdm systems: a novel parallel hybrid multi-objective bat algorithm. J Inst Eng (India) Ser B 98(1):43\u201364","journal-title":"J Inst Eng (India) Ser B"},{"issue":"1","key":"3805_CR10","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1515\/math-2017-0045","volume":"15","author":"S Bansal","year":"2017","unstructured":"Bansal S, Gupta N, Singh AK (2017) Nature-inspired metaheuristic algorithms to find near-ogr sequences for wdm channel allocation and their performance comparison. Open Math 15(1):520\u2013547","journal-title":"Open Math"},{"issue":"2","key":"3805_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/net.3230230202","volume":"23","author":"L Bianco","year":"1993","unstructured":"Bianco L, Mingozzi A, Ricciardelli S (1993) The traveling salesman problem with cumulative costs. Networks 23(2):81\u201391","journal-title":"Networks"},{"issue":"15","key":"3805_CR12","doi-asserted-by":"publisher","first-page":"5997","DOI":"10.1016\/j.eswa.2013.05.036","volume":"40","author":"N Bjeli\u0107","year":"2013","unstructured":"Bjeli\u0107 N, Vidovi\u0107 M, Popovi\u0107 D (2013) Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows. Expert Syst. Appl. 40(15):5997\u20136006","journal-title":"Expert Syst. Appl."},{"key":"3805_CR13","doi-asserted-by":"crossref","unstructured":"Blum A, Chalasani P, Coppersmith D, Pulleyblank B, Raghavan P, Sudan M (1994) The minimum latency problem. In: Proceedings of the twenty-sixth annual acm symposium on theory of computing, STOC \u201994. ACM, New York, pp. 163\u2013171","DOI":"10.1145\/195058.195125"},{"key":"3805_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.endm.2018.07.029","volume":"69","author":"M Bruni","year":"2018","unstructured":"Bruni M, Beraldi P, Khodaparasti S (2018) A heuristic approach for the k-traveling repairman problem with profits under uncertainty. Electron Notes Discrete Math 69:221\u2013228","journal-title":"Electron Notes Discrete Math"},{"key":"3805_CR15","doi-asserted-by":"crossref","unstructured":"Chaudhuri K, Godfrey B, Rao S, Talwar K (2003) Paths, trees, and minimum latency tours. In: 44th symposium on foundations of computer science (FOCS 2003), 11\u201314 October 2003, Cambridge, MA, USA, Proceedings, pp 36\u201345","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"3805_CR16","doi-asserted-by":"crossref","unstructured":"Chekuri C, Kumar A (2004) Maximum coverage problem with group budget constraints and applications. In: Approximation, randomization, and combinatorial optimization. algorithms and techniques. Springer, pp. 72\u201383","DOI":"10.1007\/978-3-540-27821-4_7"},{"key":"3805_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N, Eilon S (1969) An algorithm for the vehicle-dispatching problem. J Oper Res Soc 20:309\u2013318","journal-title":"J Oper Res Soc"},{"key":"3805_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/9780470612163","volume-title":"Particle swarm optimization","author":"M Clerc","year":"2006","unstructured":"Clerc M (2006) Particle swarm optimization. ISTE Publishing Company, London"},{"key":"3805_CR19","volume-title":"Theory of scheduling","author":"RW Conway","year":"2003","unstructured":"Conway RW, Maxwell WL, Miller LW (2003) Theory of scheduling. Dover, New York"},{"key":"3805_CR20","volume-title":"Fundamentals of computational swarm intelligence","author":"AP Engelbrecht","year":"2005","unstructured":"Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, Hoboken"},{"issue":"5","key":"3805_CR21","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1504\/IJMOR.2012.048928","volume":"4","author":"IO Ezzine","year":"2012","unstructured":"Ezzine IO, Elloumi S (2012) Polynomial formulation and heuristic based approach for the k-travelling repairman problem. IJMOR 4(5):503\u2013514","journal-title":"IJMOR"},{"key":"3805_CR22","unstructured":"Fakcharoenphol J, Harrelson C, Rao S (2003) The k-traveling repairman problem. In: Proceedings of the 14th annual ACM-SIAM symposium on Discrete algorithms, pp 655\u2013664"},{"issue":"6","key":"3805_CR23","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M Fischetti","year":"1993","unstructured":"Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. Oper Res 41(6):1055\u20131064","journal-title":"Oper Res"},{"key":"3805_CR24","unstructured":"Gonz\u00e1lez F, Rivera JC (2015) A multi-start iterative local search for the k-traveling repairman problem. Technical Reports, Working paper"},{"key":"3805_CR25","doi-asserted-by":"crossref","unstructured":"Hmayer A, Ezzine IO (2013) Clarans heuristic based approach for the k-traveling repairman problem. In: 2013 international conference on advanced logistics and transport (ICALT), pp 535\u2013538","DOI":"10.1109\/ICAdLT.2013.6568515"},{"issue":"3","key":"3805_CR26","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/s00521-016-2508-0","volume":"29","author":"W Hu","year":"2018","unstructured":"Hu W, Wang H, Qiu Z, Nie C, Yan L (2018) A quantum particle swarm optimization driven urban traffic light scheduling model. Neural Comput Appl 29(3):901\u2013911","journal-title":"Neural Comput Appl"},{"issue":"2","key":"3805_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jda.2006.03.023","volume":"5","author":"R Jothi","year":"2007","unstructured":"Jothi R, Raghavachari B (2007) Approximating the k-traveling repairman problem with repairtimes. J Discrete Algorithms 5(2):293\u2013303","journal-title":"J Discrete Algorithms"},{"key":"3805_CR28","doi-asserted-by":"crossref","unstructured":"Kara \u0130, Kara BY, Yetis MK (2008) Cumulative vehicle routing problems. Vehicle Routing Problem, pp 85\u201398","DOI":"10.5772\/5812"},{"key":"3805_CR29","doi-asserted-by":"crossref","unstructured":"Kennedy J (1999) Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceedings of the 1999 congress on evolutionary computation, 1999. CEC 99, vol\u00a03, pp 1938","DOI":"10.1109\/CEC.1999.785509"},{"key":"3805_CR30","doi-asserted-by":"crossref","unstructured":"Kennedy J (2000) Stereotyping: improving particle swarm performance with cluster analysis. In: Proceedings of the 2000 congress on evolutionary computation, vol\u00a02, pp 1507\u20131512","DOI":"10.1109\/CEC.2000.870832"},{"key":"3805_CR31","doi-asserted-by":"crossref","unstructured":"Kennedy J (2003) Bare bones particle swarms. In: Proceedings of the 2003 swarm intelligence symposium. IEEE, pp 80\u201387","DOI":"10.1109\/SIS.2003.1202251"},{"key":"3805_CR32","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the 1995 IEEE international conference on neural networks, vol\u00a04, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3805_CR33","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the 1997 IEEE international conference on computational cybernetics and simulation, vol\u00a05, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"3805_CR34","unstructured":"Khanesar MA, Teshnehlab M, Shoorehdeli MA (2007) A novel binary particle swarm optimization. In: Mediterranean conference on control & automation, 2007. MED\u201907. IEEE, pp 1\u20136"},{"key":"3805_CR35","doi-asserted-by":"crossref","unstructured":"Krohling RA, dos Santos\u00a0Coelho L (2006) PSO-E: particle swarm with exponential distribution. In: IEEE congress on evolutionary computation, 2006. CEC 2006. IEEE, pp 1428\u20131433","DOI":"10.1109\/CEC.2006.1688476"},{"issue":"4","key":"3805_CR36","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11721-012-0073-4","volume":"6","author":"J Langeveld","year":"2012","unstructured":"Langeveld J, Engelbrecht AP (2012) Set-based particle swarm optimization applied to the multidimensional knapsack problem. Swarm Intell 6(4):297\u2013342","journal-title":"Swarm Intell"},{"issue":"1","key":"3805_CR37","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ejor.2013.09.014","volume":"234","author":"Z Luo","year":"2014","unstructured":"Luo Z, Qin H, Lim A (2014) Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur J Oper Res 234(1):49\u201360","journal-title":"Eur J Oper Res"},{"key":"3805_CR38","unstructured":"Mohais A, Mendes R, Ward C, Posthoff C (2005) Neighborhood restructuring in particle swarm optimization. In: Proceedings of the 2005 advances in artificial intelligence, vol 3809. Lecture notes in computer science. Springer, pp. 776\u2013785"},{"issue":"1","key":"3805_CR39","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10845-014-0970-z","volume":"28","author":"SM Mousavi","year":"2017","unstructured":"Mousavi SM, Bahreininejad A, Musa SN, Yusof F (2017) A modified particle swarm optimization for solving the integrated location and inventory control problems in a two-echelon supply chain network. J Intell Manuf 28(1):191\u2013206","journal-title":"J Intell Manuf"},{"issue":"1","key":"3805_CR40","first-page":"21","volume":"6","author":"H Nezamabadi-pour","year":"2008","unstructured":"Nezamabadi-pour H, Rostami Shahrbabaki M, Maghfoori-Farsangi M (2008) Binary particle swarm optimization: challenges and new solutions. CSI J Comput Sci Eng Persian 6(1):21\u201332","journal-title":"CSI J Comput Sci Eng Persian"},{"issue":"11","key":"3805_CR41","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu SU, Prins C, Calvo RW (2010) An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput Oper Res 37(11):1877\u20131885","journal-title":"Comput Oper Res"},{"issue":"8","key":"3805_CR42","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1057\/jors.2015.113","volume":"67","author":"S Nucamendi-Guill\u00e9n","year":"2016","unstructured":"Nucamendi-Guill\u00e9n S, Mart\u00ednez-Salazar I, Angel-Bello F, Moreno-Vega MJ (2016) A mixed integer formulation and an efficient metaheuristic procedure for the k-travelling repairmen problem. J Oper Res Soc 67(8):1121\u20131134","journal-title":"J Oper Res Soc"},{"key":"3805_CR43","unstructured":"Onder G (2015) New decision models for multiple traveling minimum latency problem. Master\u2019s thesis, Baskent University Institute of Science and Engineering, Ankara"},{"key":"3805_CR44","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.trpro.2017.03.042","volume":"22","author":"G Onder","year":"2017","unstructured":"Onder G, Kara I, Derya T (2017) New integer programming formulation for multiple traveling repairmen problem. Transport Res Proc 22:355\u2013361","journal-title":"Transport Res Proc"},{"key":"3805_CR45","doi-asserted-by":"crossref","unstructured":"Pampara G, Franken N, Engelbrecht AP (2005) Combining particle swarm optimisation with angle modulation to solve binary problems. In: The 2005 IEEE congress on evolutionary computation, 2005, vol\u00a01. IEEE, pp 89\u201396","DOI":"10.1109\/CEC.2005.1554671"},{"issue":"4","key":"3805_CR46","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TEVC.2005.859468","volume":"10","author":"D Parrott","year":"2006","unstructured":"Parrott D, Li X (2006) Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans Evol Comput 10(4):440\u2013458","journal-title":"IEEE Trans Evol Comput"},{"key":"3805_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JAE-172277","volume":"56","author":"OU Rehman","year":"2018","unstructured":"Rehman OU, Tu S, Khan S, Khan H, Yang S (2018) A modified quantum particle swarm optimizer applied to optimization design of electromagnetic devices. Int J Appl Electromagn Mech 56:1\u201311","journal-title":"Int J Appl Electromagn Mech"},{"issue":"3","key":"3805_CR48","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J. ACM 23(3):555\u2013565","journal-title":"J. ACM"},{"issue":"3","key":"3805_CR49","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/07408179108963858","volume":"23","author":"D Simchi-Levi","year":"1991","unstructured":"Simchi-Levi D, Berman O (1991) Minimizing the total flow time of n jobs on a network. IIE Trans 23(3):236\u2013244","journal-title":"IIE Trans"},{"key":"3805_CR50","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cie.2015.12.004","volume":"93","author":"MR Singh","year":"2016","unstructured":"Singh MR, Mahapatra SS (2016) A quantum behaved particle swarm optimization for flexible job shop scheduling. Comput Ind Eng 93:36\u201344","journal-title":"Comput Ind Eng"},{"key":"3805_CR51","doi-asserted-by":"crossref","unstructured":"Sun J, Feng B, Xu W (2004) Particle swarm optimization with particles having quantum behavior. In: Proceedings of the 2004 congress on evolutionary computation, vol.\u00a01, pp 325\u2013331","DOI":"10.1109\/CEC.2004.1330875"},{"key":"3805_CR52","unstructured":"Sun J, Xu W, Feng B (2004) A global search strategy of quantum-behaved particle swarm optimization. In: Proceedings of the 2004 IEEE conference on cybernetics and intelligent systems, vol\u00a01, pp 111\u2013116"},{"key":"3805_CR53","doi-asserted-by":"crossref","unstructured":"Yang S, Wang M, Jiao L (2004) A quantum particle swarm optimization. In: Proceedings of the 2004 congress IEEE conference on evolutionary computation, vol\u00a01, pp 320\u2013324","DOI":"10.1109\/CEC.2004.1330874"},{"issue":"2","key":"3805_CR54","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10479-015-1792-x","volume":"242","author":"B Yao","year":"2016","unstructured":"Yao B, Yu B, Hu P, Gao J, Zhang M (2016) An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Ann Oper Res 242(2):303\u2013320","journal-title":"Ann Oper Res"},{"key":"3805_CR55","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1504\/IJMOR.2010.034339","volume":"2","author":"F Zandi","year":"2010","unstructured":"Zandi F, Tavana M (2010) An optimisation model for traffic distribution forecasting in packet-switching networks. IJMOR 2:515\u2013539","journal-title":"IJMOR"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03805-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03805-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03805-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T06:12:24Z","timestamp":1580969544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03805-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,1]]},"references-count":55,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3805"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03805-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,1]]},"assertion":[{"value":"1 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}