A critical-shaking neighborhood search for the yard allocation problem
From MaRDI portal
Publication:2503090
DOI10.1016/j.ejor.2005.01.064zbMath1103.90342OpenAlexW2019769205MaRDI QIDQ2503090
Publication date: 13 September 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.01.064
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Some complexity results and an efficient algorithm for quay crane scheduling problem ⋮ Tactical berth allocation under uncertainty ⋮ Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports ⋮ A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension ⋮ Flexible space-sharing strategy for storage yard management in a transshipment hub port ⋮ An integrated model for berth and yard planning in container terminals with multi-continuous berth layout ⋮ Short-term space allocation for storage yard management in a transshipment hub port ⋮ Operations research at container terminals: a literature update ⋮ A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ⋮ Storage yard operations in container terminals: literature overview, trends, and research directions ⋮ An investigation into yard allocation for outbound containers ⋮ Online rules for container stacking
Cites Work
This page was built for publication: A critical-shaking neighborhood search for the yard allocation problem
