期刊
TRANSPORTATION SCIENCE
卷 40, 期 1, 页码 64-73出版社
INST OPERATIONS RESEARCH MANAGEMENT SCIENCES
DOI: 10.1287/trsc.1040.0103
关键词
split delivery vehicle routing problem; triangle inequality; metaheuristics; tabu search
We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity The algorithm also considers the possibility of inserting a customer into a route without removing it from another route. The insertion of a customer into a route is done by means of the cheapest insertion method. Computational experiments are reported for a set of benchmark problems, and the results are compared with those obtained by the algorithm proposed by Dror and Trudeau.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据