Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2011, Article ID 483643, 31 pages
http://dx.doi.org/10.1155/2011/483643
Research Article

Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

Department of Aerospace Engineering, College Station, Texas A&M University, TX 77843, USA

Received 2 May 2010; Revised 21 October 2010; Accepted 24 February 2011

Academic Editor: Dane Quinn

Copyright © 2011 Giovanni Giardini and Tamás Kalmár-Nagy. 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.

Linked References

  1. E. T. Baumgartner, “In-situ exploration of Mars using rover systems,” in Proceedings of the AIAA Space 2000 Conference, Long Beach, Calif, USA, 2000.
  2. S. Hayati, V. Volpe, P. Backes et al., “Rocky 7 rover: a Mars sciencecraft prototype,” in Proceedings of the IEEE International Conference on Robotics and Automation, vol. 3, pp. 2458–2464, Albuquerque, NM, USA, 1997.
  3. Mars Exploration Rover Missions, http://marsrovers.nasa.gov/home/.
  4. Sojourner Rover Home Page, http://mpfwww.jpl.nasa.gov/rover/sojourner.html.
  5. A. Birk and S. Carpin, “Rescue robotics—a crucial milestone on the road to autonomous systems,” Advanced Robotics, vol. 20, no. 5, pp. 595–605, 2006. View at Publisher · View at Google Scholar
  6. S. Sariel and H. Akin, “A novel search strategy for autonomous search and rescue robots,” in RoboCup 2004: Robot Soccer World Cup VII, D. Nardi, M. Riedmiller, C. Sammut et al., Eds., vol. 3276/2005, pp. 459–466, Springer, New York, NY, USA, 2005. View at Google Scholar
  7. G. Muscato, F. Russo, and D. Caltabiano, “Localization and self-calibration of a robot for volcano exploration,” in Proceedings of the IEEE International Conference on Robotics and Automation, vol. 1, 2004.
  8. S. Carpin, J. Wang, M. Lewis, A. Birk, and A. Jacoff, “High fidelity tools for rescue robotics: results and perspectives,” in RoboCup 2005: Robot Soccer World Cup IX, vol. 4020 of Lecture Notes in Computer Science, pp. 301–311, 2006.
  9. A. Jacoff, E. Messina, and J. Evans, Experiences in Deploying Test Arenas for Autonomous Mobile Robots, NIST Special, Gaithersburg, Md, USA, 2002.
  10. H. Kitano, “RoboCup-97: robot soccer world cup I,” Lectures Notes in Computer Science, vol. 1395 of Lecture Note in Artificial Intelligence, Springer, Berlin, Germany, 1998. View at Google Scholar
  11. T. Kalmár-Nagy, R. D'Andrea, and P. Ganguly, “Near-optimal dynamic trajectory generation and control of an omnidirectional vehicle,” Robotics and Autonomous Systems, vol. 46, no. 1, pp. 47–64, 2004. View at Publisher · View at Google Scholar
  12. M. Ai-Chang, J. Bresina, L. Charest et al., “Mapgen: mixed-initiative planning and scheduling for the mars exploration rover mission,” IEEE Intelligent Systems, vol. 19, no. 1, pp. 8–12, 2004. View at Publisher · View at Google Scholar
  13. P. Maldague, A. Ko, D. Page, and T. Starbird, “APGEN: a multi-mission semi-automated planning tool,” in Proceedings of the 1st International NASA Workshop on Planning and Scheduling (AIAA '97), A. press, Ed., 1997.
  14. N. Muscettola, P. P. Nayak, B. Pell, and B. C. Williams, “Remote agent: to boldly go where no AI system has gone before,” Artificial Intelligence, vol. 103, no. 1-2, pp. 5–47, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. K. H. Low, W. K. Leow, and M. H. Ang Jr., “A hybrid mobile robot architecture with integrated planning and control,” in Proceedings of the International Conference on Autonomous Agents, pp. 219–226, ACM Press, Bologna, Italy, 2002.
  16. R. Sherwood, A. Mishkin, S. Chien et al., “An integrated planning and scheduling prototype for automated Mars rover command generation,” Jet propulsion laboratory, california institute of technology, NASA, 2001.
  17. S. M. LaValle, Planning Algorithms, Cambridge University Press, Cambridge, UK, 2006. View at Publisher · View at Google Scholar
  18. A. Sipahioglu, A. Yazici, O. Parlaktuna, and U. Gurel, “Real-time tour construction for a mobile robot in a dynamic environment,” Robotics and Autonomous Systems, vol. 56, no. 4, pp. 289–295, 2008. View at Publisher · View at Google Scholar
  19. P. Tompkins, A. Stentz, and D. Wettergreen, “Mission-level path planning and re-planning for rover exploration,” Robotics and Autonomous Systems, vol. 54, no. 2, pp. 174–183, 2006. View at Publisher · View at Google Scholar
  20. J. Xiao, Z. Michalewicz, L. Zhang, and K. Trojanowski, “Adaptive evolutionary planner/navigator for mobile robots,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 18–28, 1997. View at Google Scholar
  21. K. Savla, F. Bullo, and E. Frazzoli, “On traveling salesperson problems for dubins' vehicle: stochastic and dynamic environments,” in Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference (CDC-ECC '05), vol. 2005, pp. 4530–4535, 2005. View at Publisher · View at Google Scholar
  22. G. Giardini and T. Kalmár-Nagy, “Centralized and distributed path planning for multi-agent exploration,” in Proceedings of the AIAA Guidance, Navigation, and Control Conference, vol. 3, pp. 2701–2712, 2007.
  23. M. G. Earl and R. D'Andrea, “A decomposition approach to multi-vehicle cooperative control,” Robotics and Autonomous Systems, vol. 55, no. 4, pp. 276–291, 2007. View at Publisher · View at Google Scholar
  24. G. Gutin and A. Punnen, The Traveling Salesman Problem and Its Variations, vol. 12 of Combinatorial Optimization, Kluwer Academic, Dordrecht, The Netherlands, 2002.
  25. Traveling Salesman Problem, http://www.tsp.gatech.edu/.
  26. D. S. Johnson and L. A. McGeoch, “The traveling salesman problem: a case study,” in Local Search in Combinatorial Optimization, pp. 215–310, John Wiley & Sons, Chichester, UK, 1997. View at Google Scholar · View at Zentralblatt MATH
  27. D. H. Gensch, “An industrial application of the traveling Salesman's subtour problem,” IIE Transactions, vol. 10, no. 4, pp. 362–370, 1978. View at Publisher · View at Google Scholar
  28. G. Laporte and S. Martello, “The selective travelling salesman problem,” Discrete Applied Mathematics, vol. 26, no. 2-3, pp. 193–207, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. B. Verweij and K. Aardal, “The merchant subtour problem,” Mathematical Programming, vol. 94, no. 2-3, pp. 295–322, 2003, The Aussois 2000 Workshop in Combinatorial Optimizatio. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. A. Westerlund, Decomposition schemes for the traveling salesman subtour problem, Ph.D. thesis, Linkopings University, Linkopings, Sweden, 2002.
  31. A. Westerlund, M. Göthe-Lundgren, and T. Larsson, “A stabilized column generation scheme for the traveling salesman subtour problem,” Discrete Applied Mathematics, vol. 154, no. 15, pp. 2212–2238, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. T. Bäck, Evolutionary Algorithms in Theory and Practice, The Clarendon Press Oxford University Press, New York, NY, USA, 1996.
  33. T. Bäck, D. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation, Institute of Physics Publishing, Bristol, UK, 1997. View at Publisher · View at Google Scholar
  34. A. E. Carter, Design and application of genetic algorithms for the multiple traveling salesperson assignment problem, Ph.D. thesis, Department of Management Science and Information Technology, Virginia Polytechnic Institute and State University, Virginia, Va, USA, 2003.
  35. A. E. Carter and C. T. Ragsdale, “A new approach to solving the multiple traveling salesperson problem using genetic algorithms,” European Journal of Operational Research, vol. 175, no. 1, pp. 246–257, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. J. Kubalík, J. Kléma, and M. Kulich, “Application of soft computing techniques to rescue operation planning,” in Proceedings of the 4th IEEE International Conference on Intelligent Systems Design and Application, vol. 3070 of Lecture Notes in Artificial Intelligence, pp. 897–902, Budapest, Hungary, 2004.
  37. K. Bryant, Genetic algorithms and the traveling salesman problem, Ph.D. thesis, Department of Mathematics, Harvey Mudd College, Claremont, Calif, USA, 2000.
  38. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Boston, Mass, USA, 1989.
  39. K. Katayama, H. Sakamoto, and H. Narihisa, “The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem,” Mathematical and Computer Modelling, vol. 31, no. 10–12, pp. 197–203, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  40. The VRP, http://neo.lcc.uma.es/radi-aeb/WebVRP/.
  41. F. Pereira, J. Tavares, P. Machado, and E. Costa, “GVR: a new genetic representation for the vehicle routing problem,” in Proceedings of the Artificial Intelligence and Cognitive Science, Lecture Notes in Computer Science, pp. 95–102, 2002. View at Publisher · View at Google Scholar
  42. T. K. Ralphs, L. Kopman, W. R. Pulleyblank, and L. E. Trotter, “On the capacitated vehicle routing problem,” Mathematical Programming, vol. 94, no. 2-3, pp. 343–359, 2003, The Aussois 2000 Workshop in Combinatorial Optimizatio. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  43. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London, UK, 1976.
  44. R. Diestel, Graph Theory, vol. 173 of Graduate Texts in Mathematics, Springer, Berlin, Germany, 3rd edition, 2005.
  45. S. Hong and M. W. Padberg, “A note on the symmetric multiple traveling salesman problem with fixed charges,” Operations Research, vol. 25, no. 5, pp. 871–874, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  46. E. Balas and P. Toth, “Branch and bound methods,” in The Traveling Salesman Problem, pp. 361–401, Wiley, Chichester, UK, 1985. View at Google Scholar · View at Zentralblatt MATH
  47. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, Chichester, UK, 1986, A Wiley-Interscience Publicatio.
  48. S. Tschoke, R. Luling, and B. Monien, “Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network,” in Proceedings of the 9th IEEE Symposium on Parallel and Distributed Processing, pp. 182–189, 1995.
  49. S. R. Thangiah, “Vehicle routing with time windows using genetic algorithms,” in Application Handbook of Genetic Algorithms: New Frontiers, L. Chambers, Ed., vol. 2, pp. 253–277, CRC Press, Boca Raton, Fla, USA, 1995. View at Google Scholar
  50. Y. Chen and P. Zhang, “Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution,” Physica A: Statistical Mechanics and its Applications, vol. 371, no. 2, pp. 627–632, 2006. View at Publisher · View at Google Scholar
  51. M. Rocha and J. Neves, “Preventing premature convergence to local optima in Genetic Algorithms via random offspring generation,” in Proceedings of the 12th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems: Multiple Approaches to Intelligent Systems, Cairo, Egypt, 1999.
  52. M. Affenzeller and S. Wagner, “SASEGASA: an evolutionary algorithm for retarding premature convergence by self-adaptive selection pressure steering,” in Computational Methods in Neural Modeling, vol. 2686 of Lecture Notes in Computer Science, pp. 438–445, Springer, New York, NY, USA, 2003. View at Google Scholar
  53. V. Kureichick, A. N. Melikhov, V. V. Miaghick, O. V. Savelev, and A. P. Topchy, “Some new features in genetic solution of the traveling salesman problem,” in Proceedings of the 2nd International Conference of the Integration of Genetic Algorithms and Neural Network Computing and Related Adaptive Computing with Current Engineering Practice, I. Parmee and M. J. Denham, Eds., Adaptive Computing in Engineering Design and Control 96, Plymouth, UK, 1996.
  54. M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, Cambridge, Mass, USA, 1996.
  55. M. Matayoshi, M. Nakamura, and H. Miyagi, “A genetic algorithm with the improved 2-opt method,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 4, pp. 3652–3658, 2004.
  56. J. L. Bentley, “Experiments on traveling salesman heuristics,” in Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 1990.
  57. H. Sengoku and I. Yoshihara, “A fast TSP solver using GA on JAVA,” in Proceedings of the 3rd International Symposium on Artificial Life, and Robotics (AROB '98), 1998.
  58. J. Watson, C. Ross, V. Eisele et al., “The traveling salesman problem, edge assembly crossover, and 2-opt,” in Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, Springer, Amsterdam, Netherlands, 1998.
  59. Reinelt, “TSPLIB. A traveling salesman problem library,” ORSA Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  60. G. Giardini and T. Kalmár-Nagy, “Performance metrics and evaluation of a path planner based on genetic algorithms,” in Proceedings of the Performance Metrics for Intelligent SystemsWorkshop (PerMIS '07), pp. 84–90, ACM Press, New York, NY, USA, 2007.
  61. M. Padberg and G. Rinaldi, “Optimization of a 532-city symmetric traveling salesman problem by branch and cut,” Operations Research Letters, vol. 6, no. 1, pp. 1–7, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  62. U. Yoshiyuki and K. Yoshiki, “New method of solving the traveling salesman problem based on real space renormalization theory,” Physical Review Letters, vol. 75, no. 9, pp. 1683–1686, 1995. View at Publisher · View at Google Scholar
  63. P. Merz and B. Freisleben, “Memetic algorithms for the traveling salesman problem,” Complex Systems, vol. 13, no. 4, pp. 297–345, 2001. View at Google Scholar · View at Zentralblatt MATH
  64. H. Tsai, J. Yang, and C. Kao, “Solving travelling salesman problems by combining global and local search mechanisms,” in Proceedings of the Congress on Evolutionary Computation, vol. 2, 2002.
  65. R. Ugajin, “Method to solve the travelling salesman problem using the inverse of diffusion process,” Physica A. Statistical Mechanics and its Applications, vol. 307, no. 1-2, pp. 260–268, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  66. H. Yi, L. Guangyuan, and Q. Yuhui, “A parallel tabu search algorithm based on partitioning principle for TSPs,” IJCSNS, vol. 6, no. 8, pp. 146–150, 2006. View at Google Scholar
  67. Concorde TSP Solver, http://www.tsp.gatech.edu/concorde.html.