방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 순환 공급망× | 재고 경로 문제 (Inventory Routing Problem, IRP)× | |
|---|---|---|
| 분야 | 운영관리 | 운영관리 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2003 | 2014 |
| 창시자≠ | Guide, V. D. R., & Van Wassenhove, L. N. | Coelho, L. C., Cordeau, J. F., & Laporte, G. |
| 유형≠ | Supply chain strategy | Optimization problem |
| 원전≠ | Guide, V. D. R., & Van Wassenhove, L. N. (2003). Business aspects of closed-loop supply chains. Pittsburgh: Carnegie Mellon University Press. link ↗ | Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Research Part B: Methodological, 55, 28-67. DOI ↗ |
| 별칭 | reverse logistics, circular economy logistics | IRP, vendor-managed logistics |
| 관련 | 5 | 5 |
| 요약≠ | A closed-loop supply chain (CLSC) integrates forward logistics (moving products to customers) with reverse logistics (recovering products, components, or materials from customers) to optimize resource recovery, reduce waste, and minimize environmental impact. Products flow forward for customer use, then flow backward for remanufacturing, refurbishment, recycling, or proper disposal. CLSC is driven by regulatory compliance (e.g., take-back laws), cost recovery, environmental responsibility, and increasingly, customer demand for sustainable business practices. | The Inventory Routing Problem (IRP) is an optimization problem that jointly determines inventory levels at customer locations, delivery routes, and shipment quantities to minimize total logistics and inventory holding costs. Rather than treating inventory management and vehicle routing as separate decisions, IRP recognizes that they are interdependent: larger shipments reduce routing costs but increase inventory holding costs, and vice versa. IRP is solved using mixed-integer programming, heuristics, and metaheuristics, and is a cornerstone of vendor-managed inventory (VMI) programs. |
| ScholarGate데이터셋 ↗ |
|
|