{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:58Z","timestamp":1750308718767,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":22,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hanoi University of Science and Technology","award":["T2014-72"],"award-info":[{"award-number":["T2014-72"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1145\/2676585.2676620","type":"proceedings-article","created":{"date-parts":[[2015,1,16]],"date-time":"2015-01-16T19:18:59Z","timestamp":1421435939000},"page":"39-48","source":"Crossref","is-referenced-by-count":3,"title":["A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem"],"prefix":"10.1145","author":[{"given":"Ha Bang","family":"Ban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nghia Nguyen","family":"Duc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2676585.2676620-1","doi-asserted-by":"crossref","unstructured":"A. Archer, A. Levin, and D. Williamson, \"A Faster, Better Approximation Algorithm for the Minimum Latency Problem\", J. SIAM, Vol. 37, No. 1, 2007, pp. 1472--1498.","DOI":"10.1137\/07068151X"},{"key":"key-10.1145\/2676585.2676620-2","doi-asserted-by":"crossref","unstructured":"S. Arora, and G. Karakostas, \"Approximation schemes for minimum latency problems\", Proc. STOC, 1999, pp. 688--693.","DOI":"10.1145\/301250.301432"},{"key":"key-10.1145\/2676585.2676620-3","doi-asserted-by":"crossref","unstructured":"H. B. Ban, and D. N. Nguyen, \"Improved genetic algorithm for minimum latency problem\", Proc. SOICT, 2010, pp. 9--15.","DOI":"10.1145\/1852611.1852614"},{"key":"key-10.1145\/2676585.2676620-4","unstructured":"H. B. Ban, K. Nguyen, M. C. Ngo, and D. N. Nguyen, \"An efficient exact algorithm for Minimum Latency Problem\", J. PI, No. 10, 2013, pp. 1--8."},{"key":"key-10.1145\/2676585.2676620-5","doi-asserted-by":"crossref","unstructured":"A. Blum, P. Chalasani, D. Coppersmith, W. Pulleyblank, P. Raghavan, and M. Sudan, \"The minimum latency problem\", Proc. STOC, 1994, pp. 163--171.","DOI":"10.1145\/195058.195125"},{"key":"key-10.1145\/2676585.2676620-6","doi-asserted-by":"crossref","unstructured":"K. Chaudhuri, B. Goldfrey, S. Rao, and K. Talwar, \"Path, Tree and minimum latency tour\", Proc. FOCS, 2003, pp. 36--45.","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"key-10.1145\/2676585.2676620-7","unstructured":"J. J. Dongarra, \"Performance of Various Computers Using Standard Linear Equations Software\", Linpack Benchmark Report, University of Tennessee Computer Science Technical Report, CS-89-85, 2013."},{"key":"key-10.1145\/2676585.2676620-8","doi-asserted-by":"crossref","unstructured":"M. Dorigo and T. Stutzle, \"Ant Colony Optimization\", Bradford Books, 2004.","DOI":"10.1007\/b99492"},{"key":"key-10.1145\/2676585.2676620-9","unstructured":"M. Goemans, and J. Kleinberg, \"An improved approximation ratio for the minimum latency problem\", Proc. SIAM SODA, 1996, pp. 152--158."},{"key":"key-10.1145\/2676585.2676620-10","unstructured":"H. Hasegawa, \"Optimization of GROUP Behavior\", Japan Ethological Society Newsletter, No. 43, 2004, pp. 22--23."},{"key":"key-10.1145\/2676585.2676620-11","unstructured":"L. Homaifar, C. Guan, and G. Liepins, \"A New Approach to the Traveling Salesman Problem by Genetic Algorithms\", Proc. ICGA, pp. 460--466, 1993."},{"key":"key-10.1145\/2676585.2676620-12","doi-asserted-by":"crossref","unstructured":"N. Mladenovic, P. Hansen, \"Variable neighborhood search\", J. Operations Research, vol. 24, No. 11 24, 1997, pp. 1097--1100.","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"key-10.1145\/2676585.2676620-13","doi-asserted-by":"crossref","unstructured":"A. Salehipour, K. Sorensen, P. Goos, and O. Braysy, \"Efficient GRASP+VND and GRASP+VNS meta-heuristics for the traveling repairman problem\", J. Operations Research, Vol. 9, No. 2, 2011, pp. 189--209.","DOI":"10.1007\/s10288-011-0153-0"},{"key":"key-10.1145\/2676585.2676620-14","unstructured":"M. Sabry Abdel-Moetty, O. Asmaa Heakil, \"Enhanced Traveling Salesman Problem Solving using Genetic Algorithm Technique with modified Sequential Constructive Crossover Operator\", J. IJCSNS, Vol. 12, No. 6, 2012, pp. 134--138."},{"key":"key-10.1145\/2676585.2676620-15","doi-asserted-by":"crossref","unstructured":"M. Silva, A. Subramanian, T. Vidal, and L. Ochi, \"A simple and effective meta-heuristic for the Minimum Latency Problem\", J. Operations Research, Vol 221, No. 3, 2012, pp. 513--520.","DOI":"10.1016\/j.ejor.2012.03.044"},{"key":"key-10.1145\/2676585.2676620-16","unstructured":"S. Shimomuray, M. Sugimotoy, T. Haraguchiy, H. Matsushitaz and Y. Nishioy, \"Ant Colony Optimization with Intelligent and Dull Ants\", Proc. NOLTA, 2010, pp. 504--507."},{"key":"key-10.1145\/2676585.2676620-17","doi-asserted-by":"crossref","unstructured":"D. S. Johnson, and L. A. McGeoch, \"The traveling salesman problem: A case study in local optimization in Local Search in Combinatorial Optimization\", E. Aarts and J. K. Lenstra, eds., pp. 215--310.","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"key-10.1145\/2676585.2676620-18","unstructured":"R. Sivaraj, T. Ravichandran, \"A review of selection methods in genetic algorithm\", J. IJEST, Vol. 3, No. 5, 2011, pp. 3792--3797."},{"key":"key-10.1145\/2676585.2676620-19","unstructured":"R. Sivaraj, T. Ravichandran, \"Genetic Algorithm for the Traveling Salesman Problem using Sequential Constructive Crossover Operator\", J. IJBB, Vol. 3, No. 6, 2010, pp. 96--105."},{"key":"key-10.1145\/2676585.2676620-20","unstructured":"L. Wang, A. MaciejewskiS, H. J. Siegel, and V. P. Roychowdhury, \"A comparative study of five parallel genetic algorithms using the traveling salesman problem\", Proc. IPPS\/SPDP, 2005, pp. 217--234."},{"key":"key-10.1145\/2676585.2676620-21","doi-asserted-by":"crossref","unstructured":"B. Y. Wu, Z.-N. Huang and F.-J. Zhan, \"Exact algorithms for the minimum latency problem\", Inform. Proc. Letters, Vol. 92, No. 6, 2004, pp. 303--309.","DOI":"10.1016\/j.ipl.2004.09.009"},{"key":"key-10.1145\/2676585.2676620-22","unstructured":"http:\/\/www.iwr.uniheidelberg.de\/groups\/comopt\/software\/TSPLIB95."}],"event":{"name":"the Fifth Symposium","start":{"date-parts":[[2014,12,4]]},"number":"5","location":"Hanoi, Viet Nam","end":{"date-parts":[[2014,12,5]]},"acronym":"SoICT '14"},"container-title":["Proceedings of the Fifth Symposium on Information and Communication Technology - SoICT '14"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676585.2676620","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2676620&ftid=1529158&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:30Z","timestamp":1750277670000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2676585.2676620"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2014]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1145\/2676585.2676620","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}