2014
DOI: 10.1016/j.tre.2014.09.013
|View full text |Cite
|
Sign up to set email alerts
|

The strategic berth template problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
38
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(38 citation statements)
references
References 44 publications
0
38
0
Order By: Relevance
“…Considering the temporal attributes, most of the recent studies focus on the dynamic BAP, as introduced by Imai et al (2001). While the studies addressed thus far solve the operational BAP, a new approach to temporal attributes is to consider cyclic vessel arrivals in a longer planning horizon where authors focus on assigning berths for vessels which arrive periodically (Jin et al, 2015, Imai et al, 2014, Peng et al, 2015.…”
Section: Bap Literaturementioning
confidence: 99%
See 1 more Smart Citation
“…Considering the temporal attributes, most of the recent studies focus on the dynamic BAP, as introduced by Imai et al (2001). While the studies addressed thus far solve the operational BAP, a new approach to temporal attributes is to consider cyclic vessel arrivals in a longer planning horizon where authors focus on assigning berths for vessels which arrive periodically (Jin et al, 2015, Imai et al, 2014, Peng et al, 2015.…”
Section: Bap Literaturementioning
confidence: 99%
“…The tactical problems such as the berth template design problem (Imai et al, 2014), the service allocation problem, and the integration of these problems (Lee and Jin, 2013) are also collaborative problems since they consider priorities of the shipping liner and adjust the available terminal resources with respect to these requirements. Recently Wang et al (2015b) improve the level of collaboration for the existing tactical berth allocation problem by proposing two new collaborative mechanisms which are based on the utilities associated with the operations start days of each liner string and inventory cost of transshipment containers.…”
Section: Collaborative Problems In Seaside Operations: Bap and Optimimentioning
confidence: 99%
“…Furthermore, the results were simulated and were compared to the three common vessel service policies used in practice by the MCT operators. Imai et al (2014) considered the case, where the MCT operator faced with excessive vessel service requests, while some new service contracts were under consideration. A strategic berth template problem (BTPS) was designed, where a limited number of vessels were selected to be served and also their berth-windows were scheduled in a specific period of time.…”
Section: Chapter 3 Berth Scheduling Problemmentioning
confidence: 99%
“…The input data for the DBSP mathematical model is generated in the first step of the computational experiments. The available BSP literature and appropriate online resources were the references, considered for adopting the input data that were required to conduct the computational experiments (Imai et al, 2008;Golias and Haralambides, 2011;Imai et al, 2014;Dulebenets et al, 2018a,b;Eniram, 2019). Table 13 represents how the values of the DBSP mathematical model parameters were generated.…”
Section: Input Data Generationmentioning
confidence: 99%
“…Giallombardo et al (2010) studied the tactical berth allocation problem with simultaneous consideration of the quay crane assignment decision in a transshipment terminal in order to maximize the total value of chosen quay crane profiles and to minimize the housekeeping costs generated by transshipment flows between vessels. Imai et al (2014) studied a strategic berth template problem with specific decision of selecting the ships among the requesting ones to be served and arrange their berth-windows within a limited planning horizon.…”
Section: Literature Reviewmentioning
confidence: 99%