A vehicle routing problem with two types of ships in container terminals

The Vehicle Routing Problem (VRP) is one of well-established and important topics in supply chain and logistics networks. The location-routing decision-making has a signicant role to optimize the traveling cost per distance, total traveling time, and the number of vehicles in the supply chain networks. One of the recent advances in these systems refers to container terminals in the global trade centers. The new contributions of this model are to consider the routes of two types of ships (Tramp and Liner) with different properties and the time windows in order to minimize costs, simultaneously. The proposed model is solved by an exact solver using LINGO software and because of inherent complexity of the problem proposed in the real-world cases, the Genetic Algorithm (GA) is used to nd an optimal/global solution in a reasonable span of time. Finally, an in-depth analysis and discussion are provided to conclude the main ndings and practical implications of the results.