A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals

Transportation Research Part E: Logistics and Transportation Review

Volumn 48, Issue 1, 2012, Pages 266-275

  Chen, Jiang Hang ^a   Lee, Der Horng ^a   Cao, Jin Xin ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INNER MONGOLIA UNIVERSITY   (China)

Author keywords

Combinatorial benders' cuts; Container terminal; Quayside operation problem

Indexed keywords

COMPUTATIONAL EFFICIENCY; CONTAINERS; PORT TERMINALS; RAILROAD YARDS AND TERMINALS;

BRANCH-AND-CUT ALGORITHMS; COMBINATORIAL BENDER' CUT; COMPUTATIONAL EXPERIMENT; CONTAINER TERMINAL; INTEGRATED MODELING; LEVEL MODEL; MANAGEMENT SYSTEMS; OPERATION PROBLEM; QUAYSIDE OPERATION PROBLEM;

INTEGER PROGRAMMING;

ALGORITHM; CONTAINER TERMINAL; EXPERIMENTAL STUDY; MANAGEMENT; NUMERICAL MODEL;

EID: 80054120246     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2011.06.004     Document Type: Article

References (11)

1. Bierwirth C., Meisel F. A fast heuristic for quay crane scheduling with interference. Journal of Scheduling 2009, 12(4):345-360.
2. Bierwirth C., Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 2010, 202(3):615-627.
3. Cao J.X., Lee D.H., Chen J.H., Shi Q.X. The integrated yard truck and yard crane scheduling problem: Blenders' decomposition-based methods. Transportation Research Part E 2010, 46(3):344-353.
4. Codato G., Fischetti M. Combinatorial benders' cuts for mixed-integer linear programming. Operations Research 2006, 54(4):756-766.
5. Hooker J. Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction 2000, Wiley-Interscience.
6. Imai A., Chen H., Nishimura E., Papadimitriou S. The simultaneous berth and quay crane allocation problem. Transportation Research Part E 2008, 44(5):900-920.
7. Lee D.H., Chen J.H. An improved approach for quay crane scheduling with non-crossing constraints. Engineering Optimization 2010, 42(1):1-15.
8. Lee D.H., Chen J.H., Cao J.X. The continuous berth allocation problem: a greedy randomized adaptive search solution. Transportation Research Part E 2010, 46:1017-1029.
9. Liu J., Wan Y., Wang L. Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Research Logistics 2006, 53(1):60-74.
10. Meisel F., Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E 2009, 45(1):196-209.
11. Park Y., Kim K. A scheduling method for berth and quay cranes. OR Spectrum 2003, 25(1):1-23.