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.
Cite
Text
Zhang et al. "An Efficient Forest-Based Tabu Search Algorithm for the Split-Delivery Vehicle Routing Problem." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9657Markdown
[Zhang et al. "An Efficient Forest-Based Tabu Search Algorithm for the Split-Delivery Vehicle Routing Problem." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/zhang2015aaai-efficient/) doi:10.1609/AAAI.V29I1.9657BibTeX
@inproceedings{zhang2015aaai-efficient,
title = {{An Efficient Forest-Based Tabu Search Algorithm for the Split-Delivery Vehicle Routing Problem}},
author = {Zhang, Zizhen and He, Huang and Luo, Zhixing and Qin, Hu and Guo, Songshan},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2015},
pages = {3432-3438},
doi = {10.1609/AAAI.V29I1.9657},
url = {https://mlanthology.org/aaai/2015/zhang2015aaai-efficient/}
}