Skip to main content
SpringerLink
Log in

Variable Neighborhood Search for Continuous Monitoring Problem with Inter-Depot Routes

  • Conference paper
KI 2013: Advances in Artificial Intelligence (KI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8077))

Included in the following conference series:

  • 1494 Accesses

Abstract

In this paper we provide methods for the Continuous Monitoring Problem with Inter-Depot routes (CMPID). It arises when a number of agents or vehicles have to persistently survey a set of locations. Each agent has limited energy storage (e.g., fuel tank or battery capacity) and can renew this resource at any available base station. Various real-world scenarios could be modeled with this formulation. In this paper we consider the application of this problem to disaster response management, where wide area surveillance is performed by unmanned aerial vehicles. We propose a new method based on the Insertion Heuristic and the metaheuristic Variable Neighborhood Search. The proposed algorithm computes solutions for large real-life scenarios in a few seconds and iteratively improves them. Solutions obtained on small instances (where the optimum could be computed) are on average 2.6% far from optimum. Furthermore, the proposed algorithm outperforms existing methods for the Continuous Monitoring Problem (CMP) in both solution quality (in 3 times) and computational time (more than 400 times faster).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mersheeva, V., Friedrich, G.: Routing for continuous monitoring by multiple micro UAVs in disaster scenarios. In: European Conference on AI, pp. 588–593 (2012)

    Google Scholar 

  2. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  4. Angelelli, E., Speranza, M.G.: The periodic vehicle routing problem with intermediate facilities. European Journal of OR 137(2), 233–247 (2002)

    MATH  Google Scholar 

  5. Crevier, B., Cordeau, J.F., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. European Journal of OR 176(2), 756–773 (2007)

    MathSciNet  MATH  Google Scholar 

  6. Nuortio, T., Kytöjoki, J., Niska, H., Bräysy, O.: Improved route planning and scheduling of waste collection and transport. Expert Systems with Applications 30(2), 223–232 (2006)

    Article  Google Scholar 

  7. Kim, B., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Computers & Operations Research 33(12), 3624–3642 (2006)

    Article  MATH  Google Scholar 

  8. Benjamin, A., Beasley, J.: Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Computers & Operations Research 37(12), 2270–2280 (2010)

    Article  Google Scholar 

  9. Hemmelmayr, V., Doerner, K.F., Hartl, R.F., Rath, S.: A heuristic solution method for node routing based solid waste collection problems. Journal of Heuristics 19(2), 129–156 (2013)

    Article  Google Scholar 

  10. Las Fargeas, J., Hyun, B., Kabamba, P., Girard, A.: Persistent visitation with fuel constraints. In: Meeting of the EURO Working Group on Transportation, vol. 54, pp. 1037–1046 (2012)

    Google Scholar 

  11. Machado, A., Ramalho, G., Zucker, J.-D., Drogoul, A.: Multi-agent patrolling: an empirical analysis of alternative architectures. In: Sichman, J.S., Bousquet, F., Davidsson, P. (eds.) MABS 2002. LNCS (LNAI), vol. 2581, pp. 155–170. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Elmaliach, Y., Agmon, N., Kaminka, G.: Multi-robot area patrol under frequency constraints. Annals of Mathematics and AI 57(3), 293–320 (2009)

    MathSciNet  MATH  Google Scholar 

  13. Elor, Y., Bruckstein, A.: Autonomous multi-agent cycle based patrolling. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 119–130. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Smith, S.L., Rus, D.: Multi-robot monitoring in dynamic environments with guaranteed currency of observations. In: IEEE Conference on Decision and Control, pp. 514–521 (2010)

    Google Scholar 

  15. Portugal, D., Rocha, R.: MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1271–1276. ACM (2010)

    Google Scholar 

  16. Oberlin, P., Rathinam, S., Darbha, S.: Today’s travelling salesman problem. IEEE Robotics & Automation Magazine 17(4), 70–77 (2010)

    Article  Google Scholar 

  17. Paraskevopoulos, D., Repoussis, P., Tarantilis, C., Ioannou, G., Prastacos, G.: A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. Journal of Heuristics 14, 425–455 (2008)

    Article  MATH  Google Scholar 

  18. Hansen, P., Mladenović, N., Moreno Pérez, J.: Variable neighbourhood search: methods and applications. Annals of Operations Research 175(1), 367–407 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Mersheeva, V., Friedrich, G.: Benchmarks for the CMPID and the test results (2013), http://uav.lakeside-labs.com/test-data/

Download references

Author information

Authors and Affiliations

  1. Alpen-Adria Universität, Universitätsstraße 65-67, 9020, Klagenfurt, Austria

    Vera Mersheeva & Gerhard Friedrich

Authors
  1. Vera Mersheeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard Friedrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Business Informatics I, University of Trier, 54286, Trier, Germany

    Ingo J. Timm

  2. Institute for Web Science and Technologies, University of Koblenz, Universitätsstr. 1, 56070, Koblenz, Germany

    Matthias Thimm

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mersheeva, V., Friedrich, G. (2013). Variable Neighborhood Search for Continuous Monitoring Problem with Inter-Depot Routes. In: Timm, I.J., Thimm, M. (eds) KI 2013: Advances in Artificial Intelligence. KI 2013. Lecture Notes in Computer Science(), vol 8077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40942-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40942-4_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40941-7

  • Online ISBN: 978-3-642-40942-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation