Corrigendum to “Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression”

Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2015, Article ID 378087, 3 pages http://dx.doi.org/10.1155/2015/378087 Corrigendum Corrigendum to ‘‘Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression’’ Stephen M. Akandwanaho, Aderemi O. Adewumi, and Ayodele A. Adebiyi School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, University Road, Westville, Private Bag X 54001, Durban, 4000, South Africa Correspondence should be addressed to Stephen M. Akandwanaho; Received 6 May 2015; Accepted 21 May 2015 Copyright © 2015 Stephen M. Akandwanaho et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In the references section of the published paper entitled “Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression,” we wrongly cited reference [23] W. Kongkaew and J. Pichitlamken, A Gaussian Process Regression Model for the Traveling Salesman Problem, Faculty of Engineering, Kasetsart University, Bangkok, Thailand, 2012. Correct reference [23] is W. Kongkaew and J. Pichitlamken, “A Gaussian process regression model for the traveling salesman problem,” Journal of Computer Science, vol. 8, no. 10, pp. 1749–1758, 2012. We also did not include the journal volume number in reference [1] A. Simões and E. Costa, “Prediction in evolutionary algorithms for dynamic environments,” Soft Computing, pp. 306–315, 2013. Correct reference [1] is A. Simões and E. Costa, “Prediction in evolutionary algorithms for dynamic environments,” Soft Computing, vol. 18, pp. 306–315, 2013. We did not include the editors in reference [2] J. Branke, T. Kaussler, H. Schmeck, and C. Schmidt, A Multi-Population Approach to Dynamic Optimization Problems, 2000. Correct reference [2] is J. Branke, T. Kaussler, H. Schmeck, and C. Schmidt, “A multi-population approach to dynamic optimization problems,” in Adaptive Computing in Design and Manufacturing, I. C. Parmee, Ed., pp. 299–308, Springer, 2000. We did not include editors and page numbers in reference [5] C. Jarumas and J. Pichitlamken, “Solving the traveling salesman problem with Gaussian process regression,” in Proceedings of the International Conference on Computing and Information Technology, 2011. Right reference [5] is J. Chantapanich and J. Pichitlamken, “Solving the traveling salesman problem with Gaussian process regression,” in Proceedings of the 7th International Conference on Computing and Information Technology, D. Gautam, V. P. Gulati, Eds., pp. 42–46, 2011. We did not include the nature of the reference in reference [6] K. Weicker, Evolutionary Algorithms and Dynamic Optimization Problems, University of Stuttgart, Stuttgart, Germany, 2003. Corrected reference [6] is as follows: K. Weicker, Evolutionary algorithms and dynamic optimization problems [Ph.D. Thesis], University of Stuttgart, Stuttgart, Germany, 2003. We did not include editors and page numbers in reference [7] K. Menger, “Das botenproblem,” Ergebnisse Eines Mathematischen Kolloquiums 2, Teubner, Leipzig, 1932. Corrected reference [7] is K. Menger, “Das botenproblem,” in Ergebnisse Eines Mathematischen Kolloquiums 2, D. Egbert, S. Karl, Eds., pp. 11–12, Teubner, Leipzig, Germany, 1932. We did not include editors and page numbers in reference [9] A. Hoffman and P. Wolfe, “History, the traveling salesman problem,” in A Guided Tour of Combinatorial Optimization, Wiley, Chichester, UK, 1985. Right reference [9] is A. Hoffman and P. Wolfe, “History, the traveling salesman problem,” in A Guided Tour of Combinatorial Optimization, E. I. Lawler, I. K. Lenstra, A. H. G. R. Kan, D. B. Shimoys, Eds., pp. 1–17, Wiley, Chichester, UK, 1985. We wrongly cited reference [10] A. Punnen, “The traveling salesman problem: applications, formulations and variations,” in The Traveling Salesman Problem: Applications, Formulations and Variations, Combinatorial Optimization, 2002. Corrected reference [10] is A. Punnen, “The traveling salesman problem: applications, formulations and variations,” in The Traveling Salesman Problem: Applications, Formulations and Variations, G. Gutin, Ed., vol. 12, pp. 1–28, Springer, 2007. 2 We wrongly cited reference [11] E. Ozcan and M. Erenturk, A Brief Review of Memetic Algorithms for Solving Euclidean 2D Traveling Salesrep Problem, Department of Computer Engineering, Yeditepe University, Istanbul, Turkey.” Right reference [11] is E. Ozcan and M. Erenturk, “A brief review of memetic algorithms for solving Euclidean 2D traveling salesrep Problem,” in Proceedings of the 13th Turkish Symposium on Artificial Intelligence and Neural Networks, S. Kollias, Ed., pp. 99–108, 2004. We wrongly cited reference [13] P. Miliotis, Integer Programming Approaches to the Traveling Salesman Problem, University of London, London, UK, 2012. Correct reference [13] is P. Miliotis, “Integer programming approaches to the traveling salesman problem,” Mathematical Programming, vol. 10, no. 1, pp 367–378, 1976. We wrongly cited reference [15] S. Gharan and A. Saberi, The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus, Springer, Berlin, Germany, 2012. Corrected reference [15] is S. Gharan and A. Saberi, “The asymmetric traveling salesman problem on graphs with bounded genus,” in Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, D. Randall, Ed., pp. 967–975, 2011. We did not include editor in reference [16] P. Collard, C. Escazut, and A. Gaspar, “Evolutionary approach for time dependent optimization,” in Proceedings of the IEEE 8th International Conference on Tools with Artificial Intelligence, pp. 2–9, November 1996. Corrected reference [16] is P. Collard, C. Escazut, and A. Gaspar, “Evolutionary approach for time dependent optimization,” in Proceedings of the IEEE 8th International Conference on Tools with Artificial Intelligence, C. S. Mellish, Ed., pp. 2–9, November 1996. We did not include editors, page numbers, and journal name in reference [17] H. Psaraftis, “Dynamic vehicle routing problems,” Vehicle Routing: Methods and Studies, 1988. Corrected reference [17] is H. Psaraftis, “Dynamic vehicle routing problems,” in Vehicle Routing: Methods and Studies, B. I. Golden and A. A. Assad, Eds., Elsevier, pp. 223–247, 1988. We did not include editors in reference [18] M. Yang, C. Li, and L. Kang, “A new approach to solving dynamic traveling salesman problems,” Simulated Evolution and Learning, vol. 4247 of Lecture Notes in Computer Science, pp. 236–243, Springer, Berlin, Germany, 2006. Corrected reference [18] is M. Yang, C. Li, and L. Kang, “A new approach to solving dynamic traveling salesman problems,” in Simulated Evolution and Learning, T. D. Wang, X. Li, S. Chen, X. Wang, H. Abbass, H. Iba, G. L. Chen and X. Yao, Eds., vol. 4247 of Lecture Notes in Computer Science, pp. 236–243 (...truncated)