메뉴 건너뛰기




Volumn , Issue , 2005, Pages 231-255

Dispatching multi-load AGVs in highly automated seaport container terminals

Author keywords

Container terminals; Dispatching; Multi load AGVs; Online control

Indexed keywords


EID: 84895342330     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-26686-0_10     Document Type: Chapter
Times cited : (16)

References (42)
  • 1
    • 0030166264 scopus 로고    scopus 로고
    • A new subtour elimination constraint for the vehicle routing problem
    • DOI 10.1016/0377-2217(94)00332-7
    • Achuthan N R, Caccetta L, Hill S P (1996) A new subtour elimination constraint for the vehicle routing problem. European Journal of Operational Research 91: 573-586 (Pubitemid 126393168)
    • (1996) European Journal of Operational Research , vol.91 , Issue.3 , pp. 573-586
    • Achuthan, N.R.1    Caccetta, L.2    Hill, S.P.3
  • 2
    • 0036497532 scopus 로고    scopus 로고
    • The periodic vehicle routing problem with intermediate facilities
    • DOI 10.1016/S0377-2217(01)00206-5, PII S0377221701002065
    • Angelelli E, Speranza M G (2002) The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research 137: 233-247 (Pubitemid 33149448)
    • (2002) European Journal of Operational Research , vol.137 , Issue.2 , pp. 233-247
    • Angelelli, E.1    Speranza, M.G.2
  • 3
    • 17444407955 scopus 로고    scopus 로고
    • A pooled dispatching strategy for automated guided vehicles in port container terminals
    • Bae J W, Kim K H (2000) A pooled dispatching strategy for automated guided vehicles in port container terminals. International Journal of Management Science 6: 47-67
    • (2000) International Journal of Management Science , vol.6 , pp. 47-67
    • Bae, J.W.1    Kim, K.H.2
  • 4
    • 0036567019 scopus 로고    scopus 로고
    • A branch-and-cut procedure for the vehicle routing problem with time windows
    • Bard J F, Kontoravdis G, Yu G (2002) A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36: 250-259
    • (2002) Transportation Science , vol.36 , pp. 250-259
    • Bard, J.F.1    Kontoravdis, G.2    Yu, G.3
  • 5
    • 0001073620 scopus 로고    scopus 로고
    • AGV systems with multi-load carriers: Basic issues and potential benefits
    • Bilge U, Tanchoco J M A (1997) AGV Systems with multi-load carriers: basic issues and potential benefits. Journal of Manufacturing Systems 16: 159-174 (Pubitemid 127448830)
    • (1997) Journal of Manufacturing Systems , vol.16 , Issue.3 , pp. 159-174
    • Bilge, U.1    Tanchoco, J.M.A.2
  • 7
    • 0036474954 scopus 로고    scopus 로고
    • Interblock crane deployment in container terminals
    • DOI 10.1287/trsc.36.1.79.568
    • Chung R K, Li C L, Lin W (2002) Interblock crane deployment in container terminals. Transportation Science 36: 79-93 (Pubitemid 34268735)
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 79-93
    • Chung, R.K.1    Li, C.-L.2    Lin, W.3
  • 11
    • 0035381975 scopus 로고    scopus 로고
    • A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
    • Fischetti M, Lodi A, Martello S, Toth P (2001) A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science 47: 833-850 (Pubitemid 34192801)
    • (2001) Management Science , vol.47 , Issue.6 , pp. 833-850
    • Fischetti, M.1    Lodi, A.2    Martello, S.3    Toth, P.4
  • 14
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Management Science 40: 1276-1290
    • (1994) Management Science , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 16
    • 0031146838 scopus 로고    scopus 로고
    • An adaptive memory heuristic for a class of vehicle routing problems with minimax objective
    • Golden B L, Laporte G, Taillard E D (1997) An adaptive memory heuristic for a class of vehicle routing problems with minimax objective. Computers Operations Research 24: 445-452
    • (1997) Computers Operations Research , vol.24 , pp. 445-452
    • Golden, B.L.1    Laporte, G.2    Taillard, E.D.3
  • 17
    • 0002884067 scopus 로고
    • A new extension of local search applied to the Dial-A-Ride problem
    • Healy P, Moll R (1995)A new extension of local search applied to the Dial-A-Ride problem. European Journal of Operational Research 83: 83-104
    • (1995) European Journal of Operational Research , vol.83 , pp. 83-104
    • Healy, P.1    Moll, R.2
  • 18
    • 0037061435 scopus 로고    scopus 로고
    • An improved model for vehicle routing problem with time constraint based on genetic algorithm
    • DOI 10.1016/S0360-8352(02)00033-5, PII S0360835202000335
    • Hwang H (2002)An improved model for vehicle routing problem with time constraint based on genetic algorithm. Computers and Industrial Engineering 42: 361-369 (Pubitemid 34410763)
    • (2002) Computers and Industrial Engineering , vol.42 , Issue.2-4 , pp. 361-369
    • Hwang, H.-S.1
  • 19
    • 0031653508 scopus 로고    scopus 로고
    • Development of dispatching rules for automated guided vehicle systems
    • Hwang H, Kim S H (1998) Development of dispatching rules for automated guided vehicle systems. Journal of Manufacturing Systems 17: 137-143 (Pubitemid 128447052)
    • (1998) Journal of Manufacturing Systems , vol.17 , Issue.2 , pp. 137-143
    • Hwang, H.1    Kim, S.H.2
  • 20
    • 0022851257 scopus 로고
    • A heuristic algorithm for the multi-vehicle advance request dial-A-ride problem with time windows
    • Jaw J J, Odoni A R, Psaraftis H N, Wilson N H M (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research B 20: 243-257
    • (1986) Transportation Research B , vol.20 , pp. 243-257
    • Jaw, J.J.1    Odoni, A.R.2    Psaraftis, H.N.3    Wilson, N.H.M.4
  • 21
    • 0002767793 scopus 로고    scopus 로고
    • An optimal routing algorithm for a transfer crane in port container terminals
    • Kim K H, Kim KY (1999)An optimal routing algorithm for a transfer crane in port container terminals. Transportation Science 33: 17-33 (Pubitemid 129723021)
    • (1999) Transportation Science , vol.33 , Issue.1 , pp. 17-33
    • Kim, K.H.1
  • 23
    • 0000276553 scopus 로고    scopus 로고
    • 2-path cuts for the vehicle routing problem with time windows
    • Kohl N, Desrosiers J, Madsen O G B, Solomon M M, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33: 101-116 (Pubitemid 129723026)
    • (1999) Transportation Science , vol.33 , Issue.1 , pp. 101-116
    • Kohl, N.1
  • 24
    • 0022678438 scopus 로고
    • Exact algorithm for the asymmetrical capacitated vehicle routing problem
    • Laporte G, Mercure H, NorbertY(1986)An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16: 33-46 (Pubitemid 16488198)
    • (1986) Networks , vol.16 , Issue.1 , pp. 33-46
    • Laporte, G.1    Mercure, H.2    Nobert, Y.3
  • 25
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 59: 345-358
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 28
    • 0030398243 scopus 로고    scopus 로고
    • Load selection of automated guided vehicles in flexible manufacturing systems
    • Lee J, Tangjarukij M, Zhu Z (1996) Load selection of automated guided vehicles in flexible manufacturing systems. International Journal of Production Research 34: 3383-3400 (Pubitemid 126530376)
    • (1996) International Journal of Production Research , vol.34 , Issue.12 , pp. 3383-3400
    • Lee, J.1    Tangjarukij, M.2    Zhu, Z.3
  • 29
    • 1342311557 scopus 로고    scopus 로고
    • A dispatching method for automated guided vehicles by using a bidding concept
    • Lim J K, Kim K H, Yoshimoto K, Lee, J H, Takahashi T (2003) A dispatching method for automated guided vehicles by using a bidding concept. OR Spectrum 25: 25-44 (Pubitemid 38260022)
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 25-44
    • Lim, J.K.1    Kim, K.H.2    Yoshimoto, K.3    Lee, J.H.4    Takahashi, T.5
  • 30
    • 0033338780 scopus 로고    scopus 로고
    • Exact method for the vehicle routing problem with backhauls
    • Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transportation Science 33: 315-329 (Pubitemid 30507676)
    • (1999) Transportation Science , vol.33 , Issue.3 , pp. 315-329
    • Mingozzi, A.1    Giorgi, S.2    Baldacci, R.3
  • 31
    • 0342948598 scopus 로고    scopus 로고
    • Solving the pickup and delivery problem with time windows using reactive tabu search
    • DOI 10.1016/S0191-2615(99)00016-8, PII S0191261599000168
    • NanryWP, Barnes JW(2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research B 34: 107-121 (Pubitemid 30135209)
    • (2000) Transportation Research Part B: Methodological , vol.34 , Issue.2 , pp. 107-121
    • Nanry, W.P.1    Wesley Barnes, J.2
  • 32
    • 0000779543 scopus 로고
    • Operational control of multi-load vehicles in an automated guided vehicle system
    • Nayyar P, Khator S K (1993) Operational control of multi-load vehicles in an automated guided vehicle system. Computers and Industrial Engineering 24: 503-506
    • (1993) Computers and Industrial Engineering , vol.24 , pp. 503-506
    • Nayyar, P.1    Khator, S.K.2
  • 33
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for Berth and Quay cranes
    • ParkY-M, Kim, K H (2003) A scheduling method for berth and quay cranes. OR Spectrum 25: 1-23 (Pubitemid 38260021)
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 1-23
    • Park, Y.-M.1    Kim, K.H.2
  • 34
    • 0019016763 scopus 로고
    • A dynamic programming solution to the single vehicle many-to-many immediate request dial-A-ride problem
    • Psaraftis H N (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14: 130-154
    • (1980) Transportation Science , vol.14 , pp. 130-154
    • Psaraftis, H.N.1
  • 36
    • 0002600091 scopus 로고
    • The general pickup and delivery problem
    • Savelsbergh M, Sol M (1995) The general pickup and delivery problem. Transportation Science 29: 17-29
    • (1995) Transportation Science , vol.29 , pp. 17-29
    • Savelsbergh, M.1    Sol, M.2
  • 38
    • 0037139676 scopus 로고    scopus 로고
    • A dynamic scheduling algorithm for a multiple-load multiple-carrier system
    • DOI 10.1080/00207540110105662
    • Sinriech D, Kotlarski J (2002)A dynamic scheduling algorithm for a multiple load multiple carrier system. International Journal of Production Research 40: 1065-1080 (Pubitemid 34593787)
    • (2002) International Journal of Production Research , vol.40 , Issue.5 , pp. 1065-1080
    • Sinriech, D.1    Kotlarski, J.2
  • 39
    • 0001080956 scopus 로고
    • Improvement heuristics for the vehicle routing problem based on simulated annealing
    • Van Breedam A (1995) Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operational Research 86: 480-490
    • (1995) European Journal of Operational Research , vol.86 , pp. 480-490
    • Van Breedam, A.1
  • 40
    • 0036497536 scopus 로고    scopus 로고
    • A parametric analysis of heuristics for the vehicle routing problem with side-constraints
    • DOI 10.1016/S0377-2217(01)00150-3, PII S0377221701001503
    • Van Breedam A (2002) A parametric analysis of heuristics for the vehicle routing problem with side-constraints. European Journal of Operational Research 137: 348-370 (Pubitemid 33149456)
    • (2002) European Journal of Operational Research , vol.137 , Issue.2 , pp. 348-370
    • Van Breedam, A.1
  • 41
    • 0011055432 scopus 로고    scopus 로고
    • Scheduling vehicles in automated transportation systems-algorithms and case study
    • Van der Heijden M, Ebben M, Gademan N, van Harten A (2002) Scheduling vehicles in automated transportation systems-algorithms and case study. OR Spectrum 24: 31-58
    • (2002) OR Spectrum , vol.24 , pp. 31-58
    • Van Der Heijden, M.1    Ebben, M.2    Gademan, N.3    Van Harten, A.4
  • 42
    • 0035836310 scopus 로고    scopus 로고
    • Application of AI to AGV control - Agent control of AGVs
    • DOI 10.1080/00207540010007310
    • Wallace A (2001) Application of AI to AGV control-agent control of AGVs. International Journal of Production Research 39: 709-726 (Pubitemid 35165662)
    • (2001) International Journal of Production Research , vol.39 , Issue.4 , pp. 709-726
    • Wallace, A.1


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