An Approach of Vehicle Routing Problem with Split Delivery and Pick-up Consideration

• Main Authors: Po-hsiang Lu, 盧柏翔
• Other Authors: Chinyao Low
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/30657728783072717517

碩士 === 雲林科技大學 === 工業工程與管理研究所碩士班 === 96 === Vehicle Routing Problem with Backhauls is an extensive problem of the Vehicle Routing Problem. For the most of past research, the carrier can pick up goods on the way back after a delivery trip is finished is assumed. However, in many real cases, those two demands, pick-up and delivery, might be occurred on the same demand point, simultaneously. Meanwhile, if the needs of demand points are greater than the volume of vehicles, split delivery is considered. The addressed problem is solved in two ways. First, a mathematical programming model is constructed for solving the problem optimally. Following, a tabu search based heuristic is presented to obtain a near optimal solution. In the experiment analysis stage, a variety of delivery environments based on the ratio of average demand and vehicle volume, and variation of demands are analyzed. The experimental results have shown that split delivery turns out to be more successful when the average demand is half to 3/4 greater than the vehicle volume and the variable of demand is smaller. The greater the punishment cost of time window violation increases, the more successful the split delivery is concluded as well.