Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations

DOI10.1287/TRSC.36.1.63.576MaRDI QIDQ4411212zbMATH OpenOpenAlexFDO

Authors Ananthapadmanabhan Narasimhan, Udatta S. Palekar

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

zbMATH Keywords

branch-and-boundrouting problem

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A multiple-crane-constrained scheduling problem in a container terminal
• Port space allocation with a time dimension
• An exact method for scheduling a yard crane
• A tabu search heuristic for the inland container transportation problem
• Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals

Cited in

(22)

• Discrete time model and algorithms for container yard crane scheduling
• A beam search algorithm for the load sequencing of outbound containers in port container terminals
• On combinatorial optimization and mechanism design problems arising at container ports. With a foreword by Prof. Dr. Erwin Pesch
• Reformulated acyclic partitioning for rail-rail containers transshipment
• A crane scheduling method for port container terminals
• An exact method for scheduling a yard crane
• Transport operations in container terminals: literature overview, trends, research directions and classification scheme
• Vehicle Routing Problems and Container Terminal Operations – An Update of Research
• The loader problem: formulation, complexity and algorithms
• Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches
• AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM
• Transportation problem with nonlinear side constraints a branch and bound approach
• scientific article; zbMATH DE number 6177873 (Why is no real title available?)
• Yard crane scheduling in the ground trolley-based automated container terminal
• Models and algorithms for a yard crane scheduling problem in container ports
• Iterated greedy for the yard crane scheduling problem with input/output assignment
• Solving the yard crane scheduling problem with dynamic assignment of input/output points
• Yard crane scheduling for container storage, retrieval, and relocation
• Vehicle routing concepts in the closed-loop container network of ARN -- a case study
• 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

This page was built for publication: Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411212)