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

In this study, we propose a mathematical model of a 4D clustered traveling salesman
problem (CTSP) to address the cost-effective security and risk-related difficulties associated …

Abstract Background Automatic guided vehicles (AGVs) have developed rapidly in recent
years and have beenused in several fields, including intelligent transportation, cargo …

In this paper, we present two multi-start heuristic approaches to solve the clustered traveling
salesman problem with d-relaxed priority rule (CTSP-d). In this problem, the nodes (except …

This paper investigates the clustered shortest-path tree (CluSPT) problem, a generalized
network design problem that has several applications in various areas such as network …

The soft-clustered vehicle routing problem (Soft-CluVRP) is a relaxation of the clustered
vehicle routing problem (CluVRP), which in turn is a variant of the generalized vehicle …

Abstract The Generalized Traveling Salesman Problem (GTSP) looks for an optimal cycle in
a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a …

In the face of increasingly diverse demands from tourists, traditional methods for scenic route
planning often struggle to meet these varied needs. To address this challenge and enhance …

Shortest path problems have many applications in the field of graph theory. However, the
traditional shortest path algorithms only work in a situation where an edge penalty is a real …

Shortest path problems are encountered in many engineering applications, eg, intelligent
transportation, robot path planning, and smart logistics. The environmental changes as …