A heuristic method for the open vehicle routing problem |
| |
Authors: | D Sariklis S Powell |
| |
Affiliation: | 1.The London School of Economics and Political Science,UK |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|