Route Planning for UAVs : A Column Generation Approach

We study an integer optimization problem that describes the route planning for UAVs (unmanned aerial vehicles). The aim in the route planning problem is to minimize the number of UAVs that monitors the locations in a region within specific visiting times. The challenge is to find travelling salesman routes that satisfy the criteria for how often the locations should be monitored. The main purpose of this work is to apply column generation to this route planning problem, based on three strategies. The interest in this approach is to evaluate how effective each strategy is to solve the problem and then conclude its advantages and disadvantages. The strategies that are being presented in this work, are exact column generation, heuristic column generation and ad hoc column generation. We present algorithms for each strategy and study its behavior on different problem instances. The implementations have been performed in the programming language Python with the use of the optimization solver Gurobi.

Publication Details

Journal
KTH Publication Database DiVA (KTH Royal Institute of Technology)
Published
2025-01-01
Primary Topic
Computational Physics and Python Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Route Planning for UAVs : A Column Generation Approach

KTH Publication Database DiVA (KTH Royal Institute of Technology)
Computational Physics and Python Applications
article

Route Planning for UAVs : A Column Generation Approach

article en

Abstract

We study an integer optimization problem that describes the route planning for UAVs (unmanned aerial vehicles). The aim in the route planning problem is to minimize the number of UAVs that monitors the locations in a region within specific visiting times. The challenge is to find travelling salesman routes that satisfy the criteria for how often the locations should be monitored. The main purpose of this work is to apply column generation to this route planning problem, based on three strategies. The interest in this approach is to evaluate how effective each strategy is to solve the problem and then conclude its advantages and disadvantages. The strategies that are being presented in this work, are exact column generation, heuristic column generation and ad hoc column generation. We present algorithms for each strategy and study its behavior on different problem instances. The implementations have been performed in the programming language Python with the use of the optimization solver Gurobi.

KTH Publication Database DiVA (KTH Royal Institute of Technology)
Sustainable cities and communities
Openalex Percentile: Top 72%
Computational Physics and Python Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.