Cross-dock warehouse operation planning

• Main Author: Wu, Yue
• Other Authors: Rajesh Piplani
• Format: Thesis-Master by Coursework
• Language: English
• Published: Nanyang Technological University 2020
• Subjects: Engineering::Industrial engineering::Supply chain
• Online Access: https://hdl.handle.net/10356/140513
• Institution: Nanyang Technological University

As the competition expands in almost every industry, especially in retail and grocery industries, companies need to search for various ways of reducing total costs throughout the supply chain. Therefore, many companies follow the cross-docking strategy in distribution which has the advantage of faster cycle time, less inventory, quicker response, increased customer satisfaction, and cost-effective. This study focuses on the operational level of cross-dock policy which involves the capacitated vehicle routing problem with soft time windows and scheduling problem of both outbound trucks and inbound trucks, with the objective of minimizing total cost, consisting of transportation cost, earliness penalty cost, tardiness penalty cost, and inventory holding cost. The methodology of “cluster first, route second” is adopted to solve the problem. Two different clustering methods, namely distance- based clustering in terms of the geographical distribution by K-medoid, and order size-based clustering concentrating on the geographical distribution and sum of the customer order by improved K-means, are proposed to generate clusters. Then, a meta-heuristic, Tabu-Search based algorithm is developed to find the optimal route and schedule of trucks in every cluster. The algorithms are developed using Python 3.0. After computational experiments with different sizes of data set and sensitivity analysis for critical parameters, the optimal solution of the whole policy is shown in the results, and the conclusion of the effectiveness drawn.