Abstract
Container ship routing problem is a special variant of vehicle routing problem (VRP) which needs a lot of attention which costs enormous amount of money per day. In this paper, two popular meta-heuristics namely genetic algorithm (GA) and simulated annealing (SA) for solving the ship routing problem have been compared. A series of experiments were conducted varying the number of ports involved and the route taken to visit these ports. These numerical experiments revealed that SA yielded more profits compared to GA as number of ports increased.
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 callMore From: International Journal of Services and Operations Management
Disclaimer: 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.
