Abstract
The Inland Container Transportation Problem defines the movement of fully loaded and empty containers among terminals, depots, and customers within the same inland area. All kinds of customer requests are organized by one trucking company that owns depots containing a homogeneous fleet of trucks and a sufficiently large set of empty containers. The objective of this study is to minimize the total distance the trucks travel. We present a two-stage iterative solution approach that is capable to optimize around 300 requests. In the first step, the set of requests is divided into subsets, a tabu list prevents returns to recently considered subsets. In the second step, a mathematical problem is solved for each subset. These steps are then repeated and the best known solution is updated so long as certain stopping criteria are not met. The approach is implemented in C++ using IBM ILOG CPLEX. The quality was verified by several computational experiments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
