IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v59y2012i3-4p266-277.html
   My bibliography  Save this article

Minimizing the total weighted delivery time in container transportation scheduling

Author

Listed:
  • Kangbok Lee
  • Byung‐Cheon Choi
  • Joseph Y‐T. Leung
  • Michael L. Pinedo
  • Dirk Briskorn

Abstract

We consider the problem of transporting containers from one port to another using a fleet of ships. Each ship has a capacity constraint that limits the total number of containers it can carry; each ship calls on a specific set of ports that is referred to as its route and each ship follows a fixed route with a fixed departure time at each port. Each container has a release date, that is, the date when it becomes available for shipping at its origination port; it cannot be loaded onto a ship before its release date. Also, each container has an importance factor referred to as its weight. The delivery time of a container is defined as the time when the container is delivered by a ship at its destination port. We consider the problem of minimizing the total weighted delivery times over all containers. We consider three scenarios with regard to the routes of the ships, namely, (i) identical routes, (ii) nested routes, and (iii) arbitrary routes. We determine the computational complexity of the problems and provide heuristics with their worst‐case analyses. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012

Suggested Citation

  • Kangbok Lee & Byung‐Cheon Choi & Joseph Y‐T. Leung & Michael L. Pinedo & Dirk Briskorn, 2012. "Minimizing the total weighted delivery time in container transportation scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 266-277, April.
    • Handle: RePEc:wly:navres:v:59:y:2012:i:3-4:p:266-277
    DOI: 10.1002/nav.21480
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21480
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21480?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
    ---><---

    References listed on IDEAS

    as
    1. Marielle Christiansen & Kjetil Fagerholt & David Ronen, 2004. "Ship Routing and Scheduling: Status and Perspectives," Transportation Science, INFORMS, vol. 38(1), pages 1-18, February.
    2. Celia A. Glass & Hans Kellerer, 2007. "Parallel machine scheduling with job assignment restrictions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(3), pages 250-257, April.
    3. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
    4. K Fagerholt & M Christiansen, 2000. "A combined ship scheduling and allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(7), pages 834-842, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Dan Zhuge & Shuaian Wang & Lu Zhen & Gilbert Laporte, 2020. "Schedule design for liner services under vessel speed reduction incentive programs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(1), pages 45-62, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ricardo Gatica & Pablo Miranda, 2011. "Special Issue on Latin-American Research: A Time Based Discretization Approach for Ship Routing and Scheduling with Variable Speed," Networks and Spatial Economics, Springer, vol. 11(3), pages 465-485, September.
    2. Choi, Byung-Cheon & Briskorn, Dirk & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2008. "Allocating containers to ships with fixed departure times," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 641, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
    4. Bredström, David & Rönnqvist, Mikael, 2006. "Supply Chain Optimization in Pulp Distribution using a Rolling Horizon Solution Approach," Discussion Papers 2006/17, Norwegian School of Economics, Department of Business and Management Science.
    5. Jasmine Lam, 2010. "An integrated approach for port selection, ship scheduling and financial analysis," Netnomics, Springer, vol. 11(1), pages 33-46, April.
    6. K Fagerholt & G Laporte & I Norstad, 2010. "Reducing fuel emissions by optimizing speed on shipping routes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 523-529, March.
    7. Kjetil Fagerholt *, 2004. "Designing optimal routes in a liner shipping problem," Maritime Policy & Management, Taylor & Francis Journals, vol. 31(4), pages 259-268, October.
    8. Al-Khayyal, Faiz & Hwang, Seung-June, 2007. "Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model," European Journal of Operational Research, Elsevier, vol. 176(1), pages 106-130, January.
    9. Nikolaos P. Rachaniotis & Marisa Masvoula, 2020. "A decision tool for scheduling fleets of fuel supply vessels," Operational Research, Springer, vol. 20(3), pages 1543-1557, September.
    10. Meng, Qiang & Wang, Shuaian & Lee, Chung-Yee, 2015. "A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 1-19.
    11. Rigot-Müller, Patrick & Cheaitou, Ali & Etienne, Laurent & Faury, Olivier & Fedi, Laurent, 2022. "The role of polarseaworthiness in shipping planning for infrastructure projects in the Arctic: The case of Yamal LNG plant," Transportation Research Part A: Policy and Practice, Elsevier, vol. 155(C), pages 330-353.
    12. Harilaos N. Psaraftis, 2019. "Ship routing and scheduling: the cart before the horse conjecture," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 21(1), pages 111-124, March.
    13. J E Korsvik & K Fagerholt & G Laporte, 2010. "A tabu search heuristic for ship routing and scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 594-603, April.
    14. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship fleet deployment with container transshipment operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 470-484.
    15. Hennig, F. & Nygreen, B. & Furman, K.C. & Song, J., 2015. "Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery," European Journal of Operational Research, Elsevier, vol. 243(1), pages 41-51.
    16. Persson, Jan A. & Gothe-Lundgren, Maud, 2005. "Shipment planning at oil refineries using column generation and valid inequalities," European Journal of Operational Research, Elsevier, vol. 163(3), pages 631-652, June.
    17. Said El Noshokaty, 2021. "Shipping optimization systems (SOS) for tramp: stochastic cargo soft time windows," Journal of Shipping and Trade, Springer, vol. 6(1), pages 1-19, December.
    18. Said El Noshokaty, 2017. "Shipping Optimisation Systems (SOS): tramp optimisation perspective," Journal of Shipping and Trade, Springer, vol. 2(1), pages 1-36, December.
    19. Marielle Christiansen & Kjetil Fagerholt, 2002. "Robust ship scheduling with multiple time windows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 611-625, September.
    20. Kjetil Fagerholt & Lars Hvattum & Trond Johnsen & Jarl Korsvik, 2013. "Routing and scheduling in project shipping," Annals of Operations Research, Springer, vol. 207(1), pages 67-81, August.

    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:wly:navres:v:59:y:2012:i:3-4:p:266-277. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.