碩士 / 國立成功大學 / 交通管理科學系 / 107 / With the rise of e-commerce and logistics industry, the distribution center has received more and more attention recently. Cross-docking is an effective management strategy to solve the problem of logistics. It can make the delivery more efficient and reduce the cost. In this research, we focus on the dock assignment problem in distribution center and we consider the number of trucks exceeds the number of docks. We emphasize assigning both inbound and outbound trucks to multiple docks and the sequence of trucks. Every truck has their hard time window constraint of the arrival time at the dock. The objective is to minimize the waiting time between actual and expected arrival time when the truck arrives at the dock. The dock assignment problem will be affected by four factors: the tightness of the time windows, the ratio of the number of the trucks and the number of dock doors, the size of the case, and the simultaneousness of the truck arrivals. To solve the dock assignment problem, we provide two methods in our research. The first method is to formulate a mixed integer programming model and use optimization solver, Gurobi, to solve the small-scale problems. Because dock assignment and truck scheduling problems are NP-hard, its integration is more difficult to solve. Therefore, we provide the second method: Tabu Search. The result shows that Tabu Search is able to find good solution in much more competitive computation time, comparing to Gurobi. We also provide an effective mathematical model of the dock assignment problem with hard time window.
| Identifer | oai:union.ndltd.org:TW/107NCKU5119034 |
| Date | January 2019 |
| Creators | Wan-YuHsieh, 謝宛彧 |
| Contributors | Tsung-Wei Shen, 沈宗緯 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 64 |
Page generated in 0.0015 seconds