Empty Containers Distribution Problem considering the Container Ship Route

Today international trade through maritime transportation is significantly increasing. Due to this increase, shipping companies are faced with problems concerning the repositioning of empty containers from import dominant ports. The liner shipping service network has been provided to transport containers which load customers ’ freights. Container ships are moved on the liner shipping service network by observing the pre-determined route and transportation time. This research deals with the empty containers distribution problem considering the container ship route. A mathematical model based on the mixed integer program has been introduced in this study. The objective is to minimize the total relevant costs of empty containers such as handling, leasing, and inventory holding, etc. Due to the complexity of the problem, a genetic algorithm has been suggested to solve large sized problems within a reasonable time. Numerical experiments have been conducted to show the efficiency of the genetic algorithm