A hybrid tabu search algorithm for the variable periodic vehicle routing problem
| Autor: | Wan-yin Chen, 陳宛吟 |
|---|---|
| Rok vydání: | 2013 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 101 In general, the distribution for the auto parts manufacturer in the real-life system must pick-up raw materials periodically by vehicles. However, the idea of lean production is applied in the production of the auto parts manufacturer. The key of raw materials distribution is to implement lean production. The quantity of cargo will be changed as a vehicle transport cycle time changes. Therefore, the objective of the variable periodic vehicle routing problem (VPVRP) is to minimize the total transportation cost in this thesis. There are two decisions must be design to solve this problem. First, the daily routes have to be designed to obtain the transport times. Then, the pick-up cycle time and the quantity of each raw material have to assign in the planning horizon. The objective of the problem is to determine pick-up routes so as to minimize the total transportation cost in one day. The transportation cost includes distance cost, loading cost, dispatching cost, and frequency cost. Since the problem is a special case of the periodic vehicle routing problem (PVRP), we develop initial algorithms and the hybrid tabu search (HTS) for solving the problem. There are several distinctive features in the HTS, including randomly generating ten feasible solutions in a neighborhood, considering all feasible solutions in a neighborhood, the intensification strategy, the diversification strategy, and combination of tabu search (TS) with the switch mechanism. The computational results show that the proposed initial algorithms and the HTS outperform the current scheduling method used by the case plant with a significant improvement. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|