This study solved the robotic task sequence planning problem of scheduling joint-space
tours so that each task point visit is made according to expected manufacturing criteria …

In this paper, a new mixed steepest descent algorithm which has short computation time and
stable solution is provided. Comparisons and case studies based on different traffic network …

The explosion of information data in the power Internet of Things (PIoT) poses difficulties for
data acquisition and computation of power devices located in remote areas with limited …

In large-scale disasters, as an important part of the rescue management, buses are often
used to evacuate carless people. Timing is always the main concern in any evacuation …

Traveling Salesman Problem (TSP) is considered as nondeterministic polynomial time hard
problem. In the TSP, a salesman should visit a set of cities, and the distances between all …

The multiple traveling salesman problems (MTSP), which arise from real world problems,
are essential in urban logistics. Variations such as MinMax-MTSP and Bounded-MTSP aim …

Human life with all its activities cannot be separated from the existence of waste but the
quality of post-consumption waste is generally still low. To convert waste into a more stable …

Radiation therapy is among the top three cancer treatments in current medical services. The
novel noncoplanar radiation therapy which claimed the best characteristics in almost all …

The traveling salesman problem (TSP) is one of the classic combinatorial optimization
problems, which can be widely used in intelligent transportation and logistics field. Neural …

The traditional path optimization problem is to consider the shortest path of the vehicle, but
the shortest path does not effectively reduce the logistics cost. On the contrary, in the case of …