Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017, Article ID 3813912, 12 pages
https://doi.org/10.1155/2017/3813912
Research Article

The Multiagent Planning Problem

1Department of Fluid Mechanics, Faculty of Mechanical Engineering, Budapest University of Technology and Economics, Budapest, Hungary
2SPS Italiana Pack Systems, Novara, Italy

Correspondence should be addressed to Tamás Kalmár-Nagy; moc.yganramlak@ytixelpmoc

Received 31 July 2016; Revised 17 December 2016; Accepted 4 January 2017; Published 5 February 2017

Academic Editor: Roberto Natella

Copyright © 2017 Tamás Kalmár-Nagy 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.

Linked References

  1. NASA, Mars Exploration Rover missions, January 2010, http://marsrovers.nasa.gov.
  2. S. Hayati, R. Volpe, P. Backes et al., “The Rocky 7 rover: a Mars sciencecraft prototype,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '97), vol. 4, Albuquerque, NM, USA, April 1997. View at Scopus
  3. E. T. Baumgartner, “In-situ exploration of Mars using rover systems,” in Proceedings of the AIAA Space 2000 Conference, 2000-5062, Long Beach, Calif, USA, September 2000.
  4. 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 · View at Scopus
  5. S. Sarieland and H. L. Akin, “A novel search strategy for autonomous search and rescue robots,” in Robo Cup 2004: Robot Soccer World Cup VIII, vol. 3276, pp. 459–466, Springer, Berlin, Germany, 2005. View at Google Scholar
  6. A. Jacoff, E. Messina, and J. Evans, “Experiences in deploying test arenas for autonomous mobile robots,” in NIST Special Publication, pp. 87–94, 2002. View at Google Scholar
  7. 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, pp. 301–311, 2006. View at Google Scholar
  8. 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, pp. 2701–2712, Hilton Head Island, SC, USA, August 2007. View at Scopus
  9. G. Giardini and T. Kalmár-Nagy, “Genetic algorithm for multi-agent space exploration,” in Proceedings of the AIAA infoTech at Aerospace Conference, vol. 2, pp. 1146–1160, May 2007.
  10. S. Mitrovic-Minic and R. Krishnamutri, “The Multiple Traveling Salesman Problem with Time Windows: bounds for the minimum number of vehicles,” Tech. Rep. TR 2002-11, FU CS School, 2002. View at Google Scholar
  11. T. Bektas, “The multiple traveling salesman problem: an overview of formulations and solution procedures,” Omega, vol. 34, no. 3, pp. 209–219, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. 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 · View at MathSciNet
  13. A. Singh and A. S. Baghel, “A new grouping genetic algorithm approach to the multiple traveling salesperson problem,” Soft Computing, vol. 13, no. 1, pp. 95–101, 2009. View at Publisher · View at Google Scholar
  14. D. S. Johnson and L. A. McGeoch, “The Traveling Salesman Problem: a case study in local optimization,” in Local Search in Combinatorial Optimization, pp. 215–310, 1997. View at Google Scholar
  15. GaTech, Traveling Salesman Problem, January 2010, http://www.tsp.gatech.edu.
  16. G. Gutin and A. Punnen, The Traveling Salesman Problem and Its Variations, vol. 12 of Combinatorial Optimizations, Kluwer Academic, Norwell, Mass, USA, 2002.
  17. A. E. Carter and C. T. Ragsdale, “Scheduling pre-printed newspaper advertising inserts using genetic algorithms,” Omega, vol. 30, no. 6, pp. 415–421, 2002. View at Publisher · View at Google Scholar · View at Scopus
  18. A. T. Stentz and B. Brummit, “GRAMMPS: a generalized mission planner for multiple mobile robots,” in Proceedings of the IEEE International Conference on Robotics and Automation, May 1998.
  19. A. T. Stentz and B. Brummit, “Dynamic mission planning for multiple mobile robots,” in Proceedings of the IEEE International Conference on Robotics and Automation, April 1996.
  20. Z. Yu, L. Jinhai, G. Guochang, Z. Rubo, and Y. Haiyan, “An implementation of evolutionary computation for path planning of cooperative mobile robots,” in Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 3, pp. 1798–1802, Shanghai, China, June 2002. View at Scopus
  21. UMA, The VRP Web, January 2009, http://neo.lcc.uma.es/radi-aeb/WebVRP.
  22. F. B. Pereira, J. Tavares, P. Machado, and E. Costa, “GVR: a new genetic representation for the vehicle routing problem,” in Proceedings of the 13th Irish Conference on Artificial Intelligence and Cognitive Science (AICS '02), pp. 95–102, Limerick Ireland, September 2002. View at Scopus
  23. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London, UK, 1976. View at MathSciNet
  24. R. Diestel, Graph Theory, Springer, 2005. View at MathSciNet
  25. G. Giardini and T. Kalmár-Nagy, “Genetic algorithm for combinatorial path planning: the subtour problem,” Mathematical Problems in Engineering, vol. 2011, Article ID 483643, 31 pages, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. 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 IEEE 9th International Parallel Processing Symposium, pp. 182–189, Santa Barbara, Calif, USA, April 1995. View at Publisher · View at Google Scholar · View at Scopus
  27. E. Balas and P. Toth, “Branch and bound methods for the traveling sales man problem,” Tech. Rep., DTIC Document, 1985. View at Google Scholar
  28. A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, New York, NY, USA, 1986. View at MathSciNet
  29. 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, 2003.
  30. M. Kulich, J. Kubalik, J. Klema, and J. Faigl, “Rescue operation planning by soft computing techniques,” in Proceedings of the IEEE 4th International Conference on Intelligent Systems Design and Application, pp. 103–109, Budapest, Hungary, 2004.
  31. S. Gorenstein, “Printing press scheduling for multi-edition periodicals,” Management Science, vol. 16, no. 6, pp. B-373–B-383, 1970. View at Publisher · View at Google Scholar · View at Scopus
  32. L. Tang, J. Liu, A. Rong, and Z. Yang, “A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron and Steel Complex,” European Journal of Operational Research, vol. 124, no. 2, pp. 267–282, 2000. View at Google Scholar
  33. B. Gavish and K. Srikanth, “An optimal solution method for large-scale multiple traveling salesmen problems,” Operations Research, vol. 34, no. 5, pp. 698–717, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. “First international conference on innovative computing, information and control—TOC,” in Proceedings of the First International Conference on Innovative Computing, Information and Control—Volume I (ICICIC '06), vol. 3, August 2006. View at Publisher · View at Google Scholar
  35. I. Kara and T. Bektas, “Integer linear programming formulations of multiple salesman problems and its variations,” European Journal of Operational Research, vol. 174, no. 3, pp. 1449–1458, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  36. C. S. Orloff, “Routing a fleet of M vehicles to/from a central facility,” Networks, vol. 4, no. 2, pp. 147–162, 1974. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. M. Bellmore and S. Hong, “Transformation of multisalesman problem to the standard traveling salesman problem,” Journal of the Association for Computing Machinery, vol. 21, no. 3, pp. 500–504, 1974. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  38. G. Laporte, Y. Nobert, and S. Taillefer, “A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem,” Mathematical Modelling, vol. 9, no. 12, pp. 857–868, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  39. A. I. Ali and J. L. Kennington, “The asymmetric M-travelling salesman problem: a duality based branch-and-bound algorithm,” Discrete Applied Mathematics, vol. 13, no. 2-3, pp. 259–276, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. A. S. Rostami, F. Mohanna, H. Keshavarz, and A. A. Hosseinabadi, “Solving multiple traveling salesman problem using the gravitational emulation local search algorithm,” Applied Mathematics & Information Sciences, vol. 9, no. 2, pp. 699–709, 2015. View at Google Scholar · View at MathSciNet
  41. D. Sofge, A. Schultz, and K. De Jong, “Evolutionary computational approaches to Solving the Multiple Traveling Salesman Problem using a neighborhood attractor schema,” in Applications of Evolutionary Computing, vol. 2279, pp. 153–162, Springer, 2002. View at Google Scholar
  42. B. Na, Heuristics for no-depot multiple traveling salesmen problem with minmax objective [M.S. thesis], H. Milton School of Industrial and Engineering, Georgia Institute of Technology, Atlanta, Ga, USA, May 2006.
  43. 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 · View at Scopus
  44. E. C. Brown, C. T. Ragsdale, and A. E. Carter, “A grouping genetic algorithm for the multiple traveling salesperson problem,” International Journal of Information Technology and Decision Making, vol. 6, no. 2, pp. 333–347, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  45. M. T. Shirafkan, H. Seidgar, J. Rezaian-Zeidi, and N. Javadian, “Using a hybrid simulated annealing and genetic algorithms for non fixed destination multi-depot multiple traveling sales men problem with time window and waiting penalty,” The Journal of Mathematics and Computer Science, vol. 4, pp. 428–435, 2012. View at Google Scholar
  46. R. I. Bolaños, M. G. Echeverry, and J. W. Escobar, “A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the multiple traveling salesman problem,” Decision Science Letters, vol. 4, no. 4, pp. 559–568, 2015. View at Publisher · View at Google Scholar · View at Scopus
  47. R. Kaliaperumal, A. Ramalingam, and J. Sripriya, “A modified Two part chromosome Crossover for solving mtsp using Genetic algorithms,” in Proceedings of the International Conference on Advanced Research in Computer Science Engineering and Technology (ICARCSET '15), Unnao, India, March 2015. View at Publisher · View at Google Scholar · View at Scopus
  48. K. Sundar and S. Rathinam, “An exact algorithm for a heterogeneous, multiple depot, multiple traveling salesman problem,” in Proceedings of the International Conference on Unmanned Aircraft Systems (ICUAS '15), pp. 366–371, Denver, Colo, USA, June 2015. View at Publisher · View at Google Scholar · View at Scopus
  49. G. Sharon, R. Stern, M. Goldenberg, and A. Felner, “The increasing cost tree search for optimal multi-agent pathfinding,” Artificial Intelligence, vol. 195, pp. 470–495, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  50. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Professional, Boston, Mass, USA, 1989.
  51. K. Bryant, Genetic algorithms and the traveling salesman problem [Ph.D. thesis], Department of Mathematics, Harvey Mudd College, Claremont, Calif, USA, 2000.
  52. 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 MathSciNet · View at Scopus
  53. 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 (SMC '04), vol. 4, pp. 3652–3658, IEEE, The Hague, The Netherlands, October 2004. View at Publisher · View at Google Scholar · View at Scopus
  54. J. L. Bentley, “Experiments on traveling salesman heuristics,” in Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 91–99, Society for Industrial and Applied Mathematics, San Francisco, Calif, USA, January 1990.
  55. 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 III '98), pp. 283–288, 1998.
  56. G. 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 Scopus
  57. Multiple Traveling Salesmen Problem—Genetic Algorithm, March 2008, http://www.mathworks.com/matlabcentral/fileexchange/.