Abstract
The Vehicle Routing Problem (VRP) is one of well-established and important topic in supply chain and logistic networks. The location-routing decision-making has a significant role to optimize the traveling cost per distance, total traveling time and the number of vehicles in the supply chain networks. One of 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. The proposed is solved by an exact method (B&B) as well as because of inherent complexity of problem proposed in the real-world cases, the Genetic (GA) algorithm has been used to find an optimal/global solution in a reasonable time. Finally, an in-depth analysis and discussion is provided to conclude the main findings and practical implications of the results.
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.
