On the Study of Two-stage Tabu Search to Solve the Vehicle Routing Problem with Cross-Docking in Logistics Management

• Main Authors: Chao-ching Wang, 王朝慶
• Other Authors: Shih-che Lo
• Format: Others
• Language: en_US
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/66117309992620960330

碩士 === 國立臺灣科技大學 === 工業管理系 === 99 === Enterprises want to make profits in the extremely competitive environment. In addition to expanding sales and reducing manufacturing cost, the efficiency of logistics management is also considered as the additional source of profit. Increasing efficiency of logistics becomes critical in the supply chain due to customer’s quick response requirements. Therefore, Cross-docking (CD) system in the supply chain is considered a good method to reduce inventory and improve responsiveness to various customer demands. This thesis focuses on the vehicle routing problem with Cross-docking (VRPCD) aiming at synchronizing the shipments in both pickup and delivery processes concurrently. The collective effort of VRPCD is to reduce handling cost, inventory cost and transport cost to fulfill the distribution services. A Two-stage algorithm based on the Tabu Search algorithm is proposed in this thesis to solve the combinatorial optimal solution of the vehicle routing problem with Cross-docking. The Tabu Search algorithm combined with the k-means method to quickly generate a near optimum solution. Comparisons are made between the proposed method and the Genetic Algorithm (GA) over the experiments of various VRP pickup and delivery benchmark problems to validate the performance of the proposed algorithm. Experiment results show that the proposed algorithm was able to discover new solutions than the GA for all 60 benchmarks problems. Also, the computational results show that the proposed algorithm is robust, converge fast and competitive with overall improvement of 11.16% over the GA.