2016
DOI: 10.1016/j.ejor.2015.10.021
|View full text |Cite
|
Sign up to set email alerts
|

A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
42
1

Year Published

2017
2017
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(44 citation statements)
references
References 36 publications
1
42
1
Order By: Relevance
“…They assume that each vessel has a maximal allowable completion time and each berth has an earliest available time and a latest available time. Barros et al [43], Xu et al [44], Lalla-Ruiz et al [45] and Du et al [4] investigate the berth scheduling problem in tidal ports where the available depth at low tide is inadequate for sailing or berthing of vessels; this shares some similarities with our study. Barros et al [43] consider a BSPD in tidal bulk ports.…”
Section: Literature Reviewsupporting
confidence: 76%
See 1 more Smart Citation
“…They assume that each vessel has a maximal allowable completion time and each berth has an earliest available time and a latest available time. Barros et al [43], Xu et al [44], Lalla-Ruiz et al [45] and Du et al [4] investigate the berth scheduling problem in tidal ports where the available depth at low tide is inadequate for sailing or berthing of vessels; this shares some similarities with our study. Barros et al [43] consider a BSPD in tidal bulk ports.…”
Section: Literature Reviewsupporting
confidence: 76%
“…By dividing the time horizon into two periods (i.e., low tide period and high tide period), they formulate the problem as mixed integer linear programming models. Lalla-Ruiz et al [45] propose an alternative mathematical formulation for BAPTL introduced by Xu et al [44] based upon the generalized set partitioning problem, which allows to tackle the problem with the planning horizon of more than two periods and includes constraints related to berth and vessel time windows. Du et al [4] factor the consideration of tides into BSPC and retrofit the model of BSPC as a nonlinear programming model.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Considering spatial attributes, the discrete BAP has been strongly put forward in Imai et al (2001), Cordeau et al (2005) and Buhrkal et al (2011). Recently, Hu (2015, Hsu (2016), Lalla-Ruiz et al (2016a) address variants of the discrete BAP. The pioneering study considering continuous BAP is Imai et al (2005).…”
Section: Bap Literaturementioning
confidence: 99%
“…All vessels must be berthed and processed within the planning horizon, and all vessels must be moored within the boundaries of the quay. The availability of some berthing positions might differ due to time windows (Cordeau et al, 2005), different priorities can be assigned to each vessel (Cheong et al, 2010), some of the vessels can have favorite berthing positions , or there could be different time-availabilities due to debts and tides (Lalla-Ruiz et al, 2016a). The goal of BAP is to provide fast and reliable services to vessels.…”
Section: Bap Literaturementioning
confidence: 99%
“…The matching of supply and demand is an important prerequisite for improving efficiency [21], and effective supply chain management is important for meeting the existing demand. This is reflected in various fields, such as passenger transportation, freight transportation, and shipping, and it is particularly important in cultivated land protection [22][23][24]. Value engineering is a systematic method, which focuses on the realization of the functions that meet demand at a lower life cycle cost [25].…”
Section: Introductionmentioning
confidence: 99%