Berth scheduling with variable cost functions
This article presents a new mathematical formulation for the berth scheduling problem. The objective is to simultaneously minimize the total costs from vessels’ late departure and waiting time, and maximize the total premiums from vessels’ early departures. It is assumed that different vessels have different variable penalty/premium cost functions (PPCFs) that are based on contractual agreements between the liner shipping company and the terminal operator. A genetic algorithms-based heuristic is proposed to solve the resulting problem. A number of computational examples are presented to: (a) assess four different berth scheduling policies that are based on three different contractual agreements and (b) evaluate the effect of non-linear PPCFs. Computational results show that: (a) penalty/premium cost distribution among vessels display distinctive variations between the four berth scheduling policies, and (b) contractual agreements with constant (within a time window), followed by hourly (outside the time window) penalties/premiums should be favored during contractual agreement negotiations between terminal operators and liner shipping companies.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 13 (2011)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.palgrave-journals.com/|
Web page: http://www.mar-economists.org/
More information through EDIRC
|Order Information:||Web: http://www.springer.com/business+%26+management/journal/41278/PS2|
When requesting a correction, please mention this item's handle: RePEc:pal:marecl:v:13:y:2011:i:2:p:174-189. 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: (Sonal Shukla)or (Rebekah McClure)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.