A Distributed Constraint Optimization Approach for Vessel Rotation Planning

Li, Shijie; Negenborn, Rudy R.; Lodewijks, Gabriël

doi:10.1007/978-3-319-11421-7_5

Cited by 8 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kizilay et al (2018), for instance, use CP to address a decision problem in integrated port container terminal operations. Li et al (2014) use CP to plan vessel rotations (loops) among terminals within a port. In solving a berth allocation problem, Qin et al (2016) show that CP outperforms integer programming in three instances, namely when using dynamic arrivals over static arrivals, when using fine time granularity, and when the restriction of the objective towards the decision variables is not tight.…”

Section: Constraint Programmingmentioning

confidence: 99%

Berth planning and real-time disruption recovery: a simulation study for a tidal port

Steeg

Oudshoorn²,

Yorke-Smith

2022

Flex Serv Manuf J

View full text Add to dashboard Cite

With the increasing volume of container freight transport, future port planning is crucial. Simulation models provide a means to gain insight in the effects of terminal expansions. Detailed simulations incorporate berth allocation: assigning vessels a time and location at the quay wall, where the vessel is loaded and unloaded. This article develops decision models for both offline preliminary berth planning and for online recovery of this plan during simulation. First, we develop an optimisation-based approach that incorporates realistic aspects—cyclic vessel arrivals, tidal windows, and minimisation of vessel draught during low water periods—in order to develop a cyclic baseline berth allocation plan. The approach can proactively incorporate slack for increased robustness. Exploiting a constraint-based solver, we can obtain optimal or satisficing solutions for a year’s operation of a large port. The resulting preliminary berth plan is used as a basis for the arrival times. However, disruptions can occur, such as vessel arrival and loading times varying from the planned. Hence, second, we develop a real-time disruption management decision model. This multi-level heuristic approach reacts to disruptions while minimising perturbation of the original berth plan. Computational experiments with a high-resolution simulator show our recovery approach finds good solutions until a tipping point of disturbance. Results also show that when the expected occupation of a terminal is higher, strengthening robustness of the preliminary plan has increased importance. The approach described in the article is implemented for a major European inland tidal port, forming the basis of a simulation-based decision support tool for operational planning and exploring port expansion options.

show abstract

Section: Constraint Programmingmentioning

confidence: 99%

Berth planning and real-time disruption recovery: a simulation study for a tidal port

Steeg

Oudshoorn²,

Yorke-Smith

2022

Flex Serv Manuf J

View full text Add to dashboard Cite

show abstract

“…CBBA + [22] single-worker multi-task ML (Li et al, 2014) - [20] single-worker multi-task (MASTA, 2021)…”

Section: Resourcesmentioning

confidence: 99%

“…The main difficulty in applying these methods for task reassignment lies in the representation of a real-world problem as a DCOP, or even several COP subproblems, since it requires expertise in the resolution method (e.g. [15]).…”

Section: Related Workmentioning

confidence: 99%

“…The problem of efficient task assignment among executing entities is common to many real-world applications for logistics [13,15], collective robotics [7,22], distributed systems [20,12], or more recently Big Data [1]. In particular, Data Science, which involves the processing of large volumes of data which requires distributed file systems and parallel programming, challenges distributed computing with regard to task allocation and load-balancing.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Task Bundle Delegation for Reducing the Flowtime

Beauprez

Caron

Morge

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…Several publications on improving the efficiency of transport of inland vessels between terminals in a large seaport may be found elsewhere (4). All existing work is from the perspective of enhancing the alignment of terminals and inland vessels.…”

mentioning

confidence: 99%

Approach Integrating Mixed-Integer Programming and Constraint Programming for Planning Rotations of Inland Vessels in a Large Seaport

Negenborn

Lodewijks

2016

Transportation Research Record: Journal of the Transportation R

Self Cite

View full text Add to dashboard Cite

During the past decade, inland vessels have gained importance in container transport because of their reliability, low environmental impact, and major capacity for increased exploitation. Although inland vessels are crucial in container transport between terminals in the port and the hinterland, in a large seaport like the one in Rotterdam, Netherlands, only 62% of the inland vessels leave the port on time. The other vessels have to stay in the port area for a longer time than planned. This situation leads to uncertainty in waiting times of vessels at terminals and low utilization of terminal quay resources. A two-phase approach is proposed that integrates mixed-integer programming (MIP) and constraint programming (CP) to solve the problem by generating optimal rotation plans for inland vessels. In the first phase, the single-vessel optimization problem is formulated on the basis of MIP and solved with state-of-the-art MIP solvers. In the second phase, the multiple-vessel coordination problem is formulated on the basis of CP, and a large neighborhood search–based heuristic is proposed to solve the problem. Commercial CP solvers are also used for comparison. Simulation results show that the proposed large neighborhood search–based heuristic outperforms the commercial CP solver with regard to both the solution quality and the computation time. Moreover, simulation results with respect to departure time of the last vessel, total sojourn time, and waiting time show significant improvement with earlier departure times and shorter sojourn times and waiting times.

show abstract

A Distributed Constraint Optimization Approach for Vessel Rotation Planning

Cited by 8 publications

References 15 publications

Berth planning and real-time disruption recovery: a simulation study for a tidal port

Berth planning and real-time disruption recovery: a simulation study for a tidal port

Task Bundle Delegation for Reducing the Flowtime

Approach Integrating Mixed-Integer Programming and Constraint Programming for Planning Rotations of Inland Vessels in a Large Seaport

Contact Info

Product

Resources

About