On the public citation graph

An enhanced sinh cosh optimizer for berth allocation and quay crane assignment considering shared crane

0 signed · 16 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.1007/s11042-020-10139-6openalex-snapshot
A review on genetic algorithm: past, present, and future
inferredcites →https://doi.org/10.1016/j.advengsoft.2013.12.007openalex-snapshot
Grey Wolf Optimizer
inferredcites →https://doi.org/10.1016/j.asoc.2014.04.035openalex-snapshot
Biased random key genetic algorithm for the Tactical Berth Allocation Problem
inferredcites →https://doi.org/10.1016/j.cie.2009.08.002openalex-snapshot
The allocation of berths and quay cranes by using a sub-gradient optimization technique
inferredcites →https://doi.org/10.1016/j.cie.2020.106672openalex-snapshot
Integrated continuous berth allocation and quay crane assignment and scheduling problem with time-dependent physical constraints in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2009.05.031openalex-snapshot
A survey of berth allocation and quay crane scheduling problems in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2013.10.015openalex-snapshot
Optimal berth allocation and time-invariant quay crane assignment in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2014.12.030openalex-snapshot
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
inferredcites →https://doi.org/10.1016/j.ejor.2018.11.007openalex-snapshot
New exact methods for the time-invariant berth allocation and quay crane assignment problem
inferredcites →https://doi.org/10.1016/j.tre.2007.03.003openalex-snapshot
The simultaneous berth and quay crane allocation problem
inferredcites →https://doi.org/10.1016/j.tre.2008.03.001openalex-snapshot
Heuristics for the integration of crane productivity in the berth allocation problem
inferredcites →https://doi.org/10.1016/j.tre.2015.06.008openalex-snapshot
Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results
inferredcites →https://doi.org/10.1057/jors.2010.54openalex-snapshot
Berth and quay crane allocation: a moldable task scheduling model
inferredcites →https://doi.org/10.1109/4235.996017openalex-snapshot
A fast and elitist multiobjective genetic algorithm: NSGA-II
inferredcites →https://doi.org/10.1109/fuzz-ieee.2015.7337880openalex-snapshot
Learning opposites with evolving rules
inferredcites →https://doi.org/10.32604/cmc.2022.026625openalex-snapshot
Fuzzy Hybrid Coyote Optimization Algorithm for Image Thresholding
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.