A Hybrid Heuristic Method for Heterogeneous Fleet Vehicle Routing Problem
碩士 === 國立屏東科技大學 === 資訊管理系所 === 98 === The Heterogeneous Vehicle Routing Problem (HVRP) is an extension of the vehicle routing problem (VRP). In the past, the routing is always determined first and then heterogeneous vehicle type is determined for the HVRP. However, total cost (including vehicle fixe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/10949567426578835853 |
| Summary: | 碩士 === 國立屏東科技大學 === 資訊管理系所 === 98 === The Heterogeneous Vehicle Routing Problem (HVRP) is an extension of the vehicle routing problem (VRP). In the past, the routing is always determined first and then heterogeneous vehicle type is determined for the HVRP. However, total cost (including vehicle fixed cost and variable cost) would increase since vehicle related cost is ignored when the routing is determined. The HVRP is a NP-hard problem. This paper develops a hybrid heuristic algorithm, which integrates the heterogeneous vehicle information and variable neighborhood search (VNS). The proposed heuristic in this study is compared with the heuristic proposed by Brando (2009), Imran et al. (2009), and Liu et al. (2009). The experimental results indicate the proposed method is better than other methods in terms of average cost.
|
|---|