IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v22y1988i2p83-95.html
   My bibliography  Save this article

A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership

Author

Listed:
  • Krishan Rana

    (Saint Mary's University, Halifax, Nova Scotia, Canada)

  • R. G. Vickson

    (University of Waterloo, Waterloo, Ontario, Canada)

Abstract

We formulate a mathematical programming model for optimally routing a chartered container ship. Our model helps in evaluating whether a container ship should be chartered or not. The model calculates the optimal sequence of port calls, the number of containers transported between port pairs, and the number of trips the ship makes in the chartered period. A specialized algorithm is developed to solve the integer network subprograms which determine the sequence of port calls. Our algorithm, which solves an integer program optimally, is quite efficient. Comparison of computational results with a Lagrangean Relaxation method and an embedded dynamic program are also presented.

Suggested Citation

  • Krishan Rana & R. G. Vickson, 1988. "A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership," Transportation Science, INFORMS, vol. 22(2), pages 83-95, May.
  • Handle: RePEc:inm:ortrsc:v:22:y:1988:i:2:p:83-95
    DOI: 10.1287/trsc.22.2.83
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.22.2.83
    Download Restriction: no

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hadi Bidhandi, 2006. "A new approach based on the surrogating method in the project time compression problems," Annals of Operations Research, Springer, vol. 143(1), pages 237-250, March.
    2. Lin, Dung-Ying & Chang, Yu-Ting, 2018. "Ship routing and freight assignment problem for liner shipping: Application to the Northern Sea Route planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 47-70.
    3. Zhao, Hui & Hu, Hao & Lin, Yisong, 2016. "Study on China-EU container shipping network in the context of Northern Sea Route," Journal of Transport Geography, Elsevier, vol. 53(C), pages 50-60.
    4. Marielle Christiansen, 1999. "Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem," Transportation Science, INFORMS, vol. 33(1), pages 3-16, February.
    5. Alfandari, Laurent & Davidović, Tatjana & Furini, Fabio & Ljubić, Ivana & Maraš, Vladislav & Martin, Sébastien, 2019. "Tighter MIP models for Barge Container Ship Routing," Omega, Elsevier, vol. 82(C), pages 38-54.
    6. Qiang Meng & Shuaian Wang & Henrik Andersson & Kristian Thun, 2014. "Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions," Transportation Science, INFORMS, vol. 48(2), pages 265-280, May.
    7. Chen, Kang & Chen, Dongxu & Sun, Xueshan & Yang, Zhongzhen, 2016. "Container Ocean-transportation System Design with the factors of demand fluctuation and choice inertia of shippers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 267-281.
    8. Ishwar Murthy & Shenq‐Shyong Her, 1992. "Solving min‐max shortest‐path problems on a network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 669-683, August.
    9. Qiang Meng & Tingsong Wang, 2010. "A chance constrained programming model for short-term liner ship fleet planning problems," Maritime Policy & Management, Taylor & Francis Journals, vol. 37(4), pages 329-346, July.
    10. Zhongzhen Yang & Haiping Shi & Kang Chen & Hongli Bao, 2014. "Optimization of container liner network on the Yangtze River," Maritime Policy & Management, Taylor & Francis Journals, vol. 41(1), pages 79-96, January.
    11. Manuel Herrera & Per J. Agrell & Casiano Manrique-de-Lara-Peñate & Lourdes Trujillo, 2017. "Vessel capacity restrictions in the fleet deployment problem: an application to the Panama Canal," Annals of Operations Research, Springer, vol. 253(2), pages 845-869, June.
    12. Wang, Yadong & Meng, Qiang & Jia, Peng, 2019. "Optimal port call adjustment for liner container shipping routes," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 107-128.
    13. Chen, Jingxu & Jia, Shuai & Wang, Shuaian & Liu, Zhiyuan, 2018. "Subloop-based reversal of port rotation directions for container liner shipping network alteration," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 336-361.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:22:y:1988:i:2:p:83-95. 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: (Matthew Walls). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.