{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:06Z","timestamp":1740122346822,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10586-020-03173-4","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T14:03:10Z","timestamp":1598364190000},"page":"969-995","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel deterministic local search heuristic for minimum latency problem"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2288-1895","authenticated-orcid":false,"given":"Pramod","family":"Yelmewad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Basavaraj","family":"Talawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,25]]},"reference":[{"key":"3173_CR1","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC \u201994, New York, NY, USA, pp. 163\u2013171 (1994). ACM","DOI":"10.1145\/195058.195125"},{"key":"3173_CR2","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-47867-1_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"R Sitters","year":"2002","unstructured":"Sitters, R.: The minimum latency problem is NP-hard for weighted trees. In: Cook, W.J., Schulz, A.S. (eds.) Integer Programming and Combinatorial Optimization, pp. 230\u2013239. Springer, Berlin (2002)"},{"issue":"3","key":"3173_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"issue":"2","key":"3173_CR4","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.: The traveling salesman problem with cumulative costs. Networks 23(2), 81\u201391 (1993)","journal-title":"Networks"},{"issue":"6","key":"3173_CR5","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.: The delivery man problem and cumulative matroids. Oper. Res. 41(6), 1055\u20131064 (1993)","journal-title":"Oper. Res."},{"key":"3173_CR6","unstructured":"Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees, and minimum latency tours. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings, October 2003, pp. 36\u201345"},{"issue":"3","key":"3173_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22(3), 263\u2013282 (1992)","journal-title":"Networks"},{"issue":"17","key":"3173_CR8","doi-asserted-by":"publisher","first-page":"3223","DOI":"10.1016\/j.dam.2008.05.009","volume":"156","author":"I M\u00e9ndez-D\u00edaz","year":"2008","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P., Lucena, A.: A new formulation for the traveling deliveryman problem. Discrete Appl. Math. 156(17), 3223\u20133237 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"3173_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42(2), 127\u2013145 (2008)","journal-title":"Transp. Sci."},{"key":"3173_CR10","doi-asserted-by":"crossref","unstructured":"Yelmewad, P., Talawar, B.: Near optimal solution for traveling salesman problem using GPU. In: 2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), pp. 1\u20136, March 2018","DOI":"10.1109\/CONECCT.2018.8482363"},{"issue":"7","key":"3173_CR11","doi-asserted-by":"publisher","first-page":"e4974","DOI":"10.1002\/cpe.4974","volume":"31","author":"P Yelmewad","year":"2019","unstructured":"Yelmewad, P., Talawar, B.: Parallel iterative hill climbing algorithm to solve TSP on GPU. Concurr. Comput. Pract. Exp. 31(7), e4974 (2019)","journal-title":"Concurr. Comput. Pract. Exp."},{"issue":"1","key":"3173_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12532-012-0047-y","volume":"5","author":"H Abeledo","year":"2013","unstructured":"Abeledo, H., Fukasawa, R., Pessoa, A., Uchoa, E.: The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5(1), 27\u201355 (2013)","journal-title":"Math. Program. Comput."},{"issue":"6","key":"3173_CR13","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1002\/net.3230200605","volume":"20","author":"A Lucena","year":"1990","unstructured":"Lucena, A.: Time-dependent traveling salesman problem\u2014the deliveryman case. Networks 20(6), 753\u2013763 (1990)","journal-title":"Networks"},{"issue":"5","key":"3173_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0020-0190(00)00102-2","volume":"75","author":"BY Wu","year":"2000","unstructured":"Wu, B.Y.: Polynomial time algorithms for some minimum latency problems. Inf. Process. Lett. 75(5), 225\u2013229 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"3173_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.ipl.2004.09.009","volume":"92","author":"BY Wu","year":"2004","unstructured":"Wu, B.Y., Huang, Z.-N., Zhan, F.-J.: Exact algorithms for the minimum latency problem. Inf. Process. Lett. 92(6), 303\u2013309 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3173_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10288-011-0153-0","volume":"9","author":"A Salehipour","year":"2011","unstructured":"Salehipour, A., S\u00f6rensen, K., Goos, P., Br\u00e4ysy, O.: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9(2), 189\u2013209 (2011)","journal-title":"4OR"},{"issue":"1","key":"3173_CR17","first-page":"111","volume":"82","author":"M Goemans","year":"1998","unstructured":"Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. Math. Program. 82(1), 111\u2013124 (1998)","journal-title":"Math. Program."},{"key":"3173_CR18","doi-asserted-by":"crossref","unstructured":"Archer, A., Blasiak, A.: Improved approximation algorithms for the minimum latency problem via prize-collecting strolls. In: Proceedings of the Twenty-First Annual ACM\u2013SIAM Symposium on Discrete Algorithms, SODA \u201910, Philadelphia, PA, USA, pp. 429\u2013447. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.36"},{"key":"3173_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)"},{"key":"3173_CR20","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00500-019-04495-1","volume":"24","author":"S Al-Janabi","year":"2020","unstructured":"Al-Janabi, S., Mohammad, M., Al-Sultan, A.: A new method for prediction of air pollution based on intelligent computation. Soft Comput. 24, 661\u2013680 (2020)","journal-title":"Soft Comput."},{"key":"3173_CR21","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00500-019-03972-x","volume":"24","author":"S Al-Janabi","year":"2020","unstructured":"Al-Janabi, S., Alkaim, A.F.: A Nifty collaborative analysis to predicting a novel tool (DRFLLS) for missing values estimation. Soft Comput. 24, 555\u2013569 (2020)","journal-title":"Soft Comput."},{"key":"3173_CR22","doi-asserted-by":"publisher","first-page":"10943","DOI":"10.1007\/s00500-020-04905-9","volume":"24","author":"S Al-Janabi","year":"2020","unstructured":"Al-Janabi, S., Alkaim, A.F., Adel, Z.: An Innovative synthesis of deep learning techniques (DCapsNet and DCOM) for generation electrical renewable energy from wind energy. Soft Comput. 24, 10943\u201310962 (2020)","journal-title":"Soft Comput."},{"issue":"11","key":"3173_CR23","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11), 1877\u20131885 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"3173_CR24","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2012.03.044","volume":"221","author":"MM Silva","year":"2012","unstructured":"Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum latency problem. Eur. J. Oper. Res. 221(3), 513\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"3173_CR25","doi-asserted-by":"publisher","first-page":"1700","DOI":"10.1016\/j.cor.2013.01.003","volume":"40","author":"T Dewilde","year":"2013","unstructured":"Dewilde, T., Cattrysse, D., Coene, S., Spieksma, F.C.R., Vansteenwegen, P.: Heuristics for the traveling repairman problem with profits. Comput. Oper. Res. 40(7), 1700\u20131707 (2013)","journal-title":"Comput. Oper. Res."},{"key":"3173_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-020-03090-6","author":"M Afif","year":"2020","unstructured":"Afif, M., Said, Y., Atri, M.: Computer vision algorithms acceleration using graphic processors NVIDIA CUDA. Clust. Comput. (2020). https:\/\/doi.org\/10.1007\/s10586-020-03090-6","journal-title":"Clust. Comput."},{"key":"3173_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-020-03105-2","author":"S Kim","year":"2020","unstructured":"Kim, S., Kim, D., Son, Y., Eom, H.: Towards predicting GPGPU performance for concurrent workloads in Multi-GPGPU environment. Clust. Comput. (2020). https:\/\/doi.org\/10.1007\/s10586-020-03105-2","journal-title":"Clust. Comput."},{"key":"3173_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10586-018-02901-1","volume":"23","author":"P Carvalho","year":"2020","unstructured":"Carvalho, P., Cruz, R., Drummond, L.M.A., Bentes, C., Clua, E., Cataldo, E., Marzulo, L.A.J.: Kernel concurrency opportunities based on GPU benchmarks characterization. Clust. Comput. 23, 177\u2013188 (2020)","journal-title":"Clust. Comput."},{"key":"3173_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-019-03035-8","author":"L Alawneh","year":"2020","unstructured":"Alawneh, L., Shehab, M.A., Al-Ayyoub, M., Jararweh, Y., Al-Sharif, Z.A.: A scalable multiple pairwise protein sequence alignment acceleration using hybrid CPU\u2013GPU approach. Clust. Comput. (2020). https:\/\/doi.org\/10.1007\/s10586-019-03035-8","journal-title":"Clust. Comput."},{"key":"3173_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-019-03037-6","author":"X Geng","year":"2020","unstructured":"Geng, X., Zhang, H., Zhao, Z., Ma, H.: Interference-aware parallelization for deep learning workload in GPU cluster. Clust. Comput. (2020). https:\/\/doi.org\/10.1007\/s10586-019-03037-6","journal-title":"Clust. Comput."},{"key":"3173_CR31","unstructured":"NVIDIA. CUDA Programming Guide. http:\/\/docs.nvidia.com\/cuda\/index.html. Accessed 1 July 2020"},{"key":"3173_CR32","doi-asserted-by":"crossref","unstructured":"Ban, H.B., Duc, N.N.: A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem. In: Proceedings of the Fifth Symposium on Information and Communication Technology, SoICT \u201914, New York, NY, USA, 2014. Association for Computing Machinery (2014)","DOI":"10.1145\/2676585.2676620"},{"key":"3173_CR33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3233\/FI-2017-1596","volume":"156","author":"H-B Ban","year":"2017","unstructured":"Ban, H.-B., Nguyen, D.-N.: A meta-heuristic algorithm combining between Tabu and variable neighborhood search for the minimum latency problem. Fundam. Inform. 156, 21\u201341 (2017)","journal-title":"Fundam. Inform."},{"key":"3173_CR34","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.cie.2017.09.032","volume":"113","author":"M Avci","year":"2017","unstructured":"Avci, M., Avci, M.G.: A GRASP with iterated local search for the traveling repairman problem with profits. Comput. Ind. Eng. 113, 323\u2013332 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"3173_CR35","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jpdc.2017.06.011","volume":"111","author":"E Rios","year":"2018","unstructured":"Rios, E., Ochi, L.S., Boeres, C., Coelho, V.N., Coelho, I.M., Farias, R.: Exploring parallel multi-GPU local search strategies in a metaheuristic framework. J. Parallel Distrib. Comput. 111, 39\u201355 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3173_CR36","unstructured":"Araujo, R.P., Coelho, I.M., Marzulo, L.A.J.: A DVND local search implemented on a dataflow architecture for the minimum latency problem. In: 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 1250\u20131259 (2018)"},{"key":"3173_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2020.102661","author":"RP Araujo","year":"2020","unstructured":"Araujo, R.P., Coelho, I.M., Augusto Justen Marzulo, L.: A multi-improvement local search using dataflow and GPU to solve the minimum latency problem. Parallel Comput. (2020). https:\/\/doi.org\/10.1016\/j.parco.2020.102661","journal-title":"Parallel Comput."},{"key":"3173_CR38","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12774","author":"\u00cd Santana","year":"2020","unstructured":"Santana, \u00cd., Plastino, A., Rosseti, I.: Improving a state-of-the-art heuristic for the minimum latency problem with data mining. Int. Trans. Oper. Res. (2020). https:\/\/doi.org\/10.1111\/itor.12774","journal-title":"Int. Trans. Oper. Res."},{"key":"3173_CR39","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2019.05.075","volume":"502","author":"Y Lu","year":"2019","unstructured":"Lu, Y., Hao, J.-K., Wu, Q.: Hybrid evolutionary search for the traveling repairman problem with profits. Inf. Sci. 502, 91\u2013108 (2019)","journal-title":"Inf. Sci."},{"issue":"1","key":"3173_CR40","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TC.2011.206","volume":"62","author":"T Van Luong","year":"2013","unstructured":"Van Luong, T., Melab, N., Talbi, E.-G.: GPU computing for parallel local search metaheuristics. IEEE Trans. Comput. 62(1), 173\u2013185 (2013)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"3173_CR41","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-020-03173-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-020-03173-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-020-03173-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T00:08:09Z","timestamp":1629850089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-020-03173-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,25]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["3173"],"URL":"https:\/\/doi.org\/10.1007\/s10586-020-03173-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2020,8,25]]},"assertion":[{"value":"1 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}