 The berth allocation problem: a formulation reflecting time Window service deadlinesMihalis Golias, Maria Boile and Sotirios Theofanis No 207826, 48th Annual Transportation Research Forum, Boston, Massachusetts, March 15-17, 2007 from Transportation Research Forum Abstract: The berth-allocation problem (BAP) aims to optimally schedule and assign vessels to berthing areas along a quay. The vessels arrive at the port over a period of time and normally request service and departure within a time window. These time windows are usually determined through contractual agreements between the port operator and the carrier, in terms of time of departure after the vessel’s arrival at the port. Formulations presented in the current literature, reduce the time window to a point in time. In this paper the discrete dynamic BAP (DDBAP) is formulated as a linear MIP problem with the objective to simultaneously minimize the cost from vessels’ late departures (departure past the time window) and maximize the benefits from vessels’ early departures and timely departures (departure before and within the requested time window). Two different models along with numerical examples and a comparison to other BAP models are presented to demonstrate the benefits of the proposed berth scheduling formulation. Keywords: Research and Development/Tech Change/Emerging Technologies; Research Methods/ Statistical Methods (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ags:ndtr07:207826 Access Statistics for this paper More papers in 48th Annual Transportation Research Forum, Boston, Massachusetts, March 15-17, 2007 from Transportation Research Forum |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.