Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 7139157, 16 pages
https://doi.org/10.1155/2017/7139157
Research Article

Optimization of Pesticide Spraying Tasks via Multi-UAVs Using Genetic Algorithm

1School of Management, Hefei University of Technology, Hefei 230009, China
2Key Laboratory of Process Optimization & Intelligent Decision-Making, Ministry of Education, Hefei 230009, China

Correspondence should be addressed to He Luo

Received 20 April 2017; Revised 23 August 2017; Accepted 1 October 2017; Published 12 November 2017

Academic Editor: Dylan F. Jones

Copyright © 2017 He Luo 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. J. Torres-Sanchez, F. López-Granados, and J. M. Peña, “An automatic object-based method for optimal thresholding in UAV images: application for vegetation detection in herbaceous crops,” Computers and Electronics in Agriculture, vol. 114, pp. 43–52, 2015. View at Publisher · View at Google Scholar · View at Scopus
  2. W.-C. Qin, B.-J. Qiu, X.-Y. Xue, C. Chen, Z.-F. Xu, and Q.-Q. Zhou, “Droplet deposition and control effect of insecticides sprayed with an unmanned aerial vehicle against plant hoppers,” Crop Protection, vol. 85, pp. 79–88, 2016. View at Publisher · View at Google Scholar · View at Scopus
  3. E. R. Araújo, D. P. Alves, and J. R. Knoth, “Weather-based decision support reduces the fungicide spraying to control onion downy mildew,” Crop Protection, vol. 92, pp. 89–92, 2017. View at Publisher · View at Google Scholar · View at Scopus
  4. P. Vansteenwegen, W. Souffriau, and D. Van Oudheusden, “The orienteering problem: a survey,” European Journal of Operational Research, vol. 209, no. 1, pp. 1–10, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. E. Edison and T. Shima, “Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms,” Computers & Operations Research, vol. 38, no. 1, pp. 340–356, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. W. Souffriau, P. Vansteenwegen, G. V. Berghe, and D. Van Oudheusden, “The multiconstraint team orienteering problem with multiple time windows,” Transportation Science, vol. 47, no. 1, pp. 53–63, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. F. Tricoire, M. Romauch, K. F. Doerner, and R. F. Hartl, “Heuristics for the multi-period orienteering problem with multiple time windows,” Computers & Operations Research, vol. 37, no. 2, pp. 351–367, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. G. Erdogan and G. Laporte, “The orienteering problem with variable profits,” Networks, vol. 61, no. 2, pp. 104–116, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. D. Gavalas, C. Konstantopoulos, K. Mastakas, G. Pantziou, and N. Vathis, “Heuristics for the time dependent team orienteering problem: Application to tourist route planning,” Computers & Operations Research, vol. 62, pp. 36–50, 2015. View at Publisher · View at Google Scholar · View at Scopus
  10. S. B. Faiçal, H. Freitas, P. Gomes H et al., “An adaptive approach for UAV-based pesticide spraying in dynamic environments,” Computers and Electronics in Agriculture, vol. 138, pp. 210–223, 2017. View at Google Scholar
  11. S.-W. Lin and V. F. Yu, “A simulated annealing heuristic for the team orienteering problem with time windows,” European Journal of Operational Research, vol. 217, no. 1, pp. 94–107, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. J. Ferreira, A. Quintas, J. A. Oliveira, G. A. B. Pereira, and L. Dias, “Solving the team orienteering problem: Developing a solution tool using a genetic algorithm approach,” Advances in Intelligent Systems and Computing, vol. 223, pp. 365–375, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. V. Roberge, M. Tarbouchi, and G. Labonte, “Comparison of parallel genetic algorithm and particle swarm optimization for real-time UAV path planning,” IEEE Transactions on Industrial Informatics, vol. 9, no. 1, pp. 132–141, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. Y. V. Pehlivanoglu, “A new vibrational genetic algorithm enhanced with a Voronoi diagram for path planning of autonomous UAV,” Aerospace Science and Technology, vol. 16, no. 1, pp. 47–55, 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. D. Feillet, P. Dejax, and M. Gendreau, “Traveling salesman problems with profits,” Transportation Science, vol. 39, no. 2, pp. 188–205, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Gendreau, G. Laporte, and F. Semet, “A branch-and-cut algorithm for the undirected selective traveling salesman problem,” Networks, vol. 32, no. 4, pp. 263–273, 1998. View at Publisher · View at Google Scholar · View at Scopus
  17. I.-M. Chao, B. L. Golden, and E. A. Wasil, “The team orienteering problem,” European Journal of Operational Research, vol. 88, no. 3, pp. 464–474, 1996. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Gunawan, H. C. Lau, and P. Vansteenwegen, “Orienteering problem: a survey of recent variants, solution approaches and applications,” European Journal of Operational Research, vol. 255, no. 2, pp. 315–332, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. S. Boussier, D. Feillet, and M. Gendreau, “An exact algorithm for team orienteering problems,” 4OR-A Quarterly Journal of Operations Research, vol. 5, no. 3, pp. 211–230, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  20. T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “Heuristics for multi-attribute vehicle routing problems: a survey and synthesis,” European Journal of Operational Research, vol. 231, no. 1, pp. 1–21, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. C. Verbeeck, P. Vansteenwegen, and E.-H. Aghezzaf, “An extension of the arc orienteering problem and its application to cycle trip planning,” Transportation Research Part E: Logistics and Transportation Review, vol. 68, pp. 64–78, 2014. View at Publisher · View at Google Scholar · View at Scopus
  22. C. C. Liao and C. H. Hsu, “A detour planning algorithm in crowdsourcing systems for multimedia content gathering,” in Proceedings of the 5th Workshop on Mobile Video (MoVid '13), pp. 55–60, February 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. M. Yuen, I. King, and K. Leung, “A Survey of Crowdsourcing Systems,” in Proceedings of the IEEE Third International Conference on Social Computing (SocialCom), pp. 766–773, Boston, MA, USA, October 2012. View at Publisher · View at Google Scholar
  24. C. Chen, S. F. Cheng, A. Gunawan, A. Misra, K. Dasgupta, and D. Chander, TRACCS: Trajectory-Aware coordinated urban Crowd-Sourcing, 2014.
  25. F. Mufalli, R. Batta, and R. Nagi, “Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans,” Computers & Operations Research, vol. 39, no. 11, pp. 2787–2799, 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. L. Evers, A. I. Barros, H. Monsuur, and A. Wagelmans, “Online stochastic UAV mission planning with time windows and time-sensitive targets,” European Journal of Operational Research, vol. 238, no. 1, pp. 348–362, 2014. View at Publisher · View at Google Scholar · View at Scopus
  27. S. Zhang, J. W. Ohlmann, and B. W. Thomas, “A priori orienteering with time windows and stochastic wait times at customers,” European Journal of Operational Research, vol. 239, no. 1, pp. 70–79, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. M. Merwe, J. Minas, M. Ozlen, J. Hearne, and M. Merwe, The cooperative orienteering problem with time windows, 2014.
  29. L. E. Dubins, “On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents,” The American Journal of Mathematics, vol. 79, no. 3, pp. 497–516, 1957. View at Publisher · View at Google Scholar · View at MathSciNet
  30. T. Shima, S. Rasmussen, and D. Gross, “Assigning micro UAVs to task tours in an urban terrain,” IEEE Transactions on Control Systems Technology, vol. 15, no. 4, pp. 601–612, 2007. View at Publisher · View at Google Scholar · View at Scopus
  31. M. Owen, R. W. Beard, and T. W. McLain, “Implementing dubins airplane paths on fixed-wing uavs,” Handbook of Unmanned Aerial Vehicles, pp. 1677–1701, 2015. View at Publisher · View at Google Scholar · View at Scopus
  32. C. Gao, Z. Zhen, and H. Gong, “A self-organized search and attack algorithm for multiple unmanned aerial vehicles,” Aerospace Science and Technology, vol. 54, pp. 229–240, 2016. View at Publisher · View at Google Scholar · View at Scopus
  33. P. Isaiah and T. Shima, “Motion planning algorithms for the Dubins Travelling Salesperson Problem,” Automatica, vol. 53, pp. 247–255, 2015. View at Publisher · View at Google Scholar · View at Scopus
  34. J. Le Ny, E. Feron, and E. Frazzoli, “On the Dubins traveling salesman problem,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 57, no. 1, pp. 265–270, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. K. J. Obermeyer, P. Oberlin, and S. Darbha, “Sampling-based path planning for a visual reconnaissance unmanned air vehicle,” Journal of Guidance, Control, and Dynamics, vol. 35, no. 2, pp. 619–631, 2012. View at Publisher · View at Google Scholar · View at Scopus
  36. G. Righini and M. Salani, “Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming,” Computers & Operations Research, vol. 36, no. 4, pp. 1191–1203, 2009. View at Publisher · View at Google Scholar · View at Scopus
  37. P. Vansteenwegen, “Iterated local search for the team orienteering problem with time windows,” Computers & Operations Research, vol. 36, no. 12, pp. 3281–3290, 2009. View at Publisher · View at Google Scholar · View at Scopus
  38. T. Cura, “An artificial bee colony algorithm approach for the team orienteering problem with time windows,” Computers & Industrial Engineering, vol. 74, no. 1, pp. 270–290, 2014. View at Publisher · View at Google Scholar · View at Scopus
  39. Q. Hu and A. Lim, “An iterative three-component heuristic for the team orienteering problem with time windows,” European Journal of Operational Research, vol. 232, no. 2, pp. 276–286, 2014. View at Publisher · View at Google Scholar · View at Scopus
  40. N. Labadie, R. Mansini, J. Melechovsky, and R. Wolfler Calvo, “The team orienteering problem with time windows: an {LP}-based granular variable neighborhood search,” European Journal of Operational Research, vol. 220, no. 1, pp. 15–27, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  41. S.-W. Lin and V. F. Yu, “A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows,” Applied Soft Computing, vol. 37, pp. 632–642, 2015. View at Publisher · View at Google Scholar · View at Scopus
  42. S. Belhaiza, P. Hansen, and G. Laporte, “A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows,” Computers & Operations Research, vol. 52, pp. 269–281, 2014. View at Google Scholar
  43. D. Favaretto, E. Moretti, and P. Pellegrini, “Ant colony system for a VRP with multiple time windows and multiple visits,” Journal of Interdisciplinary Mathematics, vol. 10, no. 2, pp. 263–284, 2007. View at Publisher · View at Google Scholar · View at Scopus
  44. G. Pesant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau, “On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem,” European Journal of Operational Research, vol. 117, no. 2, pp. 253–263, 1999. View at Publisher · View at Google Scholar · View at Scopus
  45. R. El-Hajj, D.-C. Dang, and A. Moukrim, “Solving the team orienteering problem with cutting planes,” Computers & Operations Research, vol. 74, pp. 21–30, 2016. View at Publisher · View at Google Scholar · View at Scopus
  46. L. Ke, L. Zhai, J. Li, and F. T. S. Chan, “Pareto mimic algorithm: An approach to the team orienteering problem,” OMEGA - The International Journal of Management Science, vol. 61, pp. 155–166, 2016. View at Publisher · View at Google Scholar · View at Scopus
  47. T. Ilhan, S. M. R. Iravani, and M. S. Daskin, “The orienteering problem with stochastic profits,” Institute of Industrial Engineers (IIE). IIE Transactions, vol. 40, no. 4, pp. 406–421, 2008. View at Publisher · View at Google Scholar · View at Scopus
  48. H. Murat Afsar and N. Labadie, “Team Orienteering problem with Decreasing Profits,” Electronic Notes in Discrete Mathematics, vol. 41, pp. 285–293, 2013. View at Publisher · View at Google Scholar · View at Scopus
  49. J. A. Oliveira, J. Ferreira, M. Figueiredo, L. Dias, and G. Pereira, “Sistema de Apoio à Decisão para o Transporte Não Urgente de Doentes em Veículo Partilhado,” RISTI Revista Ibérica de Sistemas e Tecnologias de Informação, vol. 13, pp. 17–33, 2014. View at Google Scholar
  50. L. Ke, H. Guo, and Q. Zhang, “A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows,” in Proceedings of the 2014 IEEE Congress on Evolutionary Computation (CEC '14), pp. 1878–1882, July 2014. View at Publisher · View at Google Scholar · View at Scopus
  51. H. Tang and E. Miller-Hooks, “A TABU search heuristic for the team orienteering problem,” Computers & Operations Research, vol. 32, no. 6, pp. 1379–1407, 2005. View at Publisher · View at Google Scholar · View at Scopus
  52. J. K. P. Zabielski, “Genetic algorithm with path relinking for the orienteering problem with time windows,” Fundamenta Informaticae, vol. 135, no. 4, pp. 419–431, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  53. J. Tian, L. Shen, and Y. Zheng, “Genetic algorithm based approach for multi-UAV cooperative reconnaissance mission planning problem,” in Foundations of Intelligent Systems, F. Esposito, Z. Raś, and D. Malerba, Eds., vol. 4203 of Lecture Notes in Computer Science, pp. 101–110, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  54. O. K. Sahingoz, “Generation of bezier curve-based flyable trajectories for multi-UAV systems with parallel genetic algorithm,” Journal of Intelligent & Robotic Systems, vol. 74, no. 1-2, pp. 499–511, 2014. View at Publisher · View at Google Scholar · View at Scopus
  55. C. Di Franco and G. Buttazzo, “Coverage Path Planning for UAVs Photogrammetry with Energy and Resolution Constraints,” Journal of Intelligent & Robotic Systems, vol. 83, no. 3-4, pp. 445–462, 2016. View at Publisher · View at Google Scholar · View at Scopus
  56. S. Bernardini, M. Fox, and D. Long, “Combining temporal planning with probabilistic reasoning for autonomous surveillance missions,” Autonomous Robots, vol. 41, no. 1, pp. 181–203, 2017. View at Publisher · View at Google Scholar · View at Scopus
  57. C. Gao, Z. Zhen, and H. Gong, “A self-organized search and attack algorithm for multiple unmanned aerial vehicles,” Aerospace Science and Technology, vol. 54, pp. 229–240, 2016. View at Publisher · View at Google Scholar · View at Scopus