IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i22p6809-6832.html
   My bibliography  Save this article

An exact algorithm for the single liner service design problem with speed optimisation

Author

Listed:
  • Nadjib Brahimi
  • Ali Cheaitou
  • Pierre Cariou
  • Dominique Feillet

Abstract

This paper models a single liner service design and operations problem. The model selects the ports to be included, their sequence, the sailing speed of vessels, the number of vessels and the amounts of cargo to transport by the service. The objective is to maximise profit. First, a relaxation with a mixed-integer nonlinear programming (MINLP) formulation is proposed. We show how to obtain the optimal speed value. Once this value is obtained, the mathematical programming formulation becomes a mixed-integer linear program (MILP). Then, a two-step exact algorithm is presented to solve the problem. Using real data, the optimal solution was found in less than 1 min for small-size problems and in few hours for relatively large-size problems. More tests were carried out on randomly generated data sets with up to 25 ports. The results of these tests are rather promising, and they enabled us to identify the performance limits of the algorithm.

Suggested Citation

  • Nadjib Brahimi & Ali Cheaitou & Pierre Cariou & Dominique Feillet, 2021. "An exact algorithm for the single liner service design problem with speed optimisation," International Journal of Production Research, Taylor & Francis Journals, vol. 59(22), pages 6809-6832, November.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:22:p:6809-6832
    DOI: 10.1080/00207543.2020.1828636
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1828636
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1828636?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
    ---><---

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

    Citations

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


    Cited by:

    1. Kidd, Martin P. & Darvish, Maryam & Coelho, Leandro C. & Gendron, Bernard, 2024. "A relax-and-restrict matheuristic for supply chain network design with facility location and customer due date flexibility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).

    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:taf:tprsxx:v:59:y:2021:i:22:p:6809-6832. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.