Container movement by trucks with time constraints at origins and destinations is modeled as an asymmetric "multi-Traveling Salesmen Problem with Time Windows" (m-TSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes...

In this paper, empty container movements in the Los Angeles and Long Beach (LA/LB) port area are studied in an effort to reduce congestion by optimizing the empty container reuse. The dynamic empty container reuse is modeled analytically, and techniques are developed to optimize empty container...

This paper studies substitution between empty containers of different types in an attempt to reduce the cost of empty container interchange. Since finding an optimal solution requires substantial computational efforts, a heuristic method is developed which yields an integer solution relatively...