A heuristic method for the open vehicle routing problem

作者：D. Sariklis, Susan Powell · 发表于：Journal of the Operational Research Society · 年份：2000 · DOI：10.1057/palgrave.jors.2600924 · 被引用次数：205 · 研究领域：Vehicle Routing Optimization Methods、Optimization and Mathematical Programming、Metaheuristic Optimization Algorithms Research

The open vehicle routing problem (OVRP) differs from the classic vehicle routing problem (VRP) because the vehicles either are not required to return to the depot, or they have to return by revisiting the customers assigned to them in the reverse order. Therefore, the vehicle routes are not closed paths but open ones. A heuristic method for solving this new problem, based on a minimum spanning tree with penalties procedure, is presented. Computational results are provided.