메뉴 건너뛰기




Volumn , Issue , 2010, Pages 2210-2215

A feedback procedure for robust berth allocation with stochastic vessel delays

Author keywords

Berth allocation problem; Feedback; Robust optimization; Stochastic vessel delay; Time buffer

Indexed keywords

BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; FREQUENCY DISTRIBUTIONS; PLANNING STAGES; ROBUST OPTIMIZATION; SCHEDULE CHANGES; STOCHASTIC VESSEL DELAY; TIME BUFFERS;

EID: 77958135389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCICA.2010.5554316     Document Type: Conference Paper
Times cited : (27)

References (16)
  • 1
    • 0038743113 scopus 로고    scopus 로고
    • Berth scheduling by simulated annealing
    • July
    • K. H. Kim and K. C. Moon, "Berth scheduling by simulated annealing," Transport. Res. B-Meth., vol. 37, no. 6, pp. 541-560, July 2003.
    • (2003) Transport. Res. B-Meth , vol.37 , Issue.6 , pp. 541-560
    • Kim, K.H.1    Moon, K.C.2
  • 2
    • 84977280735 scopus 로고
    • A study of container berth allocation
    • K. K. Lai and K. Shih, "A study of container berth allocation," J. Adv. Transport., vol. 26, no. 26, pp. 45-60, 1992.
    • (1992) J. Adv. Transport , vol.26 , Issue.26 , pp. 45-60
    • Lai, K.K.1    Shih, K.2
  • 4
    • 0035324677 scopus 로고    scopus 로고
    • The dynamic berth allocation problem for a container port
    • May
    • A. Imai, E. Nishimura, and S. Papadimitriou, "The dynamic berth allocation problem for a container port," Transport. Res. B-Meth., vol. 35, no. 4, pp. 401-417, May 2001.
    • (2001) Transport. Res. B-Meth. , vol.35 , Issue.4 , pp. 401-417
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 5
    • 33751395932 scopus 로고    scopus 로고
    • Berth allocation at indented berths for mega-containerships
    • A. Imai, E. Nishimura, M. Hattori, and S. Papadimitriou, "Berth allocation at indented berths for mega-containerships," Eur. J. Oper. Res., vol. 179, no. 2, pp. 579-593, 2007.
    • (2007) Eur. J. Oper. Res. , vol.179 , Issue.2 , pp. 579-593
    • Imai, A.1    Nishimura, E.2    Hattori, M.3    Papadimitriou, S.4
  • 6
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • Mar.
    • A. Lim, "The berth planning problem," Oper. Res. Lett, vol. 22, no. 2-3, pp. 105-110, Mar. 1998.
    • (1998) Oper. Res. Lett , vol.22 , Issue.2-3 , pp. 105-110
    • Lim, A.1
  • 7
    • 0032072364 scopus 로고    scopus 로고
    • Scheduling with multiple-job-on-one-processor pattern
    • May
    • C. L. Li, X. Cai, and C. Y. Lee, "Scheduling with multiple-job-on-one-processor pattern," IIE Trans. Schd. Log., vol. 30, no. 5, pp. 433-445, May 1998.
    • (1998) IIE Trans. Schd. Log. , vol.30 , Issue.5 , pp. 433-445
    • Li, C.L.1    Cai, X.2    Lee, C.Y.3
  • 8
    • 0036724291 scopus 로고    scopus 로고
    • Berth scheduling for container terminals by using a sub-gradient optimization technique
    • Sep.
    • K. T. Park and K. H. Kim, "Berth scheduling for container terminals by using a sub-gradient optimization technique," J. Oper. Res. Soc., vol. 53, no. 9, pp. 1054-1062, Sep. 2002.
    • (2002) J. Oper. Res. Soc. , vol.53 , Issue.9 , pp. 1054-1062
    • Park, K.T.1    Kim, K.H.2
  • 9
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for berth and quay cranes
    • Feb.
    • Y. M. Park and K. H. Kim, "A scheduling method for berth and quay cranes," OR Spectrum, vol. 25, no. 1, pp. 1-23, Feb. 2003.
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 1-23
    • Park, Y.M.1    Kim, K.H.2
  • 10
    • 33845684733 scopus 로고    scopus 로고
    • A stochastic beam search for the berth allocation problem
    • Jan.
    • F. Wang and A. Lim, "A stochastic beam search for the berth allocation problem," Decis. Support Syst., vol. 42, no. 4, pp. 2186-2196, Jan. 2007.
    • (2007) Decis. Support Syst. , vol.42 , Issue.4 , pp. 2186-2196
    • Wang, F.1    Lim, A.2
  • 11
    • 11244335846 scopus 로고    scopus 로고
    • Berth allocation in a container port: Using a continuous location space approach
    • Mar.
    • A. Imai, X. Sun, E. Nishimura, and S. Papadimitriou, "Berth allocation in a container port: Using a continuous location space approach," Transport. Res. B-Meth., vol. 39, no. 3, pp. 199-221, Mar. 2005.
    • (2005) Transport. Res. B-Meth. , vol.39 , Issue.3 , pp. 199-221
    • Imai, A.1    Sun, X.2    Nishimura, E.3    Papadimitriou, S.4
  • 12
    • 28244441388 scopus 로고    scopus 로고
    • Models and tabu search heuristics for the berth-allocation problem
    • Apr.
    • J. F. Cordeau, G. Laporte, P. Legato, and L. Moccia, "Models and tabu search heuristics for the berth-allocation problem," Transport. Sci., vol. 39, no. 4, pp. 526-538, Apr. 2005.
    • (2005) Transport. Sci. , vol.39 , Issue.4 , pp. 526-538
    • Cordeau, J.F.1    Laporte, G.2    Legato, P.3    Moccia, L.4
  • 13
    • 33748672706 scopus 로고    scopus 로고
    • Berth management in container terminal: The template design problem
    • Oct.
    • R. Moorthy and C. P. Teo, "Berth management in container terminal: the template design problem," OR Spectrum, vol. 28, no. 4, pp. 495-518, Oct. 2006.
    • (2006) OR Spectrum , vol.28 , Issue.4 , pp. 495-518
    • Moorthy, R.1    Teo, C.P.2
  • 14
    • 33846657372 scopus 로고    scopus 로고
    • A heuristic approach for airport gate assignments for stochastic flight delays
    • July
    • S. Yan and C. H. Tang, "A heuristic approach for airport gate assignments for stochastic flight delays," Eur. J. Oper. Res., vol. 180, no. 2, pp. 547-567, July 2007.
    • (2007) Eur. J. Oper. Res. , vol.180 , Issue.2 , pp. 547-567
    • Yan, S.1    Tang, C.H.2
  • 16
    • 40849142093 scopus 로고    scopus 로고
    • Proactive heuristic procedures for robust project scheduling: An experimental analysis
    • Sep.
    • S. V. de Vonder, E. Demeulemeester, and W. Herroelen, "Proactive heuristic procedures for robust project scheduling: An experimental analysis," Eur. J. Oper. Res., vol. 189, no. 3, pp. 723-733, Sep. 2008.
    • (2008) Eur. J. Oper. Res. , vol.189 , Issue.3 , pp. 723-733
    • De Vonder, S.V.1    Demeulemeester, E.2    Herroelen, W.3


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