Next Article in Journal
Rendezvous on the Line with Different Speeds and Markers That Can Be Dropped at Chosen Time
Next Article in Special Issue
Computational Approaches for Grocery Home Delivery Services
Previous Article in Journal
An Algorithm for Estimation of SF6 Leakage on Power Substation Assets
Previous Article in Special Issue
A Real-Time Network Traffic Classifier for Online Applications Using Machine Learning
 
 
Article

Swarm Robots Cooperative and Persistent Distribution Modeling and Optimization Based on the Smart Community Logistics Service Framework

by * and
Institute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai 201306, China
*
Author to whom correspondence should be addressed.
Academic Editors: Roberto Carballedo Morillo and Eneko Osaba
Algorithms 2022, 15(2), 39; https://doi.org/10.3390/a15020039
Received: 20 December 2021 / Revised: 20 January 2022 / Accepted: 21 January 2022 / Published: 26 January 2022
The high efficiency, flexibility, and low cost of robots provide huge opportunities for the application and development of intelligent logistics. Especially during the COVID-19 pandemic, the non-contact nature of robots effectively helped with preventing the spread of the epidemic. Task allocation and path planning according to actual problems is one of the most important problems faced by robots in intelligent logistics. In the distribution, the robots have the fundamental characteristics of battery capacity limitation, limited load capacity, and load affecting transportation capacity. So, a smart community logistics service framework is proposed based on control system, automatic replenishment platform, network communication method, and coordinated distribution optimization technology, and a Mixed Integer Linear Programming (MILP) model is developed for the collaborative and persistent delivery of a multiple-depot vehicle routing problem with time window (MDVRPTW) of swarm robots. In order to solve this problem, a hybrid algorithm of genetically improved set-based particle swarm optimization (S-GAIPSO) is designed and tested with numerical cases. Experimental results show that, Compared to CPLEX, S-GAIPSO has achieved gaps of 0.157%, 1.097%, and 2.077% on average, respectively, when there are 5, 10, and 20 tasks. S-GAIPSO can obtain the optimal or near-optimal solution in less than 0.35 s, and the required CPU time slowly increases as the scale increases. Thus, it provides utility for real-time use by handling a large-scale problem in a short time. View Full-Text
Keywords: smart community logistics service; swarm robots; collaborative and persistent delivery; the multiple-depot vehicle routing problem with time window; S-GAIPSO smart community logistics service; swarm robots; collaborative and persistent delivery; the multiple-depot vehicle routing problem with time window; S-GAIPSO
Show Figures

Figure 1

MDPI and ACS Style

Zhang, M.; Yang, B. Swarm Robots Cooperative and Persistent Distribution Modeling and Optimization Based on the Smart Community Logistics Service Framework. Algorithms 2022, 15, 39. https://doi.org/10.3390/a15020039

AMA Style

Zhang M, Yang B. Swarm Robots Cooperative and Persistent Distribution Modeling and Optimization Based on the Smart Community Logistics Service Framework. Algorithms. 2022; 15(2):39. https://doi.org/10.3390/a15020039

Chicago/Turabian Style

Zhang, Meng, and Bin Yang. 2022. "Swarm Robots Cooperative and Persistent Distribution Modeling and Optimization Based on the Smart Community Logistics Service Framework" Algorithms 15, no. 2: 39. https://doi.org/10.3390/a15020039

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop