| Summary: | 碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 101 === In the recent years, the environment of delivery system has changed. The customer demand is continuous changing and the customer requires quick service. This study focus on the periodic vehicle routing problem which allows delivery in advance within a planning cycle. The customer demands include single pick-up or single delivery. By considering loading capacity and service distance in each route, the earlier delivery within a period is acceptable in this study. On the other hand, the pick-up orders are fixed on the due dates. The objective of this study is to minimize total cost which includes the route cost, fixed cost of vehicle, and the penalty for earlier delivery.
The solution logic of routing improvement is based on Tabu Search. The expected results of this study include: (1) plan an optimal transport routes, (2) improve the vehicle load capacity, (3) reduce the number of vehicle used, and (4) reduce the total cost.
A computer program based on the proposed heuristic algorithm is developed for solving the problem. The results of illustration example show that it can indeed to achieve results significantly. A sensitivity analysis is conducted on the vehicle capacity, the maximum travel distance, ratio of node of receive and send. Results of sensitivity analysis is helpful for management decision.
|
|---|
