Multi-Traveler Salesman Problem for Unmanned Vehicles: Optimization through Improved Hopfield Neural Network
Song Liu,
Xinhua Gao,
Liu Chen,
Sihui Zhou,
Yong Peng (),
Dennis Z. Yu,
Xianting Ma and
Yan Wang
Additional contact information
Song Liu: Institute for Intelligent Optimization of Comprehensive Transportation Systems, Chongqing Jiaotong University, Chongqing 400074, China
Xinhua Gao: School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China
Liu Chen: Chongqing Survey Institute, Chongqing 401121, China
Sihui Zhou: School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China
Yong Peng: School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China
Dennis Z. Yu: The David D. Reh School of Business, Clarkson University, Potsdam, NY 13699, USA
Xianting Ma: Institute for Intelligent Optimization of Comprehensive Transportation Systems, Chongqing Jiaotong University, Chongqing 400074, China
Yan Wang: T.Y.LIN International Group Chongqing, Chongqing 401121, China
Sustainability, 2023, vol. 15, issue 20, 1-25
Abstract:
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.
Keywords: multiple-traveler salesman problem; clustering algorithm; Hopfield neural network; data transformation technique; dynamic step size; unmanned vehicle (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2071-1050/15/20/15118/pdf (application/pdf)
https://www.mdpi.com/2071-1050/15/20/15118/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:15:y:2023:i:20:p:15118-:d:1264357
Access Statistics for this article
Sustainability is currently edited by Ms. Alexandra Wu
More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().