{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:25:19Z","timestamp":1781108719287,"version":"3.54.1"},"reference-count":34,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,1]]},"abstract":"<p>The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. Ant Colony Optimization is a metaheurisitc that is able to solve large scale optimization problems. In the dynamic traveling salesman problem, the distances between cities as travel times are no longer fixed. The new technique uses a parallel model for a problem variant that allows a slight movement of nodes within their neighborhoods. The algorithm is tested with success on several large data sets. The paper concludes with a discussion of the results provided by both the sequential and parallel approaches and calls for further research on the subject.<\/p>","DOI":"10.4018\/jitr.2012100101","type":"journal-article","created":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T14:39:08Z","timestamp":1365518348000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Parallel ACO with a Ring Neighborhood for Dynamic TSP"],"prefix":"10.4018","volume":"5","author":[{"given":"Camelia M.","family":"Pintea","sequence":"first","affiliation":[{"name":"Technical University of Cluj-Napoca, Northern University Centre, Baia Mare, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gloria Cerasela","family":"Crisan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Informatics, and Educational Sciences, \u201cVasile Alecsandri\u201d University of Bacau, Bacau, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihai","family":"Manea","sequence":"additional","affiliation":[{"name":"\u201cVasile Alecsandri\u201d University of Bacau, Bacau, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jitr.2012100101-0","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383"},{"key":"jitr.2012100101-1","unstructured":"Barney, B. (2010). Introduction to parallel computing (UCRL-MI-133316). Lawrence Livermore National Laboratory. Retrieved June 10, 2012, from https:\/\/computing.llnl.gov\/tutorials\/parallel_comp\/"},{"key":"jitr.2012100101-2","doi-asserted-by":"crossref","unstructured":"Crainic, T., Cri\u015fan, G., Gendreau, M., Lahrichi, N., & Rei, W. (2009). Multi-thread integrative cooperative optimization for rich combinatorial problems. In Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2009) (pp. 2284\u20132291). Rome, Italy: IEEE","DOI":"10.1109\/IPDPS.2009.5161124"},{"key":"jitr.2012100101-3","doi-asserted-by":"crossref","unstructured":"Crainic, T., & Toulouse, M. (2008). Explicit and emergent cooperation schemes for search algorithms. In Proceedings of the Learning and Intelligent Optimization Conference (LION II) (LNCS 5313, pp. 95\u2013109). Berlin, Germany: Springer.","DOI":"10.1007\/978-3-540-92695-5_8"},{"key":"jitr.2012100101-4","article-title":"Strategies for the parallel implementation of metaheuristics","author":"V.-D.Cung","year":"2001","journal-title":"Essays and surveys in metaheuristics"},{"key":"jitr.2012100101-5","first-page":"11","article-title":"The ant colony optimization meta-heuristic","author":"M.Dorigo","year":"1999","journal-title":"New ideas in optimization"},{"key":"jitr.2012100101-6","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"jitr.2012100101-7","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"issue":"1","key":"jitr.2012100101-8","first-page":"29","article-title":"Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics","volume":"26","author":"M.Dorigo","year":"1996","journal-title":"Part B"},{"key":"jitr.2012100101-9","author":"M.Dorigo","year":"2006","journal-title":"Ant colony optimization: An introduction to ant colony optimization (Tech. Rep. No.TR\/IRIDIA\/2006-010)"},{"key":"jitr.2012100101-10","doi-asserted-by":"publisher","DOI":"10.1007\/b99492"},{"key":"jitr.2012100101-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.09.016"},{"key":"jitr.2012100101-12","doi-asserted-by":"crossref","unstructured":"Eyckelhof, C., & Snoek, M. (2002). Ant systems for a dynamic TSP: Ants caught in a traffic jam. In Proceedings of the Third International Workshop on Ant Algorithms (ANTS 2002) (pp. 88-99). Springer.","DOI":"10.1007\/3-540-45724-0_8"},{"key":"jitr.2012100101-13","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00073-9"},{"key":"jitr.2012100101-14","doi-asserted-by":"crossref","unstructured":"Iantovics, B., & En\u0103chescu, C. (2009). Intelligent complex evolutionary agent-based systems. In Proceedings of the 1st International Conference on Bio-inspired Computational Methods used for Solving Difficult Problems (pp. 116-124). Springer.","DOI":"10.1063\/1.3130613"},{"key":"jitr.2012100101-15","doi-asserted-by":"crossref","unstructured":"Kang, L., Kang, Z., & Yang, M. (2008). A parallel multi-algorithm solver for dynamic multi-objective TSP (DMO-TSP). In Proceedings of the 7th WSEAS Conference (ACACOS) (pp. 288-293). Hangzhou, China: WSEAS.","DOI":"10.1007\/978-3-540-85984-0_21"},{"key":"jitr.2012100101-16","first-page":"1286","article-title":"Benchmarking algorithms for dynamic travelling salesman problems.","volume":"2","author":"L.Kang","year":"2004","journal-title":"Congress on Evolutionary Computation"},{"key":"jitr.2012100101-17","author":"E.Lawler","year":"1985","journal-title":"The travelling salesman problem"},{"key":"jitr.2012100101-18","doi-asserted-by":"crossref","unstructured":"Liu, H., Li, P., & Wen, Y. (2006, June 21-23). Parallel ant colony optimization algorithm. In Proceedings of the 6th World Congress on Intelligent Control and Automation, Dalian, China (pp. 3222-3226).","DOI":"10.1109\/WCICA.2006.1712962"},{"key":"jitr.2012100101-19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24680-0_161"},{"key":"jitr.2012100101-20","doi-asserted-by":"crossref","unstructured":"Manfrin, M., Birattari, M., St\u00fctzle, T., & Dorigo, M. (2006). Parallel ant colony optimization for the traveling salesman problem. In L. M. M. Dorigo (Ed.), Proceedings of the 5th International Workshop Ant Colony Optimization and Swarm Intelligence (ANTS 2006) (Vol. 4150, pp. 224-234).","DOI":"10.1007\/11839088_20"},{"key":"jitr.2012100101-21","unstructured":"MPICH2. (n.d.). Retrieved May 12, 2012, from http:\/\/www.mcs.anl.gov\/research\/projects\/mpich2\/"},{"key":"jitr.2012100101-22","unstructured":"Pintea, C., Pop, P., & Dumitrescu, D. (2007). An ant-based technique for the dynamic generalized traveling salesman problem. In Proceeding of the 7-th WSEAS International Conference on Systems Theory and Scientific Computation (pp. 257-261). Hanzhou, China: WSEAS."},{"issue":"1","key":"jitr.2012100101-23","first-page":"94","article-title":"Combining heuristics and modifying local information to guide ant-based search.","volume":"24","author":"C.-M.Pintea","year":"2008","journal-title":"Carpathian Journal of Mathematics"},{"key":"jitr.2012100101-24","doi-asserted-by":"crossref","unstructured":"Pop, C., Pintea, C., Sitar, C., & Dumitrescu, D. (2007). A bio-inspired approach for a dynamic railway problem. In Proceedings of the Ninth. Symposium on Symbolic and Numeric Algorithms for Scientific Computing (pp. 449-452). IEEE C.S. Press.","DOI":"10.1109\/SYNASC.2007.27"},{"issue":"11","key":"jitr.2012100101-25","first-page":"373","article-title":"An ant colony algorithm for solving the dynamic generalized vehicle routing problem.","volume":"1","author":"P.Pop","year":"2009","journal-title":"Civil Engineering (New York, N.Y.)"},{"key":"jitr.2012100101-26","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2002.1854"},{"issue":"2","key":"jitr.2012100101-27","first-page":"77","article-title":"Parallel ant colony optimization.","volume":"1","author":"A.Sameh","year":"2010","journal-title":"International Journal of Research and Reviews in Computer Science"},{"key":"jitr.2012100101-28","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T. (1998). Parallelization strategies for ant colony optimization. In Proceedings of Fifth International Conference on Parallel Problem Solving from Nature (PPSN-V) (Vol. 1498, pp. 722-731). Springer-Verlag.","DOI":"10.1007\/BFb0056914"},{"key":"jitr.2012100101-29","unstructured":"St\u00fctzle, T. (2004). Public Software. Retrieved May 12, 2012, from http:\/\/www.aco-metaheuristic.org\/aco-code"},{"key":"jitr.2012100101-30","first-page":"163","article-title":"ACO algorithms for the traveling salesman problem","author":"T.St\u00fctzle","year":"1999","journal-title":"Evolutionary algorithms in engineering and computer science"},{"key":"jitr.2012100101-31","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"jitr.2012100101-32","unstructured":"TSPLIB. (n.d.). Retrieved May 12, 2012, from http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"jitr.2012100101-33","unstructured":"Yan, X., Kang, L., Cai, Z., & Li, H. (2004). An approach to dynamic traveling salesman problem. In Proceedings of the Third International Conference on Machine Learning and Cybernetics (pp. 2418-2420). IEEE Press."}],"container-title":["Journal of Information Technology Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=76386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T23:50:54Z","timestamp":1745970654000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jitr.2012100101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,10,1]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jitr.2012100101","relation":{},"ISSN":["1938-7857","1938-7865"],"issn-type":[{"value":"1938-7857","type":"print"},{"value":"1938-7865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,1]]}}}