A follow-up survey of berth allocation and quay crane scheduling problems in container terminals

From MaRDI portal
Publication:319438

DOI10.1016/j.ejor.2014.12.030zbMath1346.90326OpenAlexW1998016704MaRDI QIDQ319438

Christian Bierwirth, Frank Meisel

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.030




Related Items (76)

Gantry crane and shuttle car scheduling in modern rail-rail transshipment yardsTwin-crane scheduling during seaside workload peaks with a dedicated handshake areaA Benders decomposition-based framework for solving quay crane scheduling problemsThe matching relaxation for a class of generalized set partitioning problemsScheduling cranes at an indented berthOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminalsCompact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problemsBerth allocation and quay crane assignment/scheduling problem under uncertainty: a surveyExact methods for the quay crane scheduling problem when tasks are modeled at the single container levelBerth assignment for liner carrier clusters under a cooperative environmentExact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problemsMinimum cost noncrossing flow problem on layered networksCombining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vesselSequencing dual-spreader crane operations: mathematical formulation and heuristic algorithmAn improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated modelConstraint programming models for integrated container terminal operationsPilotage planning in seaportsCoordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐IIVessel Service Planning in SeaportsSolving the single crane scheduling problem at rail transshipment yardsA Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution AlgorithmScheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacitySimultaneous operation of next-generation and traditional quay cranes at container terminalsThe synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directionsNovel formulations and modeling enhancements for the dynamic berth allocation problemIntegrated truck and workforce scheduling to accelerate the unloading of trucksRobust optimization for the integrated berth allocation and quay crane assignment problemOn minimizing dataset transfer time in an acyclic network with four serversMIP approaches for the integrated berth allocation and quay crane assignment and scheduling problemQuay partitioning problemImproved sequential insertion heuristics for berth allocation problemsA POPMUSIC-based approach for the berth allocation problem under time-dependent limitationsScheduling personnel for the build-up of unit load devices at an air cargo terminal with limited spaceExact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problemBerth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decompositionA generalized classification scheme for crane scheduling with interferenceHandling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision modelIntegrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combinationNew exact methods for the time-invariant berth allocation and quay crane assignment problemIntegrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vesselsIntegrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channelConstraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal portsAn evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container portsExact and heuristic methods for optimizing lock-quay system in inland waterwayThe use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithmThe quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approachAn exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival timesScheduling cooperative gantry cranes with seaside and landside jobsExact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisionsA Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraintsThe berth allocation problem in terminals with irregular layoutsAn exact solution approach for scheduling cooperative gantry cranesApproximate the scheduling of quay cranes with non-crossing constraintsA feasibility-based heuristic for the container pre-marshalling problemThe study of the unidirectional quay crane scheduling problem: complexity and risk-aversionAssignment problem with conflictsOptimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspectiveAn exact algorithm for the unidirectional quay crane scheduling problem with vessel stabilityIntegrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quaysThe traveling salesman puts-on a hard hat -- tower crane scheduling in construction projectsMachine scheduling with soft precedence constraintsA decomposition-based approach to the scheduling of identical automated yard cranes at container terminalsA self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter controlCombinatorial approach to exactly solving discrete and hybrid berth allocation problemSelecting algorithms for large berth allocation problemsNew Lower Bound and Exact Method for the Continuous Berth Allocation ProblemDynamic programming algorithms for the general quay crane double-cycling problem with internal-reshufflesRouting two stacking cranes with predetermined container sequencesOn the Berth Allocation ProblemStraddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areasScheduling ships movements within a canal harborMetaheuristic approaches for the Berth Allocation ProblemOptimizing consolidation processes in hubs: the hub-arrival-departure problemNew formulations and solutions for the strategic berth template problemVehicle Sequencing at Transshipment Terminals with Handover RelationsExploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems



Cites Work


This page was built for publication: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals