Name
Title | ||
|---|---|---|
An Efficient Forest-Based Tabu Search Algorithm For The Split-Delivery Vehicle Routing Problem |
Abstract | ||
|---|---|---|
The split-delivery vehicle routing problem (SDVRP) is a natural extension of the classical vehicle routing problem (VRP) that allows the same customer to be served by more than one vehicle. This problem is a very challenging combinatorial optimization problem and has attracted much academic attention. To solve it, most of the literature articles adopted heuristic approaches in which the solution is represented by a set of delivery patterns, and the search operators were derived from the traditional VRP operators. Differently, our approach employs the combination of a set of routes and a forest to represent the solution. Several forest-based operators are accordingly introduced. We integrate the new operators into a simple tabu search framework and then demonstrate the efficiency of our approach by conducting experiments on existing benchmark instances. |
Year | Venue | Keywords |
|---|---|---|
2015 | PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | vehicle routing |
Field | DocType | Citations |
Mathematical optimization,Heuristic,Vehicle routing problem,Combinatorial optimization problem,Computer science,Operator (computer programming),Tabu search | Conference | 2 |
PageRank | References | Authors |
0.36 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zizhen Zhang | 1 | 100 | 17.27 |
| Huang He | 2 | 3 | 0.74 |
| Zhixing Luo | 3 | 36 | 6.44 |
| Hu Qin | 4 | 201 | 16.49 |
| Songshan Guo | 5 | 46 | 6.50 |