Use Brute-Force search to find optimal solution.
+ Use $perms$ matlab function to generate all permutation
+ Add destinations
+ Calculation
Only for no more than 10 customers
【路径规划-VRP问题】基于暴力搜索求解 VRPTW问题附matlab代码.zip
版权申诉
191 浏览量
2023-03-14
19:39:13
上传
评论
收藏 3MB ZIP 举报
【路径规划-VRP问题】基于暴力搜索求解 VRPTW问题附matlab代码.zip （20个子文件） 
TravelDistance.m 474B BeginService.m 891B TimeTrans.m 161B PartLength.m 436B solu_new_twst_data.mat 1.44MB test10.mat 1.44MB CheckTW.m 671B NPermutation.m 357B tset_0914.mat 1.44MB CleanVehiclesCustomer.m 843B JudgeRoute.m 486B
my_test_data_10.xlsx 9KB Check.m 620B readme.md 181B main.m 2KB TransTime.m 147B CostFun.m 161B
Brute-Force-Search-VRPTW-main my_test_data_30.xlsx 9KB new_test_data_10.xlsx 9KB decode.m 1018B资源评论
