Approximation Algorithms for a New Truck Loading Problem in Urban Freight Transportation

Abstract

Motivated by urban freight transportation practices in China, we study an optimal truck loading problem in which a fixed cost and an additional cost that depends on the number of unloading points are associated with each truck used. The truck loading problem is modeled as a one-dimensional bin packing problem, where the cost of each bin is a convex fixed-plus-linear function of the number of items in the bin. The objective is to minimize the total cost of bins used. We develop an asymptotic polynomial time approximation scheme and an efficient approximation algorithm with an asymptotic worst-case performance ratio of 1.5 to tackle the problem. Our computational experiments indicate that the approximation algorithm performs well for certain order patterns, and also reveal several important insights on using the freight charge scheme.