On the public citation graph

Direct Transshipment Optimization in Hub Bulk Transshipment Terminals

https://doi.org/10.2139/ssrn.4679152
0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/atr.5670310107openalex-extracted
Efficient planning of berth allocation for container terminals in Asia
inferredcites →https://doi.org/10.1007/s00170-012-4186-0openalex-extracted
The berth allocation problem with stochastic vessel handling times
inferredcites →https://doi.org/10.1007/s10479-008-0493-0openalex-extracted
Multi-objective and prioritized berth allocation in container ports
inferredcites →https://doi.org/10.1007/s10845-011-0566-9openalex-extracted
A berth allocation planning problem with direct transshipment consideration
inferredcites →https://doi.org/10.1007/s10951-007-0029-5openalex-extracted
A tabu search heuristic for the quay crane scheduling problem
inferredcites →https://doi.org/10.1007/s10951-013-0358-5openalex-extracted
The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions
inferredcites →https://doi.org/10.1016/0377-2217(80)90112-5openalex-extracted
Solution of the zero-one multiple knapsack problem
inferredcites →https://doi.org/10.1016/j.cie.2008.09.024openalex-extracted
A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
inferredcites →https://doi.org/10.1016/j.cie.2011.08.024openalex-extracted
Study on berth planning problem in a container seaport: Using an integrated programming approach
inferredcites →https://doi.org/10.1016/j.cie.2023.109341openalex-extracted
Integrated laycan and berth allocation problem with ship stability and conveyor routing constraints in bulk ports
inferredcites →https://doi.org/10.1016/j.cor.2023.106174openalex-extracted
Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
inferredcites →https://doi.org/10.1016/j.dss.2014.01.003openalex-extracted
A decision support system for quayside operations in a container terminal
inferredcites →https://doi.org/10.1016/j.ejor.2009.05.031openalex-extracted
A survey of berth allocation and quay crane scheduling problems in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2011.07.012openalex-extracted
Berth allocation with time-dependent physical limitations on vessels
inferredcites →https://doi.org/10.1016/j.ejor.2013.08.015openalex-extracted
A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
inferredcites →https://doi.org/10.1016/j.ejor.2014.12.030openalex-extracted
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
inferredcites →https://doi.org/10.1016/j.eswa.2013.08.051openalex-extracted
Particle swarm optimization algorithm for the berth allocation problem
inferredcites →https://doi.org/10.1016/j.eswa.2022.117141openalex-extracted
Exact and heuristic methods for the berth allocation problem with multiple continuous quays in tidal bulk terminals
inferredcites →https://doi.org/10.1016/j.jtrangeo.2017.08.011openalex-extracted
Path to a multilayered transshipment port system: How the Yangtze River bulk port system has evolved
inferredcites →https://doi.org/10.1016/j.measurement.2019.107458openalex-extracted
Sustainable belt conveyor operation by active speed control
inferredcites →https://doi.org/10.1016/j.trb.2004.04.004openalex-extracted
Berth allocation in a container port: using a continuous location space approach
inferredcites →https://doi.org/10.1016/j.trb.2016.05.012openalex-extracted
Bi-objective optimization for the container terminal integrated planning
inferredcites →https://doi.org/10.1016/j.trb.2020.10.010openalex-extracted
Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel
inferredcites →https://doi.org/10.1016/j.tre.2012.07.006openalex-extracted
Marine container terminal configurations for efficient handling of mega-containerships
inferredcites →https://doi.org/10.1016/j.tre.2012.08.006openalex-extracted
Feeder vessel management at container transshipment terminals
inferredcites →https://doi.org/10.1016/j.tre.2013.03.003openalex-extracted
Exact and heuristic methods to solve the berth allocation problem in bulk ports
inferredcites →https://doi.org/10.1016/j.tre.2015.06.008openalex-extracted
Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results
inferredcites →https://doi.org/10.1016/j.trpro.2021.02.025openalex-extracted
Transshipment Activities in the Rhine Ports
inferredcites →https://doi.org/10.1016/s0167-6377(98)00010-8openalex-extracted
The berth planning problem
inferredcites →https://doi.org/10.1016/s0191-2615(99)00057-0openalex-extracted
The dynamic berth allocation problem for a container port
inferredcites →https://doi.org/10.1016/s0377-2217(00)00200-9openalex-extracted
Berth planning and resources optimisation at a container terminal via discrete event simulation
inferredcites →https://doi.org/10.1080/0305215x.2013.768241openalex-extracted
Solving the dynamic berth allocation problem by simulated annealing
inferredcites →https://doi.org/10.1080/03088839.2016.1275863openalex-extracted
Analysis of the development potential of bulk shipping network on the Yangtze River
inferredcites →https://doi.org/10.1137/s0097539700382820openalex-extracted
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
inferredcites →https://doi.org/10.1145/326619.326694openalex-extracted
The zero/one multiple knapsack problem and genetic algorithms
inferredcites →https://doi.org/10.1287/trsc.1050.0120openalex-extracted
Models and Tabu Search Heuristics for the Berth-Allocation Problem
inferredcites →https://doi.org/10.1287/trsc.1060.0171openalex-extracted
The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach
inferredcites →https://doi.org/10.1287/trsc.1120.0419openalex-extracted
A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals
inferredcites →https://doi.org/10.1287/trsc.1120.0428openalex-extracted
An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment
inferredcites →https://doi.org/10.1287/trsc.2018.0822openalex-extracted
Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.