Truck Dock Assignment Problem in a Cross Docking System with Operational Time Constraint
碩士 === 國立臺灣科技大學 === 工業管理系 === 98 === In this paper, we consider a truck dock assignment problem with an operational time constraint in a crossdock where the number of trucks exceeds the number of docks available. The objective of the problem is to find an optimal truck dock assignment to minimize th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63756592190405446177 |
| Summary: | 碩士 === 國立臺灣科技大學 === 工業管理系 === 98 === In this paper, we consider a truck dock assignment problem with an operational time constraint in a crossdock where the number of trucks exceeds the number of docks available. The objective of the problem is to find an optimal truck dock assignment to minimize the sum of the total dock operational cost and the penalty cost for all the unfulfilled shipments. The problem is limited by the crossdock capacity where the cargo temporary storage. The problem feasibility is affected by three factors: the arrival and departure time windows of each truck, the operational time for the cargo shipments among the docks, and the total capacity available to the crossdock. Two heuristics are proposed in this paper for the problem. To obtain a better solution, a Particle Swarm Optimization (PSO) algorithm combined with the heuristics is also proposed. Computational experiments show that the heuristics alone perform better than an existing tabu search (TS) algorithm in terms of computation time and solution quality. The PSO algorithm also outperforms the TS algorithm when both employing the heuristics.
|
|---|