IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v322y2025i3p960-977.html
   My bibliography  Save this article

Multi-objective route planning of an unmanned air vehicle in continuous terrain: An exact and an approximation algorithm

Author

Listed:
  • Dasdemir, Erdi
  • Köksalan, Murat
  • Tezcaner Öztürk, Diclehan

Abstract

Unmanned Aerial Vehicles (UAVs) are widely used for military and civilian purposes. Effective route planning is an important component of their successful missions. In this study, we address the route planning problem of a UAV tasked with collecting information from various target locations in a protected terrain. We consider multiple targets, three objectives, and time-dependent information availability. Modeling the movement of UAVs in a continuous terrain in the presence of multiple objectives is complex. Conflicting objectives typically lead to a continuum of efficient trajectory options between two targets. We formulate the routing problem as a mixed-integer programming (MIP) model that captures the movement in the continuous terrain. We demonstrate the superiority of the continuous terrain formulation over the simplified discretized terrain formulation. We also develop an approximation algorithm that reduces the computational requirements of the MIP model substantially while ensuring a desired level of precision.

Suggested Citation

  • Dasdemir, Erdi & Köksalan, Murat & Tezcaner Öztürk, Diclehan, 2025. "Multi-objective route planning of an unmanned air vehicle in continuous terrain: An exact and an approximation algorithm," European Journal of Operational Research, Elsevier, vol. 322(3), pages 960-977.
  • Handle: RePEc:eee:ejores:v:322:y:2025:i:3:p:960-977
    DOI: 10.1016/j.ejor.2024.11.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724008804
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.11.015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Murat Köksalan & Banu Lokman, 2009. "Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 191-198, March.
    2. Selcen (Pamuk) Phelps & Murat Köksalan, 2003. "An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization," Management Science, INFORMS, vol. 49(12), pages 1726-1738, December.
    3. Michael D. Moskal & Erdi Dasdemir & Rajan Batta, 2023. "Unmanned Aerial Vehicle Information Collection Missions with Uncertain Characteristics," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 120-137, January.
    4. Bruce L. Golden & Larry Levy & Rakesh Vohra, 1987. "The orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 307-318, June.
    5. Özarık, Sami Serkan & Lokman, Banu & Köksalan, Murat, 2020. "Distribution based representative sets for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 632-643.
    6. Diclehan Tezcaner & Murat Köksalan, 2011. "An Interactive Algorithm for Multi-objective Route Planning," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 379-394, August.
    7. Babel, Luitpold, 2017. "Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles," European Journal of Operational Research, Elsevier, vol. 262(1), pages 335-346.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tezcaner Öztürk, Diclehan & Köksalan, Murat, 2023. "Biobjective route planning of an unmanned air vehicle in continuous space," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 151-169.
    2. Tureci-Isik, Hannan & Köksalan, Murat & Tezcaner-Öztürk, Diclehan, 2025. "Interactive biobjective optimization algorithms and an application to UAV routing in continuous space," Transportation Research Part B: Methodological, Elsevier, vol. 193(C).
    3. Doğan, Ilgın & Lokman, Banu & Köksalan, Murat, 2022. "Representing the nondominated set in multi-objective mixed-integer programs," European Journal of Operational Research, Elsevier, vol. 296(3), pages 804-818.
    4. Michael D. Moskal & Erdi Dasdemir & Rajan Batta, 2023. "Unmanned Aerial Vehicle Information Collection Missions with Uncertain Characteristics," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 120-137, January.
    5. Nail Karabay & Murat Köksalan & Diclehan Tezcaner Öztürk, 2023. "Biobjective UAV routing for a mission to visit multiple mobile targets," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 925-954, September.
    6. Dang, Duc-Cuong & Guibadj, Rym Nesrine & Moukrim, Aziz, 2013. "An effective PSO-inspired algorithm for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 332-344.
    7. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    8. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    9. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
    10. Bock, Stefan & Bomsdorf, Stefan & Boysen, Nils & Schneider, Michael, 2025. "A survey on the Traveling Salesman Problem and its variants in a warehousing context," European Journal of Operational Research, Elsevier, vol. 322(1), pages 1-14.
    11. Kyriakakis, Nikolaos A. & Marinaki, Magdalene & Matsatsinis, Nikolaos & Marinakis, Yannis, 2022. "A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning," European Journal of Operational Research, Elsevier, vol. 300(3), pages 992-1004.
    12. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    13. Wu, Lunwen & Wang, Zhouyiying & Liao, Zhixue & Xiao, Di & Han, Peng & Li, Wenyong & Chen, Qin, 2024. "Multi-day tourism recommendations for urban tourists considering hotel selection: A heuristic optimization approach," Omega, Elsevier, vol. 126(C).
    14. Han, Ke & Ji, Wen & Nie, Yu (Marco) & Li, Zhexian & Liu, Shenglin, 2024. "Exploring the sensing power of mixed vehicle fleets," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
    15. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    16. Barbati, Maria & Greco, Salvatore & Lami, Isabella M., 2024. "The Deck-of-cards-based Ordinal Regression method and its application for the development of an ecovillage," European Journal of Operational Research, Elsevier, vol. 319(3), pages 845-861.
    17. Sinha, Ankur & Korhonen, Pekka & Wallenius, Jyrki & Deb, Kalyanmoy, 2014. "An interactive evolutionary multi-objective optimization algorithm with a limited number of decision maker calls," European Journal of Operational Research, Elsevier, vol. 233(3), pages 674-688.
    18. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    19. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    20. Pablo A. Miranda-Gonzalez & Javier Maturana-Ross & Carola A. Blazquez & Guillermo Cabrera-Guerrero, 2021. "Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem," Mathematics, MDPI, vol. 9(21), pages 1-33, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:322:y:2025:i:3:p:960-977. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.