计算机工程与应用2019，Vol.55Issue(6)：252-256,264,6.DOI:10.3778/j.issn.1002-8331.1711-0276
带多软时间窗VRP及其禁忌搜索算法
Tabu Search Algorithm for Vehicle Routing Problem with Multiple Soft Time Windows
摘要
Abstract
The practical application background and characteristics of the Vehicle Routing Problem with Multiple Soft Time Windows(VRPMSTW)are analyzed. Taking the number of vehicles required, total travel cost and time window deviation as the optimization objective, combined with constraints such as vehicle capacity, maximum route length, a corresponding mathematical model is constructed. An adaptive tabu search algorithm is designed to solve the problem. In order to enhance the optimization ability of the algorithm, a multi neighborhood structure is designed and an adaptive mechanism is embedded in the algorithm to accept the infeasible solution. The algorithm is tested with examples in the literature and new instances based on the Solomon benchmark problems. Computational results are compared with other methods in the literature. The comparison results show that the algorithm proposed in this paper has better performance, and it can get the solution with less transportation cost and higher satisfaction in acceptable time.关键词
车辆路径问题/多软时间窗/禁忌搜索/物流配送Key words
vehicle routing problem/multiple soft time windows/tabu search/distribution management分类
信息技术与安全科学引用本文复制引用
谢九勇,符卓,邱萌,夏扬坤..带多软时间窗VRP及其禁忌搜索算法[J].计算机工程与应用,2019,55(6):252-256,264,6.基金项目
国家自然科学基金(No.71271138) （No.71271138）
上海理工大学科技发展项目(No.16KJFZ028) （No.16KJFZ028）
上海市高原学科项目"管理科学与工程"(No.GYXK1201). （No.GYXK1201）
