JAM
Journal of Applied Mathematics
1687-0042
1110-757X
Hindawi Publishing Corporation
10.1155/2015/378087
378087
Corrigendum
Corrigendum to “Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression”
http://orcid.org/0000-0002-1520-1847
Akandwanaho
Stephen M.
Adewumi
Aderemi O.
Adebiyi
Ayodele A.
School of Mathematics, Statistics and Computer Science
University of KwaZulu-Natal
University Road, Westville, Private Bag X 54001, Durban, 4000
South Africa
ukzn.ac.za
2015
3152015
2015
06
05
2015
21
05
2015
3152015
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.
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, Springer, Berlin, Germany, 2006.
We did not include editors and page numbers in reference [20] E. Osaba, R. Carballedo, F. Diaz, and A. Perallos, “Simulation tool based on a memetic algorithm to solve a real instance of a dynamic tsp,” in Proceedings of the IASTED International Conference Applied Simulation and Modelling, 2012. Right reference [20] is E. Osaba, R. Carballedo, F. Diaz, and A. Perallos, “Simulation tool based on a memetic algorithm to solve a real instance of a dynamic tsp,” in Proceedings of the IASTED International Conference Applied Simulation and Modelling, A. Bruzzone, M. H. Hamza, Eds., pp. 27–33, 2012.
We did not include the number of edition in reference [21] R. Battiti and M. Brunato, The Lion Way Machine Learning Plus Intelligent Optimization, Lionsolver, June 2013. Corrected reference [21] is R. Battiti and M. Brunato, The Lion Way Machine Learning Plus Intelligent Optimization, Lionsolver, 1st edition, June 2013.
We did not state the nature of the reference and web address in reference [22] D. Chuong, Gaussian Processes, Stanford University, Palo Alto, Calif, USA, 2007. Right reference [22] is D. Chuong, Gaussian Processes, Lecture Notes, Stanford University, Palo Alto, Calif, USA, 2007, Retrieved from http://see.stanford.edu/materials/aimlcs229/cs229-gp.pdf.
We wrongly cited reference [24] C. Rasmussen and C. Williams, The MIT Press, Cambridge, UK, 2006. Corrected reference [24] is C. Rasmussen and C. Williams, Gaussian Processes for Machine Learning, The MIT Press, Cambridge, Mass, USA, 3rd edition, 2006.
We did not include editors in reference [27] F. Sinz, J. Candela, G. Bakir, C. Rasmussen, and M. Franz, “Learning depth from stereo,” in Pattern Recognition, vol. 3175 of Lecture Notes in Computer Science, pp. 245–252, Springer, Berlin, Germany, 2004. Right reference [27] is F. Sinz, J. Candela, G. Bakir, C. Rasmussen, and M. Franz, “Learning depth from stereo,” in Pattern Recognition, H. Bulthoff, B. Scholkopf, M. Giese and C. E. Rasmussen, Eds., vol. 3175 of Lecture Notes in Computer Science, pp. 245–252, Springer, Berlin, Germany, 2004.
We did not include editor in reference [28] J. Ko, D. J. Klein, D. Fox, and D. Haehnel, “Gaussian processes and reinforcement learning for identification and control of an autonomous blimp,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA ’07), pp. 742–747, Roma, Italy, April 2007. Corrected reference [28] is J. Ko, D. J. Klein, D. Fox, and D. Haehnel, “Gaussian processes and reinforcement learning for identification and control of an autonomous blimp,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA ’07), S. Hutchinson, Ed., pp. 742–747, Roma, Italy, April 2007.
We did not include editor in reference [29] T. Idé and S. Kato, “Travel-time prediction using Gaussian process regression: a trajectory-based approach,” Proceedings of the 9th SIAM International Conference on Data Mining 2009 (SDM ’09), pp. 1177–1188, May 2009. Corrected reference [29] is T. Idé and S. Kato, “Travel-time prediction using Gaussian process regression: a trajectory-based approach,” in Proceedings of the 9th SIAM International Conference on Data Mining 2009 (SDM ’09), H. Park Ed., pp. 1177–1188, May 2009.
We did not include “Retrieved from” in reference [30] G. Reinelt, “Tsplib discrete and combinatorial optimization,” 1995, https://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95. Corrected reference [30] is G. Reinelt, “Tsplib discrete and combinatorial optimization,” 1995, Retrieved from https://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95.
We wrongly cited reference [32] D. Higdon, J. Swall, and J. Kern, Non-Stationary Spatial Modeling, Oxford University Press, New York, NY, USA, 1999. Corrected reference [32] is D. Higdon, J. Swall, and J. Kern, “Non-stationary spatial modeling,” in Bayesian Statistics, J. M. Bernardo, J. O. Berger, A. P. Dawid and A. F. M. Smith, Eds., pp. 50–230, Oxford University Press, 1998.
We did not include editors in reference [33] C. Plagemann, K. Kersting, and W. Burgard, “Nonstationary Gaussian process regression using point estimates of local smoothness,” Machine Learning and Knowledge Discovery in Databases, vol. 5212 of Lecture Notes in Computer Science, no. 2, pp. 204–219, Springer, Berlin, Germany, 2008. Corrected reference [33] is C. Plagemann, K. Kersting, and W. Burgard, “Nonstationary Gaussian process regression using point estimates of local smoothness,” in Machine Learning and Knowledge Discovery in Databases, D. Walter, M. Katharina, Eds., vol. 5212 of Lecture Notes in Computer Science, no. 2, pp. 204–219, Springer, Berlin, Germany, 2008.
We did not state the web address in reference [34] G. Reinelt, “The tsplib symmetric traveling salesman problem instances,” 1995. Corrected reference [34] is G. Reinelt, “The tsplib symmetric traveling salesman problem instances,” 1995, Retrieved from http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsp/index.html. We cited wrongly reference [35] J. Kirk, Matlab Central. Corrected reference [35] is J. Kirk, “Traveling salesman problem-genetic algorithm,” 2007, Retrieved from http://www.mathworks.com/matlabcentral.
We did not include the web address in reference [37] A. Seshadri, “Traveling Salesman Problem (TSP) Using Simulated Annealing,” IEEE, 2006. Corrected reference [37] is A. Seshadri, “Traveling Salesman Problem (TSP) Using Simulated Annealing,” 2006, Retrieved from http://www.mathworks.com/matlabcentral/fileexchange/9612-traveling-salesman-problem-tsp-using-simulated-annealing.
We wrongly cited reference [38] M. Nuhoglu, “Shortest path heuristics (nearest neighborhood, 2 opt, farthest and arbitrary insertion) for travelling salesman problem,” 2007. Corrected reference is M. Nuhoglu, “Shortest path heuristics (nearest neighborhood, 2 opt, farthest and arbitrary insertion) for travelling salesman problem,” 2007, Retrieved from http://snipplr.com/view/4064/shortest-path-heuristics-nearest-neighborhood-2-opt-farthest-and-arbitrary-insertion-for-travelling-salesman-problem.