Comparison of meta-heuristics for container ship routing problem

S. Santhanakrishnan, T.T. Narendran, K. Ganesh and S.P. Anbuudayasankar

International Journal of Services and Operations Management, 2012, vol. 12, issue 3, 348-367

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.

Keywords: shipping network design; empty containers; genetic algorithms; GAs; simulated annealing; metaheuristics; container shipping; ship routing; vehicle routing problem; VRP; ports. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=47625 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:12:y:2012:i:3:p:348-367

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().