본문 바로가기
KERD
논문KCI 등재

제3자 물류를 위한 수리모형 분석

Mathematical Modeling Issues for third-Party Logistics Providers

1

조회

0

다운로드

2

인용

0

참고문헌

키워드

주제분류경영학

초록

기업의 국제경쟁이 격심해짐에 따라 공급사슬에 있는 모든 기업간의 협력관계가 더욱 중요해지고 있다. 특히, 제품을 생산자로부터 고객에게 전달하는 과정을 지원하는 제3자 물류기업(third party logistics providers)이 등장하였는데, 동 기업은 보유한 전문장비와 정보시스템을 활용하여 고객의 제품운송과 보관 업무를 지원하는 역할을 수행한다. 이에 기업은 고객이 원하는 시간과 장소에 안전하고 효율적으로 제품을 공급할 수 있게 되었다. 이러한 제3자 물류기업은 기업과 일반인을 대상으로 다양한 서비스를 제공하는데, 계약기간 다양하다는 서비스의 특징이 있다. 제3자 물류기업의 네트워크는 제품이나 서비스를 특정 기업으로부터 소비자들에게 전달하는 순방향물류(forward logistics)와 소비자들로부터 제품을 수거하여 특정기업으로 되돌려 주는 역 물류(reverse logistics), 그리고 이를 결합한 통합물류(integrated logistics)를 포함한다. 이와 같은 제3자 물류기업은 동적인 기업 환경 하에서 공급사슬의 통합을 효율적으로 지원하기 위한 다양한 의사결정 상황에 직면하고 있다. 따라서 본 연구는 제3자 물류기업이 직면하는 이와 같은 주요 의사결정 문제를 장기, 중기, 그리고 단기적 측면에서 분석하였다.

Abstract

The competitive business environment of today has resulted in increasing cooperation among individual companies as members of a supply chain. Accordingly, third party logistics providers(3PLs) must operate supply chains for a number of different clients who want to improve their logistics operations for both forward and reverse flows. As these 3PLs are playing an increasing role in the management of supply chains, this paper addresses the key decisions associated with this management. The decisions can be divided into three categories: strategic, tactical, and operational decisions. The strategic level of decisions involves the design of a distribution network for supporting various clients. Such networks may involve forward logistics as well as reverse logistics. The tactical level of decisions involves the assignment of clients to appropriate facilities and the design of those facilities which involve issues selected to layout design, slotting, and information technology. The operational level of decisions is concerned with daily operations such as batching, picking, and delivery in order to meet clients’ requirements. This paper reviews the existing studies relevant to strategic, tactical, and operational levels.

참고문헌 (111)

  1. Andel T, "Avoid messes from reverse flow" (1999)
  2. Anonymous, "Is third party logistics in your future?" (2000)
  3. Armour GC, "A heuristic algorithm and simulation approach to relative allocation of facili- ties", 9, pp.294~309 (1963)
  4. Armstrong RD, "Optimal batching in a semi-automated order picking system Journal of the Operational Research Society 30", pp.711~720 (1979)
  5. Jacobs FR, "Solutions for the constrained dynamic facility layout problem European Journal of Opera- tional Research 57", pp.280~286 (1992)
  6. Ballou RH, "Dynamic warehouse location analysis", 5, pp.271~276 (1968)
  7. Banerjee PB, "A modeling of interactive facilities layout designer reasoning using qualitative patterns International Journal of Production Research 30", pp.433~453 (1992)
  8. Barros AI, "A two-level network for recycling sand: a case study", 110, pp.199~214 (1998)
  9. Benjaafar S, "Design of flexible plant layouts", 34(4), pp.309~322 (2000)
  10. Bozer YA, "An improvement-type layout algorithm for single and multiple floor facilities", pp.918~932 (1994)
  11. Bramel J, "On the effectiveness of set covering formu- lations for the vehicle routing problem with time windows", 45, pp.295~301 (1997)
  12. Bucklin LP, "Postponement", journal of marketing re- search 2(1), pp.26~31 (1965)
  13. Canel C, "An algorithm for the capacitated, multi-commodity multi-period facility location problem", 28, pp.411~427 (2001)
  14. Caruso C, "European Journal of Operational Re- search 70", pp.16~30 (1993)
  15. Chiang W, "Simulated annealing methaheuristics for the vehicle routing problem with time win- dows", 63, pp.3~27 (1996)
  16. Chiang WC, "A reactive tabu svearch metaheuristic for the vehicle routing problem with time windows", 9(4), pp.417~430 (1997)
  17. Clarke G, "Scheduling of vehicles from a central depot to a number of delivery points", 12, pp.568~581 (1964)
  18. Conway DG, "Genetic search and the dynamic facility layout problem", 21, pp.955~960 (1994)
  19. Cottrill K, "Reversal of fortunes" (2000)
  20. Daniels RL, "A model for warehouse order picking", 105, pp.1~17 (1998)
  21. De Koster R, "Routing orderpickers in a warehouse A comparison between optimal and heuristic solutions", 30, pp.469~480 (1998)
  22. De Koster R, "Efficient order batching me- thods in warehouses", 37(7), pp.1479~1504 (1999)
  23. Desrochers M, "A new optimization algorithm for the vehicle routing problem with time windows", pp.342~354 (1992)
  24. Drucker PF, "^Management’s new para- digms^", pp.152~177
  25. Elsayed EA, "Order bat- ching algorithms and travel-time estimation for automated storage", retrieval systems, 1989, pp.27 7, 1097~1114
  26. Elsayed EA, "Order processing in automated storage", retrieval systems with due dates, 1996, pp.28(7), 567~577
  27. Elsayed EA, "Compu- terized algorithms for order processing in automated warehousing systems", 21 4, pp.579~586 (1983)
  28. Elsayed EA, "Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals International Journal of Production Research 31", pp.727~738 (1993)
  29. "A comparative study of approaches to dynamic location problems", 6, pp.133~143 (1981), Erlenkotter D
  30. Eynan A, "Establi- shing zones in single-command class- based rectangular AS", RS, 1994, pp.26, 38~46
  31. Fisher M, "Vehicle routing with time windows: two optimization algorithms", 45, pp.488~492 (1997)
  32. Garcia BL, "A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints", pp.1025~1033 (1994)
  33. Gibson DR, "Order bat- ching procedures", 58 1, pp.57~67 (1992)
  34. Goetschalckx M, "An efficient algorithm to cluster order picking items in a wide aisle", 13 1, pp.263~271 (1988)
  35. Goetschalckx M, "Shared storage policies based on the duration of stay of unit loads", 36, pp.1120~1132 (1990)
  36. "A computational model for solid waste management with application", 35, pp.350~364 (1988), Gottinger HW
  37. Graves SC, "Storageretrieval interleaving in automatic warehousing systems", pp.935~945 (1977)
  38. Gross G, "Picking methods may provide key to lower cost warehouse plans", 13, pp.50~54 (1981)
  39. Hakimi SL, "Optimum locations of switching centers and the absolute centers and medians of a graph", 12, pp.450~459 (1964)
  40. Han MH, "On sequencing retrievals in an automated storage", re- trieval system, 1987, 56~66
  41. Hassan MMD, "A construction algorithm for area placement evaluation International Journal of Production Research 24", pp.1283~1295 (1986)
  42. Hausman WH, "Optimal storage assignment in automatic warehousing systems", pp.629~638 (1976)
  43. Heskett JL, "a key to warehouse stock location", pp.27~31 (1963)
  44. Hinojosa Y,, "A multi-period two-echelon multicommodity capatitated plant location problem", 123, pp.271~291 (2000)
  45. Hodgson TJ, "Production lotsizing with material handling cost consideration", 14, pp.44~51 (1982)
  46. Hwang H, "Sequencing picking operations and travel time models for man-on-board storage retrieval system", 29, pp.75~88 (1993)
  47. Irani SA, "Custom design of facility layouts for multi-product facilities using layout modules", 16, pp.259~267 (2000)
  48. Jayaraman V,, "A closed loop logistics model for remanufacturing", 50, pp.497~508 (1999)
  49. Kaku BK, "A tabu- search heuristic for the dynamic plant layout problem", 9(7), pp.374~384 (1997)
  50. Keserla A, "Analysis of dual-shuttle automated storage", retrieval systems, 1994, pp.13 6, 424~434
  51. Kettani O, "Reformulating quadratic assignment problems for efficient optimization", 2, pp.97~107 (1993)
  52. Klote JF, "The design of a distribution center with value added operations" (2000)
  53. Kochar JS, "Facility layout design in a changing environ- ment", 37(11), pp.2429~2446 (1999)
  54. Kochar JS, "MULTI- HOPE: a tool for multiple floor layout problems", 36, pp.3421~3435 (1998)
  55. Kochman GA, "Fa- cility location models for planning transatlantic communications network", 6, pp.205~211 (1981)
  56. Kohl N, "An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation", 45, pp.395~406 (1997)
  57. Kolen AJ, "Vehicle routing with time windows", pp.266~273 (1987)
  58. Kontoravdis G, "A GRASP for the vehicle routing problem with time windows", 7, pp.10~23 (1995)
  59. & Gu- tierrez GJ, "Algorithms for robust single and multiple period layout planning for manufacturing systems European Journal of Operational Re- search 63", pp.287~303 (1992)
  60. The simple plant location problem, "European Journal of Ope- rational Research 12", pp.36~81 (1983)
  61. Krikke HR,, "Business case Oce: Reverse logistic network redesign for copiers", 21(3), pp.381~409 (1999)
  62. Kroon L, "Returnable containers: An example of reverse logistics", 25(2), pp.56~68 (1995)
  63. Lee HL, "Hewlettpacked gains control of inventory and service through design for localization", pp.1~11 (1993)
  64. Lee HF, "Retrieval sequencing for unitload automated storage and retrieval systems with multiple openings", 34(10), pp.2943~2962 (1996)
  65. & Bihain A, "On a bundle algorithm for nonsmooth optimization", (nlinear programming 4) (1981), Academic Press
  66. Linn RJ, "An expert system framework for automated storage and retrieval system control", 18 1, pp.37~48 (1990)
  67. Louwers DBJ,, "A facility location allocation model for reusing carpet material", 36(4), pp.855~869 (1999)
  68. Mallette AJ, "A generalized assignment approach to optimal facility layout", 4, pp.144~147 (1972)
  69. Manne AS, "Investment for capacity expansion" (1967), MIT Press
  70. Marks DH, "Facility location and routing models on solid waste collection systems" (1969), Johns Hopkins University
  71. Meller RD, "The facility layout problem: Recent and emerging trends and perspectives", 15(5), pp.351~366 (1996)
  72. Min H, "A bicriterion reverse distribution model for product recall", 17 5, pp.483~490 (1989)
  73. Montreuil B, "Fractal layout organization for job shop environments", 37(3), pp.501~521 (1999)
  74. Or I, "Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking Department of Indus- trial Engineering and Management Science" (1976), Northwestern University
  75. SWAP, "a computer package for solid waste management", pp.83~99 (1992)
  76. Petersen II CG, "An evaluation of order picking routing policies", 7(11), pp.1098~1111 (1997)
  77. Potvin J, "A parallel route building algorithms for the vehicle routing and scheduling problem with time windows", 66, pp.331~340 (1993)
  78. Potvin JY, "An exchange heuristic for routing problems with time windows", 46, pp.1433~1446 (1995)
  79. Potvin JY, "The vehicle routing problem with time windows-Part II-Genetic search", 8, pp.165~172 (1996)
  80. Potvin JY, "The vehicle routing problem with time windows-Part I-Tabu search", 8, pp.158~164 (1996)
  81. Rao RC, "Multilo- cation Plant Sizing and Timing", 23, pp.1187~1198 (1977)
  82. Ratliff HD, "Order- picking in a rectangular warehouse a solvable case of the traveling salesman problem", pp.507~521 (1983)
  83. Richardson HL, "Cut inventory", transportation and distributiion 35(2), pp.38~39 (1994)
  84. Richmond B, "Warehouse management systems technologies: Tech- nology-enabled warehouse excellence", pp.396~406 (1998), Gower Publishing Limited
  85. Rochat Y, "Probabilis- tic diversification and intensification in local search for vehicle routing", 1, pp.147~167 (1995)
  86. Roll Y, "Random versus grouped storage policies and their effect on warehouse capacity", 1, pp.199~205 (1983)
  87. Rosenblatt MJ, "Deriving the optimal boundaries for class-based automatic storage", retrieval systems, 1989, pp.35, 1519~1524
  88. Rosenblatt MJ, "The dynamics of plant layout", 32, pp.76~85 (1986)
  89. Rosenwein MB, "A comparison of heuristics for the problem of batching orders for warehouse selection", 34(3), pp.657~664 (1996)
  90. Russell RA, "Hybrid heuristics for the vehicle routing problem with time windows", 29, pp.156~166 (1995)
  91. Sahni S, "P-complete approximation problem", 23 3, pp.555~565 (1976)
  92. Mann Jr L, "Evaluation of a class-based storage scheduling technique applied to dual-shuttle automated storage and retrieval systems", pp.442~449 (1994)
  93. Schwartz B, "Reverse logistics streng- thens supply chains." (2000)
  94. Schwarz LB, "Scheduling policies for automatic warehousing systems", pp.260~270 (1978)
  95. Seidmann A, "Intelligent control schemes for automated storage and retrieval systems", 26 5, pp.931~952 (1988)
  96. Shulman A, "An algorithm for solving dynamic capacitated plant location pro- blems with discrete expansion sizes", 39, pp.423~436 (1991)
  97. Solomon MM, "Algorithms for the vehicle routing and scheduling problems with time window constraints", 35, pp.254~265 (1987)
  98. Spengler T,, "Environmental inte- grated production and recycling mana- gement", 97, pp.308~326 (1997)
  99. Sule DR, "Simple methods for uncapacitated facility location", allocation problems, 1981, pp.1, 215~223
  100. Taillard E, "A tabu search heuristic for the vehicle routing problem with soft time windows", pp.170~186 (1997)
  101. Tam KY, "A simulated annealing algorithm for allocating space to manufacturing cells", 30, pp.63~87 (1992)
  102. Tate DM, "Unequal area facility layout using genetic search", 27(4), pp.465~472 (1995)
  103. Thompson PM, "Cyclic transfer algorithms for multivehicle routing and scheduling pro- blems", 41, pp.935~946 (1993)
  104. Tompkins JA, "Facilities Planning" (1996)
  105. Trebilcock B, "A winning formula for reverse logistics" (2002)
  106. Urban TL, "A heuristic for the dynamic layout problem", 25 4, pp.57~63 (1993)
  107. van Camp DJ, "A nonlinear optimization approach for solving facility layout problem European Journal of Opera- tional Research 57", pp.174~189 (1991)
  108. Van Roy TJ, "A dual based procedure for dynamic facility location", 28, pp.1091~1105 (1982)
  109. Warszawski A, "Multi-dimensional location problems", 24, pp.165~179 (1973)
  110. Weber A, "translated as Alfred Weber’s Theory of the Location of Industries University of Chicago"
  111. Zinn W, "Planning physical distribution with the principle of postponement", 9 2, pp.117~136 (1988)

관련 논문AI추천

이 간행물의 다른 논문 (5건)