ISSN : 2005-0461(Print)
ISSN : 2287-7975(Online)
ISSN : 2287-7975(Online)
A Heuristic for the Vehicle Routing Problem Allowing Multiple Visits
Abstract
This paper presents extended model for the vehicle routing problem, which allows multiple visits to a node by multiple vehicles. Multiple visits enables us split delivery. After formulating this multiple visits model mathematically, a two stage heuristic algorithm is developed by decomposition approach. This model consists of two sub-problem. The one is fixed cost transportation problem and the other is transportation problem.
다회방문을 허용하는 차량경로문제의 발견적 해법
초록
- SOGOBO_1991_v14n24_141.pdf221.2KB