Vehicle Routing and Traveling Salesman Problems

2014 ◽  
pp. 181-206
Keyword(s):  
Vehicle Routing ◽  
Traveling Salesman ◽  
Traveling Salesman Problems

scholarly journals Optimization for medical logistics robot based on model of traveling salesman problems and vehicle routing problems

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110225
Author(s):  
Hui Jin ◽  
Qingsong He ◽  
Miao He ◽  
Shiqing Lu ◽  
Fangchao Hu ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Order Picking ◽  
Traveling Salesman ◽  
Vehicle Routing Problems ◽  
Traveling Salesman Problems ◽  
Routing Problem ◽  
Problem Model ◽  
Route Length

Fast medicine dispensing system (FMDS) as a kind of medical logistic robot can dispense many drugs for one prescription at the same time. To guarantee the sustainability of drug dispensation, it is required that FMDS replenish drugs rapidly. The traditional order picking model (OPM) is difficult to meet the demand of prompt replenishment. To solve the problems of prolonged refilling route and inefficiency of drugs replenishment, a mixed refilling model based on multiple steps traveling salesman problem model (MTSPM) and vehicle routing problem model (VRPM) is proposed, and it is deployed in two circumstances of FMDS, including temporary replenishment mode (TRM) and concentrate replenishment mode (CRM). It not only meted the demand under different circumstances of drug replenishment but also shortened the refilling route significantly. First, the new pick sets were generated. Then, the orders of pick sets were optimized and the new paths were achieved. When the number of pickings is varied no more than 20, experiment results declared that the refilling route is the shortest by utilizing MTSPM when working under the TRM condition. Comparing MTSPM with OPM, the rate of refilling route length decreased up to 32.18%. Under the CRM condition, the refilling route is the shortest by utilizing VRPM. Comparing VRPM with OPM, the rate of refilling route length decreased up to 58.32%. Comparing VRPM with MTSPM, the rate of refilling route length has dropped more than 43.26%.

K-means Clustering Algorithm and Meta-heuristics for Multiple Traveling Salesman Problems

2009 ◽  
Vol 4 (2) ◽  
pp. 16-32
Author(s):  
R. Nallusamy ◽  
K. Duraiswamy ◽  
R. Dhanalaksmi ◽  
P. Parthiban
Keyword(s):  
Clustering Algorithm ◽  
Traveling Salesman ◽  
Traveling Salesman Problems
Sign in / Sign up

Export Citation Format

Share Document