IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/750232.html
   My bibliography  Save this article

A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows

Author

Listed:
  • Krystel K. Castillo-Villar
  • Rosa G. González-Ramírez
  • Pablo Miranda González
  • Neale R. Smith

Abstract

This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances.

Suggested Citation

  • Krystel K. Castillo-Villar & Rosa G. González-Ramírez & Pablo Miranda González & Neale R. Smith, 2014. "A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-13, April.
    • Handle: RePEc:hin:jnlmpe:750232
    DOI: 10.1155/2014/750232
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/750232.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2014/750232.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/750232?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:750232. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.