A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals

DOI10.1016/J.CAMWA.2010.12.009MaRDI QIDQ552189zbMATHOpenAlexFDO

Authors Hassan Rashidi, Edward Tsang

Publication date 21 July 2011

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2010.12.009

zbMATH Keywords

optimizationcontainer terminalsscheduling problems\texttt{DSGAV}network simplex algorithmsearch methods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• AGV scheduling in automated container terminal based on differential evolution algorithm
• Scheduling and routing algorithms for AGVs: A survey
• Determination of the number of automated guided vehicles required at a semi-automated container terminal
• Inventory-based dispatching of automated guided vehicles on container terminals
• Scheduling of automated straddle carrier based on heuristic algorithm

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 1003246 (Why is no real title available?)
• scientific article; zbMATH DE number 1766755 (Why is no real title available?)
• scientific article; zbMATH DE number 795215 (Why is no real title available?)
• A general pricing scheme for the simplex method
• A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
• Algorithms for the simple equal flow problem
• An efficient cost scaling algorithm for the assignment problem
• An efficient implementation of the network simplex method
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Dispatching automated guided vehicles in a container terminal
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Network flows. Theory, algorithms, and applications.
• Pivot Strategies for Primal-Simplex Network Codes
• Scheduling and routing algorithms for AGVs: A survey
• Theoretical Properties of the Network Simplex Method

Cited in

(8)

• Determination of the number of automated guided vehicles required at a semi-automated container terminal
• Improving scheduling in multi-AGV systems by task prediction
• Real-time scheduling for twin RMGs in an automated container yard
• Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers
• An improved shuffled frog leaping algorithm for multiload AGV dispatching in automated container terminals
• Transport operations in container terminals: literature overview, trends, research directions and classification scheme
• Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda
• AGV scheduling in automated container terminal based on differential evolution algorithm

This page was built for publication: A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals

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