Online Route Scheduling for a Team of Service Robots with MOEAs and mTSP Model

Alves, Raul; Silva, Clênio E.; Souza, Jefferson R.

doi:10.1007/978-3-031-08223-8_37

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ling et al [38] proposed a deep convolutional neural network (DCNN) based on the totally mTSP-fixing method, which can, without delay, set up the mapping relationship between parameters and best solutions, keep away from the use of iterations, and can be used to clear up mTSP beneath distinctive constraints after migration studying. Alves et al [39] proposed a system to solve the MTSP with the help of a multi-objective evolutionary algorithm (MOEA) to generate routes. Ahsini et al [40] combined city charts with terrain and traffic information and used ANN to optimize path travel for electric vehicles in urban areas.…”

Section: Literature Reviewmentioning

confidence: 99%

Multi-Traveler Salesman Problem for Unmanned Vehicles: Optimization through Improved Hopfield Neural Network

Liu,

Gao,

Chen

et al. 2023

Sustainability

View full text Add to dashboard Cite

In response to the COVID-19 pandemic, communities utilize unmanned vehicles to minimize person-to-person contact and lower the risk of infection. This paper addresses the critical considerations of these unmanned vehicles’ maximum load capacity and service time, formulating them as constraints within a multi-traveling salesman problem (MTSP). We propose a comprehensive optimization approach that combines a genetic simulated annealing algorithm with clustering techniques and an improved Hopfield neural network (IHNN). First, the MTSP is decomposed into multiple independent TSPs using the fuzzy C-means clustering algorithm based on a genetic simulated annealing algorithm (SA-GA-FCM). Subsequently, the HNN is employed to introduce the data transformation technique and dynamic step factor to prepare more suitable inputs for the HNN training process to avoid the energy function from falling into local solutions, and the simulated annealing algorithm is introduced to solve multiple TSP separately. Finally, the effectiveness of the proposed algorithm is verified by small-scale and large-scale instances, and the results clearly demonstrate that each unmanned vehicle can meet the specified constraints and successfully complete all delivery tasks. Furthermore, to gauge the performance of our algorithm, we conducted ten simulation comparisons with other combinatorial optimization and heuristic algorithms. These comparisons indicate that IHNN outperforms the algorithms mentioned above regarding solution quality and efficiency and exhibits robustness against falling into local solutions. As presented in this paper, the solution to the unmanned vehicle traveling salesman problem facilitates contactless material distribution, reducing time and resource wastage while enhancing the efficiency of unmanned vehicle operations, which has profound implications for promoting low-carbon sustainable development, optimizing logistics efficiency, and mitigating the risk of pandemic spread.

show abstract

Section: Literature Reviewmentioning

confidence: 99%