IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v45y2009i1p210-221.html
   My bibliography  Save this article

Containership routing with time deadlines and simultaneous deliveries and pick-ups

Author

Listed:
  • Karlaftis, Matthew G.
  • Kepaptsoglou, Konstantinos
  • Sambracos, Evangelos

Abstract

In this paper we seek to determine optimal routes for a containership fleet performing pick-ups and deliveries between a hub and several spoke ports. A capacitated vehicle routing problem with pick-ups, deliveries and time deadlines is formulated and solved using a hybrid genetic algorithm for establishing routes for a dedicated containership fleet. Results on the performance of the algorithm and the feasibility of the approach show that a relatively small fleet of containerships could provide efficient services within deadlines. Moreover, through sensitivity analysis we discuss performance robustness and consistency of the developed algorithm under a variety of problem settings and parameters values.

Suggested Citation

  • Karlaftis, Matthew G. & Kepaptsoglou, Konstantinos & Sambracos, Evangelos, 2009. "Containership routing with time deadlines and simultaneous deliveries and pick-ups," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 210-221, January.
    • Handle: RePEc:eee:transe:v:45:y:2009:i:1:p:210-221
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554508000963
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:transe:v:45:y:2009:i:1:p:210-221. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.