Excellence in Research and Innovation for Humanity

International Science Index


Select areas to restrict search in scientific publication database:
10008781
Pre- and Post-Analyses of Disruptive Quay Crane Scheduling Problem
Authors:
Abstract:
In the past, the quay crane operations have been well studied. There were a certain number of scheduling algorithms for quay crane operations, but without considering some nuisance factors that might disrupt the quay crane operations. For example, bad grapples make a crane unable to load or unload containers or a sudden strong breeze stops operations temporarily. Although these disruptive conditions randomly occur, they influence the efficiency of quay crane operations. The disruption is not considered in the operational procedures nor is evaluated in advance for its impacts. This study applies simulation and optimization approaches to develop structures of pre-analysis and post-analysis for the Quay Crane Scheduling Problem to deal with disruptive scenarios for quay crane operation. Numerical experiments are used for demonstrations for the validity of the developed approaches.
Digital Article Identifier (DAI):

References:

[1] International Association of Ports and Harbors, https://www.iaphworldports.org/statistics.
[2] Taiwan International Ports Corporation, https://kl.twport.com.tw/chinese/.
[3] K. H. Yang, “The Influence of the Quay Crane Traveling Time for the Quay Crane Scheduling Problem”, Proceeding of the International MultiConference of Engineers and Computer Scientists, vol. 2, 1298-1301, 2012
[4] C. F. Daganzo, “The crane scheduling problem,” Transportation research Part B, vol. 23, no. 3, 1989, pp.159-175.
[5] R. I. Peterkofsky and C. F. Daganzo (1990). "A branch and bound solution method for the crane scheduling problem," Transportation Research Part B, vol. 20, no. 3 1990, pp. 159-172.
[6] D. H. Lee, H. Q. Wang and L. Miao, "Quay crane scheduling with non-interference constraints in port container terminals," Transportation Research Part E vol. 44 no. 1 2008, pp. 124–135.
[7] Moccia, L., et al. (2006). "A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal." Naval Research Logistics 53: 45-59.
[8] Y. Guan, K. Yang, and Z. Zhou (2013). "The crane scheduling problem: models and solution approaches," Annals of Operation Research, vol. 203, no.1, 2013, pp. 119-139.
[9] A. Lim, B. Rodrigues, F. Xiao and Y. Zhu, “Crane scheduling using Tabu search,” 14th IEEE International Conference on Tools with Artificial Intelligence, 2002.
[10] Y. Zhu and A. Lim, "Crane scheduling with non-crossing constraint," Journal of the Operational Research Society, vol. 57, 2006, pp.1464-1471.
[11] N. Al-Dhaheri, A. Jebali, A. Diabat "A simulation-based Genetic Algorithm approach for the quay crane scheduling under uncertainty," Simulation Modelling Practice and Theory vol. 66: 2016, pp. 122-138
[12] C. Liu, L. Zheng, and C. Zhang, "Behavior perception-based disruption models for berth allocation and quay crane assignment problems," Computers & Industrial Engineering, vol. 97, 2016, pp. 258-275.
Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007