메뉴 건너뛰기




Volumn , Issue 2168, 2010, Pages 1-8

Discrete berth-scheduling problem : Toward a unified mathematical formulation

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL OPERATORS; PORT TERMINALS; RAILROAD YARDS AND TERMINALS;

EID: 78651269776     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2168-01     Document Type: Article
Times cited : (8)

References (38)
  • 1
    • 33644513123 scopus 로고    scopus 로고
    • The time factor in liner services
    • Notteboom, T. E. The Time Factor in Liner Services. Maritime Economics and Logistics, Vol. 8, No. 1, 2006, pp. 19-39.
    • (2006) Maritime Economics and Logistics , vol.8 , Issue.1 , pp. 19-39
    • Notteboom, T.E.1
  • 2
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research: A classification and literature review
    • Steenken, D., S. Voss, and R. Stahlbock. Container Terminal Operation and Operations Research: A Classification and Literature Review. OR Spectrum, Vol. 26, 2004, pp. 3-49.
    • (2004) OR Spectrum , vol.26 , pp. 3-49
    • Steenken, D.1    Voss, S.2    Stahlbock, R.3
  • 3
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • Bierwirth, C., and F. Meisel. A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals. European Journal of Operational Research. Vol. 202, No. 3, 2010, pp. 615-627.
    • (2010) European Journal of Operational Research , vol.202 , Issue.3 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 4
    • 0000952917 scopus 로고
    • Berth planning by evaluation of congestion and cost
    • Nikolaou, N. S. Berth Planning by Evaluation of Congestion and Cost. Journal of Waterways and Harbors Division, Vol. 93, 1967, pp. 107-132.
    • (1967) Journal of Waterways and Harbors Division , vol.93 , pp. 107-132
    • Nikolaou, N.S.1
  • 5
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • Stahlbock, R., and S. Voss. Operations Research at Container Terminals: A Literature Update. OR Spectrum, Vol. 30, 2008, pp. 1-52.
    • (2008) OR Spectrum , vol.30 , pp. 1-52
    • Stahlbock, R.1    Voss, S.2
  • 6
    • 70450228034 scopus 로고    scopus 로고
    • Container terminal berth planning: Critical review of research approaches and practical challenges
    • Transportation Research Board of the National Academies, Washington, D.C.
    • Theofanis, S., M. Boile, and M. M. Golias. Container Terminal Berth Planning: Critical Review of Research Approaches and Practical Challenges. In Transportation Research Record: Journal of the Transportation Research Board, No. 2100, Transportation Research Board of the National Academies, Washington, D.C., 2009, pp. 22-28.
    • (2009) Transportation Research Record: Journal of the Transportation Research Board No. 2100 , pp. 22-28
    • Theofanis, S.1    Boile, M.2    Golias, M.M.3
  • 7
    • 0035899774 scopus 로고    scopus 로고
    • Berth planning and resources optimization at a container terminal via discrete event simulation
    • Legato, P., and R. Mazza. Berth Planning and Resources Optimization at a Container Terminal via Discrete Event Simulation. European Journal of Operational Research, Vol. 133, No. 3, 2001.
    • (2001) European Journal of Operational Research , vol.133 , Issue.3
    • Legato, P.1    Mazza, R.2
  • 8
    • 33746503666 scopus 로고    scopus 로고
    • Ship-berth link performance evaluation: Simulation and analytical approaches
    • Dragović, B., N.-K. Park, and Z. Radmilović. Ship-Berth Link Performance Evaluation: Simulation and Analytical Approaches. Maritime Policy and Management, Vol. 33, No. 3, 2006, pp. 281-299.
    • (2006) Maritime Policy and Management , vol.33 , Issue.3 , pp. 281-299
    • Dragović, B.1    Park, N.-K.2    Radmilović, Z.3
  • 9
    • 36848999324 scopus 로고    scopus 로고
    • A queuing network model for the management of berth crane operations
    • Canonaco, P., P. Legato, R. Mazza, and R. Musmanno. A Queuing Network Model for the Management of Berth Crane Operations. Computers and Operations Research, Vol. 35, No. 8, 2008, pp. 2432-2446.
    • (2008) Computers and Operations Research , vol.35 , Issue.8 , pp. 2432-2446
    • Canonaco, P.1    Legato, P.2    Mazza, R.3    Musmanno, R.4
  • 12
    • 60449112191 scopus 로고    scopus 로고
    • The berth allocation problem: A strong formulation solved by a lagrangean approach
    • Monaco, M. F., and M. Samara. The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach. Transportation Science, Vol. 41, No. 2, 2007, pp. 265-280.
    • (2007) Transportation Science , vol.41 , Issue.2 , pp. 265-280
    • Monaco, M.F.1    Samara, M.2
  • 13
    • 44649179214 scopus 로고    scopus 로고
    • Variable neighborhood search for minimum cost berth allocation
    • Hansen, P., C. Oguz, and N. Mladenovic. Variable Neighborhood Search for Minimum Cost Berth Allocation. European Journal of Operational Research, Vol. 131, No. 3, 2008, pp. 636-649.
    • (2008) European Journal of Operational Research , vol.131 , Issue.3 , pp. 636-649
    • Hansen, P.1    Oguz, C.2    Mladenovic, N.3
  • 14
    • 69249230791 scopus 로고    scopus 로고
    • Berth scheduling by customer service differentiation: A multi-objective approach
    • Golias, M. M., M. Boile, and S. Theofanis. Berth Scheduling by Customer Service Differentiation: A Multi-Objective Approach. Transportation Research Part E, Vol. 45, No. 6, 2009, pp. 878-892.
    • (2009) Transportation Research Part e , vol.45 , Issue.6 , pp. 878-892
    • Golias, M.M.1    Boile, M.2    Theofanis, S.3
  • 15
    • 0038743113 scopus 로고    scopus 로고
    • Berth scheduling by simulated annealing
    • Kim, K. H., and K. C. Moon. Berth Scheduling by Simulated Annealing. Transportation Research Part B, Vol. 37, 2003, pp. 541-560.
    • (2003) Transportation Research Part B , vol.37 , pp. 541-560
    • Kim, K.H.1    Moon, K.C.2
  • 16
    • 17444376768 scopus 로고    scopus 로고
    • The berth allocation problem: Models and solution methods
    • Guan, Y., and R. K. Cheung. The Berth Allocation Problem: Models and Solution Methods. OR Spectrum, Vol. 26, 2004, pp. 75-92.
    • (2004) OR Spectrum , vol.26 , pp. 75-92
    • Guan, Y.1    Cheung, R.K.2
  • 17
    • 11244335846 scopus 로고    scopus 로고
    • Berth allocation in a container port: Using continuous location space approach
    • Imai, A., X. Sun, E. Nishimura, and S. Papadimitriou. Berth Allocation in a Container Port: Using Continuous Location Space Approach. Transportation Research Part B, Vol. 39, 2005, pp. 199-221.
    • (2005) Transportation Research Part B , vol.39 , pp. 199-221
    • Imai, A.1    Sun, X.2    Nishimura, E.3    Papadimitriou, S.4
  • 18
    • 33748672706 scopus 로고    scopus 로고
    • Berth management in container terminal: The template design problem
    • Moorthy, R., and C.-P. Teo. Berth Management in Container Terminal: The Template Design Problem. OR Spectrum, Vol. 28, No. 4, 2006, pp. 495-518.
    • (2006) OR Spectrum , vol.28 , Issue.4 , pp. 495-518
    • Moorthy, R.1    Teo, C.-P.2
  • 19
    • 1342290320 scopus 로고    scopus 로고
    • Scheduling method for berth and quay cranes
    • Park, M. Y., and H. K. A. Kim. Scheduling Method for Berth and Quay Cranes. OR Spectrum, Vol. 25, 2003, pp. 1-23.
    • (2003) OR Spectrum , vol.25 , pp. 1-23
    • Park, M.Y.1    Kim, H.K.A.2
  • 20
    • 57149135986 scopus 로고    scopus 로고
    • Heuristics for the integration of crane productivity in the berth allocation problem
    • Meisel, F., and C. Bierwirth. Heuristics for the Integration of Crane Productivity in the Berth Allocation Problem. Transportation Research Part E, Vol. 45, 2009, pp. 196-209.
    • (2009) Transportation Research Part e , vol.45 , pp. 196-209
    • Meisel, F.1    Bierwirth, C.2
  • 21
    • 78651286825 scopus 로고    scopus 로고
    • A Bi-level formulation for the berth scheduling problem with variable vessel release dates to reduce port emissions
    • Inha University, Incheon, South Korea
    • Golias, M. M., S. Theofanis, and M. Boile. A Bi-Level Formulation for the Berth Scheduling Problem with Variable Vessel Release Dates to Reduce Port Emissions. Proc., International Conference on Shipping, Port, Logistics Management, Inha University, Incheon, South Korea, 2009.
    • (2009) Proc., International Conference on Shipping, Port, Logistics Management
    • Golias, M.M.1    Theofanis, S.2    Boile, M.3
  • 23
    • 85173206524 scopus 로고    scopus 로고
    • Accessed Sept. 19, 2008
    • Fossey, J. In the Bunker. CI-Online. http://www.ci-online.co.uk/. Accessed Sept. 19, 2008.
    • The Bunker
    • Fossey, J.1
  • 25
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • Imai, A., K. Nagaiwa, and C.-W. Tat. Efficient Planning of Berth Allocation for Container Terminals in Asia. Journal of Advanced Transportation, Vol. 31, 1997, pp. 75-94.
    • (1997) Journal of Advanced Transportation , vol.31 , pp. 75-94
    • Imai, A.1    Nagaiwa, K.2    Tat, C.-W.3
  • 26
  • 27
    • 28244441388 scopus 로고    scopus 로고
    • Models and tabu search heuristics for the berth-allocation problem
    • Cordeau, J.-F., G. Laporte, P. Legato, and L. Moccia. Models and Tabu Search Heuristics for the Berth-Allocation Problem. Transportation Science, Vol. 39, 2005, pp. 526-538.
    • (2005) Transportation Science , vol.39 , pp. 526-538
    • Cordeau, J.-F.1    Laporte, G.2    Legato, P.3    Moccia, L.4
  • 32
    • 34948830996 scopus 로고    scopus 로고
    • Berthing ships at a multi- user container terminal with a limited quay capacity
    • Imai, A., E. Nishimura, and S. Papadimitriou. Berthing Ships at a Multi- User Container Terminal with a Limited Quay Capacity. Transportation Research Part E, Vol. 44, No. 1, 2008, pp. 136-151.
    • (2008) Transportation Research Part e , vol.44 , Issue.1 , pp. 136-151
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 33
    • 76149095157 scopus 로고    scopus 로고
    • Adaptive algorithm based on time window partitioning for discrete and dynamic berth-scheduling problem
    • Transportation Research Board of the National Academies, Washington, D.C.
    • Golias, M. M., M. Boile, and S. Theofanis. Adaptive Algorithm Based on Time Window Partitioning for Discrete and Dynamic Berth-Scheduling Problem. In Transportation Research Record: Journal of the Transportation Research Board, No. 2091, Transportation Research Board of the National Academies, Washington, D.C., 2009, pp. 21-30.
    • (2009) Transportation Research Record: Journal of the Transportation Research Board No. 2091 , pp. 21-30
    • Golias, M.M.1    Boile, M.2    Theofanis, S.3
  • 34
    • 44649109639 scopus 로고    scopus 로고
    • A multi-objective multi-colony ant algorithm for solving the berth allocation problem
    • Cheong, C. Y., and K. C. Tan. A Multi-Objective Multi-Colony Ant Algorithm for Solving the Berth Allocation Problem. Studies in Computational Intelligence, Vol. 116, 2008, pp. 333-350.
    • (2008) Studies in Computational Intelligence , vol.116 , pp. 333-350
    • Cheong, C.Y.1    Tan, K.C.2
  • 35
    • 77958474679 scopus 로고    scopus 로고
    • Multi-objective and prioritized berth allocation in container ports
    • DOI 10.1007/s10479-008-0493-0
    • Cheong, C. Y., K. C. Tan, D. K. Liu, and C. J. Lin. Multi-Objective and Prioritized Berth Allocation in Container Ports. Annals of Operations Research. DOI 10.1007/s10479-008-0493-0, 2009.
    • (2009) Annals of Operations Research
    • Cheong, C.Y.1    Tan, K.C.2    Liu, D.K.3    Lin, C.J.4
  • 36
    • 58149231340 scopus 로고    scopus 로고
    • An optimization heuristic for the berth scheduling problem
    • Lee, Y., and Y.-C. Chen. An Optimization Heuristic for the Berth Scheduling Problem. European Journal of Operational Research, Vol. 196, No. 2, 2009, pp. 500-508.
    • (2009) European Journal of Operational Research , vol.196 , Issue.2 , pp. 500-508
    • Lee, Y.1    Chen, Y.-C.2
  • 38
    • 77953360763 scopus 로고    scopus 로고
    • A lamda-optimal based heuristic for the berth scheduling problem
    • Golias, M. M., M. Boile, and S. Theofanis. A Lamda-Optimal Based Heuristic for the Berth Scheduling Problem. Transportation Research Part C, Vol. 8, No. 5, 2010, pp. 794-806.
    • (2010) Transportation Research Part C , vol.8 , Issue.5 , pp. 794-806
    • Golias, M.M.1    Boile, M.2    Theofanis, S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.