Skip to content

search based on Dijkstra’s algorithm with a hybrid Genetic-Ant Colony algorithm for UAV transport and technological cycles

· 0 citations · 12 references

TL;DR

A compact formalization of a routing approach in which Dijkstra’s algorithm is used as a deterministic benchmark for shortest-path search in a weighted network, while a hybrid procedure based on a genetic algorithm and an ant colony optimization algorithm performs population-based search for feasible routes is presented.

View source

Similar papers

Open access Aug 2026

AN IMPROVED ANT COLONY OPTIMIZATION ALGORITHM FOR AGV PATH PLANNING IN SEMICONDUCTOR MANUFACTURING SYSTEMS

An Improved Ant Colony Optimization (IACO) algorithm tailored for grid-based AGV routing is proposed that generates shorter and smoother trajectories with minimized redundant turning maneuvers and achieves an approximately 18% reduction in total path length and a 45% decrease in computational iterations.

Xi-Lin Yang, Bo-Yang Zhang, Yan-Ting Ni · 0 citations
Open access Sep 2026

A hawk-inspired metaheuristic for trajectory optimization of UAVs in precision agriculture

Unmanned Aerial Vehicles (UAVs) have become central to precision agriculture, where efficient trajectory planning over large fields directly determines mission feasibility, energy use, and the quality of acquired data. We address the problem of generating an optimal, fully covering trajectory for a single UAV operating...

G. Chelladurai, Lenin Fred Alfred · 0 citations
Conference Sep 2026

Hybrid PSO-ACO Algorithm for Routing Optimization in Ultra-Dense 5G MANET Networks

This paper presents a hybrid metaheuristic routing algorithm integrating Particle Swarm Optimization (PSO) with Ant Colony Optimization (ACO) for mobile ad-hoc networks (MANETs) in the context of 5G communications. The proposed algorithm employs a two-phase architecture in which PSO initializes candidate paths using a...

Jozef Badár, Ján Papaj · 0 citations
Open access Sep 2026

Method and Software for Multi-Parametric Choosing Algorithms of UAVs Placement and Routing in Hazardous Space

This paper considers the tasks of choosing algorithms for placing unmanned aerial vehicles (UAVs) to support communications and route formation in a hazardous cyber-physical 3D space. UAV placement is interpreted as the selection of spatial coordinates for relay UAVs that form a communication chain between a data sourc...

L. Ostapenko, Vyacheslav Kharchenko · 0 citations
Open access Sep 2026

Discrete Evolutionary Algorithm with Distance-Based Crossover and Multiple Mutation Strategy for Traveling Salesman Problems

These findings confirm that the strategic integration of distance-based crossover, diversified mutation methods, and complete 2-opt local search effectively navigates the complex search space, enabling highly efficient route determination for large-scale TSPs.

Rujira Jullapak, A. Thammano · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.