An Adaptive Tabu Search Algorithm for the Open Vehicle Routing Problem with Split Deliveries by Order

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective

“…The VRP is an NP-hard problem [ 33 ]. An exact algorithm is difficult to use to solve large-scale VRP, so lots of scholars usually use a metaheuristic algorithm to solve it [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 , 30 , 31 , 32 , 33 , 34 , 35 , 36 , 37 , 38 , 39 , 40 , 41 , 42 , 43 , 44 , 45 ]. For example, the survey of metaheuristics for the VRP by Gendreau et al [ 36 ] shows that a tabu search (TS) algorithm emerges as the most effective approach.…”

“…Procedures based on pure genetic algorithms and on neural networks are clearly outperformed, while those based on simulated or deterministic annealing and on ant systems are not quite competitive. Fu et al [ 37 , 38 , 39 , 40 , 41 ] designed a series of TS algorithms to solve the open VRP and closed VRP. They also compared and analyzed some other optimization algorithms, such as simulated annealing algorithm, genetic algorithm, ant colony optimization algorithm, particle swarm optimization algorithm, and so on.…”

“…They also compared and analyzed some other optimization algorithms, such as simulated annealing algorithm, genetic algorithm, ant colony optimization algorithm, particle swarm optimization algorithm, and so on. Through experiments, they point out that the TS algorithm has the advantages of simplicity, adaptability, and easy operation, and the TS algorithm usually performs better for solving large-scale VRP, especially when customer demand can be split and delivered [ 37 , 38 , 39 , 40 , 41 ]. Therefore, we designed a new TS algorithm to solve the VRP with split deliveries by backpack in this study.…”

“…If feasible, is marked, otherwise . According to previous experience from VRP-related literature [ 37 , 38 , 39 , 40 , 41 ], reduction in the number of vehicles has a greater effect on the shortening of the travel time and distance. The reduction in the number of vehicles is usually due to the increased vehicle loading rate and the avoidance of detour, and the feasible route is usually shorter (that is, the cost of time is usually less).…”

Optimization of Multi-Products Distribution by Tabu Search Algorithm (Case Study: Fuel Distribution)

“…Several approaches are used to solve the problem of SDVRP. Methodological search [16], branch and bound method [18], dynamic programming and shortest path [19], local search with the grouping procedure [20], picking algorithm [21], dynamic program [22], tabu search algorithm [23][24][25][26][27][28], a heuristic approach [29], and scatter search algorithm [30,31].…”