Abstract Traveling Salesman Problem (TSP) is a main attention issue at present. Neural
network can be used to solve combinatorial optimization problems. In recent years, there …

The fiercely competitive business environment and increasingly personalized customization
needs are driving the digital transformation and upgrading of the manufacturing industry …

For NP-hard combinatorial optimization problems, it is usually challenging to find high-
quality solutions in polynomial time. Designing either an exact algorithm or an approximate …

This paper proposes a novel fractional-order memristive Hopfield neural network (HNN) to
address traveling salesman problem (TSP). Fractional-order memristive HNN can efficiently …

The overall quality of last-mile delivery in terms of operational costs and customer
satisfaction is primarily affected by traditional logistics planning and the consideration and …

The Traveling Salesman Problem (TSP) which is a theoretical computer science and
operations research problem, has several applications even in its purest formulation, such …

The logistics demands of industries represented by e-commerce have experienced
explosive growth in recent years. Vehicle path-planning plays a crucial role in optimization …

Abstract The Travel Salesman Problem (TSP) consists in finding the minimal-length closed
tour that connects the entire group of nodes of a given graph. We propose to solve such a …

Abstract Missions involving Unmanned Aerial Vehicle usually consist of reaching a set of
regions, performing some actions in each region, and returning to a determined depot after …

This paper presents a new variant of Travelling Salesman Problem (TSP) and its first
resolution. In literature there is not any research work that has presented the TSP under …