碩士 / 國防管理學院 / 後勤管理研究所 / 93 / The home delivery vehicle routing problem is the extension of the traditional vehicle routing problem. It’s biggest characteristic is there exists difference routes for everyday delivery, and each vehicle has certain delivery zone. This research tries to find the optimal route, at the lowest cost of distance and time windows, and pickup or deliver goods from different customers without violating vehicle capacity and time window restrictions.
We first apply the savings method to develop the initial route, then use Tabu search to improve this initial route unitl the optimal delivery route is reached. A couple of numerical examples are demonstrated by applying the operation parameter provided by a very famous home delivery company in Taiwan. The results show that this model can be successfully applied in home delivery problem in a very efficient way. Finally, the performance of this proposed method are compared with other heuristic approach and current operation procedure implemented by the above illustrated home delivery company. The results trun out to be promising in many asperts.
| Identifer | oai:union.ndltd.org:TW/093NDMC1715004 |
| Date | January 2005 |
| Creators | Ching-Lung Kuo, 郭晴龍 |
| Contributors | , 陳珠龍, 申生元, 劉家熙 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 123 |
Page generated in 0.0018 seconds