Comparison of meta-heuristics for container ship routing problem
by S. Santhanakrishnan; T.T. Narendran; K. Ganesh; S.P. Anbuudayasankar
International Journal of Services and Operations Management (IJSOM), Vol. 12, No. 3, 2012

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.

Online publication date: Sat, 23-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com