In less-than-truckload freight transportation, hub operations affect the service levels that carriers are able to provide their customers. This paper focuses on improving the efficiency of hub operations by reducing freight handling time and cost. Specifically, the freight sequencing problem (FSP) is investigated to determine the freight unloading and loading sequence that minimizes the time for dock workers to transfer shipments from origin trailers to destination trailers. The FSP is modeled as a Rural Postman Problem (RPP) and three algorithms are compared: trailer-at-atime, nearest neighbor, and balance-and-connect. Using five industrial data sets, the results demonstrate the effectiveness, advantages, and disadvantages of the approaches
