Combined ship allocation, routing and freight assignment in tramp shipping
In this paper, we consider the ship routing problem of tramp shipping (SRPTP) and propose a combined mathematical model that simultaneously takes into account the ship allocation, freight assignment and ship routing problems of SRPTP. To solve this problem, we investigate the practical operational issues of SRPTP and develop a genetic algorithm. The empirical studies demonstrate the applicability of the proposed solution scheme for solving real-world problems that are beyond the reach of a widely used commercial optimization package. The technical, computational, practical and calibration issues involved in this unique tramp shipping problem are discussed in detail in this paper.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 47 (2011)
Issue (Month): 4 (July)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:47:y:2011:i:4:p:414-431. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.