Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations
From MaRDI portal
Publication:4411212
DOI10.1287/trsc.36.1.63.576zbMath1065.90511MaRDI QIDQ4411212
Udatta S. Palekar, Ananthapadmanabhan Narasimhan
Publication date: 7 July 2003
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.36.1.63.576
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C59: Approximation methods and heuristics in mathematical programming
90B20: Traffic problems in operations research
Related Items
Yard crane scheduling for container storage, retrieval, and relocation, An optimisation framework for yard planning in a container terminal: Case with automated rail-mounted gantry cranes, Scheduling automated triple cross-over stacking cranes in a container yard, Real-time scheduling for twin RMGs in an automated container yard, Discrete time model and algorithms for container yard crane scheduling, A crane scheduling method for port container terminals, An exact method for scheduling a yard crane, AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM