The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …

Unmanned aerial vehicles (UAVs) have emerged as a promising candidate solution for data
collection of large-scale wireless sensor networks (WSNs). In this paper, we investigate a …

Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

The combination of components from different algorithms is currently one of the most
successful trends in optimization. The hybridization of metaheuristics such as ant colony …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

This study addresses a view-path-planning problem during 3-D scanning of a large-scale
structure based on multiview stereo (MVS) for unmanned aerial platforms. Recently, most …

The Lin–Kernighan heuristic is known to be one of the most successful heuristics for the
Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some …

This paper is intended to give a review of metaheuristic and their application to
combinatorial optimization problems. This paper comprises a snapshot of the rapid evolution …

In this study, we addressed a path planning problem of a mobile robot to construct highly
accurate 3D models of an unknown environment. Most studies have focused on exploration …