메뉴 건너뛰기




Volumn , Issue , 2009, Pages 95-102

Solving the berth allocation problem with service priority via multi-objective optimization

Author keywords

[No Author keywords available]

Indexed keywords

BERTH ALLOCATION PROBLEM; CONTAINER PORTS; MAKESPAN; MULTI OBJECTIVE; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; MULTIOBJECTIVE APPROACH; PARETO-OPTIMALITY; SERVICE PRIORITY; SHIP OPERATORS; WAITING-TIME;

EID: 67650501153     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCIS.2009.4927021     Document Type: Conference Paper
Times cited : (12)

References (11)
  • 1
    • 0035324677 scopus 로고    scopus 로고
    • The dynamic berth allocation problem for a container port
    • DOI 10.1016/S0191-2615(99)00057-0, PII S0191261599000570
    • A. Imai, E. Nishimura, and S. Papadimitriou, "The dynamic berth allocation problem for a container port", Transportation Research Part B: Methodological, vol. 35, no. 4, pp. 401 - 417, 2001. (Pubitemid 32223143)
    • (2001) Transportation Research Part B: Methodological , vol.35 , Issue.4 , pp. 401-417
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 3
    • 11244335846 scopus 로고    scopus 로고
    • Berth allocation in a container port: Using a continuous location space approach
    • DOI 10.1016/j.trb.2004.04.004, PII S0191261504000505
    • A. Imai, X. Sun, E. Nishimura, and S. Papadimitriou, "Berth allocation in a container port: using a continuous location space approach", Transportation Research Part B: Methodological, vol. 39, no. 3, pp. 199 - 221, 2005. (Pubitemid 40058678)
    • (2005) Transportation Research Part B: Methodological , vol.39 , Issue.3 , pp. 199-221
    • Imai, A.1    Sun, X.2    Nishimura, E.3    Papadimitriou, S.4
  • 4
    • 33751395932 scopus 로고    scopus 로고
    • Berth allocation at indented berths for mega-containerships
    • DOI 10.1016/j.ejor.2006.03.034, PII S0377221706001913
    • A. Imai, E. Nishimura, M. Hattori, and S. Papadimitriou, "Berth allocation at indented berths for mega-containerships", European Journal of Operational Research, vol. 179, no. 2, pp. 579 - 593, 2007. (Pubitemid 44821619)
    • (2007) European Journal of Operational Research , vol.179 , Issue.2 , pp. 579-593
    • Imai, A.1    Nishimura, E.2    Hattori, M.3    Papadimitriou, S.4
  • 5
    • 0038743113 scopus 로고    scopus 로고
    • Berth scheduling by simulated annealing
    • DOI 10.1016/S0191-2615(02)00027-9
    • K. H. Kim and K. C. Moon, "Berth scheduling by simulated annealing", Transportation Research Part B: Methodological, vol. 37, no. 6, pp. 541 - 560, 2003. (Pubitemid 36580172)
    • (2003) Transportation Research Part B: Methodological , vol.37 , Issue.6 , pp. 541-560
    • Kim, K.H.1    Moon, K.C.2
  • 6
    • 0036794414 scopus 로고    scopus 로고
    • A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
    • DOI 10.1016/S0167-6377(02)00147-5, PII S0167637702001475
    • Y. Guan, W.-Q. Xiao, R. K. Cheung, and C.-L. Li, "A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis", Operations Research Letters, vol. 30, pp. 343 - 350, 2002. (Pubitemid 35167682)
    • (2002) Operations Research Letters , vol.30 , Issue.5 , pp. 343-350
    • Guan, Y.1    Xiao, W.-Q.2    Cheung, R.K.3    Li, C.-L.4
  • 7
    • 0032072364 scopus 로고    scopus 로고
    • Scheduling with multiple-job-onone- processor pattern
    • C.-L. Li, X. Cai, and C.-Y. Lee, "Scheduling with multiple-job-onone- processor pattern", IIE Transactions, vol. 30, pp. 433 - 445, 1998.
    • (1998) IIE Transactions , vol.30 , pp. 433-445
    • Li, C.-L.1    Cai, X.2    Lee, C.-Y.3
  • 8
    • 0031096047 scopus 로고    scopus 로고
    • Efficient planning of berth allocation for container terminals in Asia
    • A. Imai, K. Nagaiwa, and W. T. Chan, "Efficient planning of berth allocation for container terminals in Asia", Journal of Advanced Transportation, vol. 31, pp. 75 - 94, 1997. (Pubitemid 127603112)
    • (1997) Journal of Advanced Transportation , vol.31 , Issue.1 , pp. 75-94
    • Imai, A.1    Nagaiwa, K.2    Tat, C.W.3
  • 9
    • 34548804847 scopus 로고    scopus 로고
    • Solving the exam timetabling problem via a multi-objective evolutionary algorithm - A more general approach
    • DOI 10.1109/SCIS.2007.367685, 4218612, Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007
    • C. Y. Cheong, K. C. Tan, and B. Veeravalli, "Solving the exam timetabling problem via a multi-objective evolutionary algorithm - a more general approach", in Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007, Honolulu, HI, USA, pp. 165 - 172, 2007. (Pubitemid 47431197)
    • (2007) Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 , pp. 165-172
    • Cheong, C.Y.1    Tan, K.C.2    Veeravalli, B.3
  • 10
    • 0035372166 scopus 로고    scopus 로고
    • Berth allocation planning in the public berth system by genetic algorithms
    • DOI 10.1016/S0377-2217(00)00128-4, PII S0377221700001284
    • E. Nishimura, A. Imai, and S. Papadimitriou, "Berth allocation planning in the public berth system by genetic algorithms", European Journal of Operational Research, vol. 131, no. 2, pp. 282 - 292, 2001. (Pubitemid 32271744)
    • (2001) European Journal of Operational Research , vol.131 , Issue.2 , pp. 282-292
    • Nishimura, E.1    Imai, A.2    Papadimitriou, S.3
  • 11
    • 0004038917 scopus 로고
    • Multiobjective genetic algorithms with application to control engineering problems
    • University of Sheffield, Sheffield, UK, Ph.D. Thesis
    • C. M. Fonseca, "Multiobjective genetic algorithms with application to control engineering problems", Dept. Automatic Control and Systems Eng., University of Sheffield, Sheffield, UK, Ph.D. Thesis, 1995.
    • (1995) Dept. Automatic Control and Systems Eng.
    • Fonseca, C.M.1


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