Mi Chao
School of Economics and Management, Shanghai Maritime University, China
Chaijiaqi
Logistics Engineering College, Shanghai Maritime University, China
Shen Yifan
Logistics Engineering College, Shanghai Maritime University, China
Wang Junxian
Logistics Engineering College, Shanghai Maritime University, China
MI Weijian
Container Supply Chain Technology Engineering Research Center, Shanghai Maritime University, China
ABSTRACT
Thedecisionofquay craneschedulingproblemis crucialforport operators in port container terminals. In this study, in view of analysis and summary of general experience in the quay-crane resource allocation, such allocation problem in container terminals is proposed on the basis of advance rule,namely, how to assign limited quay cranes for berthing vessels while meeting the requirement of handling workloads and its distribution, in-port turnaround time, dispatching fees and other factors. According to the features of loading and unloading operations in container terminals, an integer programming model is established for quaycrane allocation problem and then corresponding solver is developed by AIMMS tool. The practicality and effectiveness of the model is demonstrated by large amounts of case study and the robustness of algorithm is testified to be feasible. The utilization of this decision model can improve the overall performance of quay cranes,reducehandling cost and enhance operational efficiency.
PDF References Citation
How to cite this article
Mi Chao, Chaijiaqi, Shen Yifan, Wang Junxian and MI Weijian, 2013. Study on Quay Crane Allocation Problem for Thevessels Withdifferent Priorities
in Container Terminals. Information Technology Journal, 12: 4625-4631.
DOI: 10.3923/itj.2013.4625.4631
URL: https://scialert.net/abstract/?doi=itj.2013.4625.4631
DOI: 10.3923/itj.2013.4625.4631
URL: https://scialert.net/abstract/?doi=itj.2013.4625.4631
REFERENCES
- Bierwirth, C. and F. Meisel, 2010. A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res., 202: 615-627.
Direct Link - Meisel, F. and C. Bierwirth, 2011. A unified approach for the evaluation of quay crane scheduling models and algorithms. Comput. Oper. Res., 38: 683-693.
CrossRefDirect Link - Chen, J.H., D.H. Lee and J.X. Cao, 2011. Heuristics for quay crane scheduling at indented berth. Transp. Res. Part E: Logistics Transp. Rev., 47: 1005-1020.
CrossRefDirect Link - Chen, L., L.F. Xi, J.G. Cai, B. Nathalie and D. Pierre, 2006. An integrated approach for modeling and solving the scheduling problem of container handling systems. J. Zhejiang Univ. Sci. A, 7: 234-239.
CrossRefDirect Link - Chung, S.H. and K.L. Choy, 2012. A modified genetic algorithm for quay crane scheduling operations. Expert Syst. Appl., 39: 4213-4221.
CrossRefDirect Link - Exposito-Izquierdo, C., J.L. Gonzalez-Velarde, B. Melian-Batista and J.M. Moreno-Vega, 2013. Hybrid estimation of distribution algorithm for the quay crane scheduling problem. Applied Soft Comput., 13: 4063-4076.
CrossRefDirect Link - Kaveshgar, N., N. Huynh and S.K. Rahimian, 2012. An efficient genetic algorithm for solving the quay crane scheduling problem. Expert Syst. Appl., 39: 13108-13117.
CrossRefDirect Link - Legato, P., R. Trunfio and F. Meisel, 2012. Modeling and solving rich quay crane scheduling problems. Comput. Oper. Res., 39: 2063-2078.
CrossRefDirect Link - Lu, Z.Q., X.L. Han, L.F. Xi and A.L. Erera, 2012. A heuristic for the quay crane scheduling problem based on contiguous bay crane operations. Comput. Oper. Res., 39: 2915-2928.
CrossRefDirect Link - Tavakkoli-Moghaddam, R. A. Makui, S. Salahi, M. Bazzazi and F. Taheri, 2009. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Comput. Ind. Eng., 56: 241-248.
CrossRefDirect Link - Nguyen, S., M. Zhang, M. Johnston and K.C. Tan, 2013. Hybrid evolutionary computation methods for quay crane scheduling problems. Comput. Oper. Res., 40: 2083-2093.
CrossRefDirect Link - Sammarra, M., J.F. Cordeau, G. Laporte and M.F. Monaco, 2007. A tabu search heuristic for the quay crane scheduling problem. J. Scheduling, 10: 327-336.
CrossRefDirect Link - Unsal, O. and C. Oguz, 2013. Constraint programming approach to quay crane scheduling problem. Transp. Res. Part E: Logistics Transp. Rev., 59: 108-122.
CrossRefDirect Link - Wang, S. and W.B. Hu, 2009. Multi quay crane scheduling problem based on ACO in container terminals. Proceedings of the International Conference Management and Service Science, September 20-22, 2009, Wuhan, China, pp: 1-4.
CrossRef - Zhang, C.R., L. Zheng, Z.H. Zhang, L.Y. Shi and A.J. Armstrong, 2010. The allocation of berths and quay cranes by using a sub-gradient optimization technique. Comput. Ind. Eng., 58: 40-50.
CrossRefDirect Link - Zhang, H.P. and K.H. Kim, 2009. Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput. Ind. Eng., 56: 979-992.
Direct Link