期刊
出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.procs.2016.07.469
关键词
vehicle routing problem; metaheuristic algorithms; VRPTW; SDVRPTW; Pareto ranking
The various extensions of the vehicle routing problem with time windows (VRPTW) are considered. In addition to the VRPTW, the authors present a method to solve the SDVRPTW - the variation of the task allowing separate goods supply to the customers. The two developed metaheuristic algorithms (genetic and hybrid) are described that use the unique task-oriented operators and approaches, such as the limited route inversion, the upgraded heuristic procedure, the initialization of the initial population by ant colonies method, Pareto ranking. The features of this problem solved are additional route restrictions, such as: the maximum time, the number of customers and cost, as well as the maximum number of vehicles required for delivery. This article is devoted to valuables delivery problems and methods to resolve them.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据