期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 60, 期 7, 页码 1012-1025出版社
TAYLOR & FRANCIS LTD
DOI: 10.1057/palgrave.jors.2602644
关键词
distribution; vehicle routing; ant colony optimization; heuristics
资金
- City University of Hong Kong [7002161]
This paper studies the open vehicle routing problem (OVRP), in which the vehicle does not return to the starting depot after serving the last customer or, if it does, it must make the same trip in the reverse order. We propose an ant colony optimization-based metaheuristic for solving the OVRP. It is a M A X-M I N ant system hybridized with tabu search, which is implemented in the hyper-cube framework. Additionally, a post-optimization strategy is incorporated to further improve the best-found solutions. We experimentally check the efficiency and effectiveness of the proposed algorithm by comparing its results with the existing methods in the literature, on a wide range of benchmark instances. Journal of the Operational Research Society (2009) 60, 1012-1025.doi:10.1057/palgrave.jors.2602644
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据