공컨테이너 공유플랫폼에서 수요-공급 매칭을 위한 알고리즘 연구
A Study on the Algorithm for Matching Empty Container Demand-Supply in Sharing Platform
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Empty container management has been a problem of containerized trade due to the imbalance between export and import. Recently, a platform, called container-xchange.com, was launched to share empty containers between suppliers and consumers. The suppliers, who have empty containers not used in a certain period of times, register their empty containers with the specified rental period and the number of empty containers. Similarly, the consumers, who want to use empty containers, also register the period and the quantities of empty containers. Instead of searching counterparts in the platform, we consider the problem of finding a matching of suppliers and consumers such that the number of the matched pairs is maximized. This problem can be modeled as an interval scheduling problem in which suppliers and consumers correspond to machines and jobs, respectively which have their own intervals of availability. In addition, hierarchies are also assigned to both machines and jobs and the assignment of jobs to machines is possible only if their hierarchies are compatible. Due to the computational intractability of the problem, we propose a heuristic and the performance of the heuristic is verified through numerical experiments. We found that the heuristic provides the feasible solutions faster than the off-shelf branch-and-bound method. The degradation of the quality of the solutions compared with the optimal solutions was less than 5% on average.
Abstract
Empty container management has been a problem of containerized trade due to the imbalance between export and import. Recently, a platform, called container-xchange.com, was launched to share empty containers between suppliers and consumers. The suppliers, who have empty containers not used in a certain period of times, register their empty containers with the specified rental period and the number of empty containers. Similarly, the consumers, who want to use empty containers, also register the period and the quantities of empty containers. Instead of searching counterparts in the platform, we consider the problem of finding a matching of suppliers and consumers such that the number of the matched pairs is maximized. This problem can be modeled as an interval scheduling problem in which suppliers and consumers correspond to machines and jobs, respectively which have their own intervals of availability. In addition, hierarchies are also assigned to both machines and jobs and the assignment of jobs to machines is possible only if their hierarchies are compatible. Due to the computational intractability of the problem, we propose a heuristic and the performance of the heuristic is verified through numerical experiments. We found that the heuristic provides the feasible solutions faster than the off-shelf branch-and-bound method. The degradation of the quality of the solutions compared with the optimal solutions was less than 5% on average.
참고문헌 (23)
- 여민영, "공유물류 플랫폼을 통한 중소 물류기업의 시그널링 전략", 로지스틱스연구, 28(4), pp.1~12 (2020), 한국로지스틱스학회[DOI]
- 웨이치, "컨테이너 터미널에 적용 가능한 인더스트리 4.0 기반 제품", 서비스의 개념 설계 및 중요성 분석, 2018, pp.26(3), 91~110[DOI]
- 이아영, "신남방지역 허브항 선정을 통한 컨테이너 해상운송경로 연구", 로지스틱스연구, 29(6), pp.19~35 (2021), 한국로지스틱스학회[DOI]
- Arkin E. M., "Scheduling jobs with fixed start and end times", Discrete Applied Mathematics, 18, pp.1~8 (1987)
- Boysen N., "Matching supply and demand in a sharing economy : Classification, computational complexity, and application", European Journal of Operational Research, 278, pp.578~595 (2019)
- Cheung R, K., "A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem", Transportation Science, 32(2), pp.142~162 (1998)
- Edirisinghe L., "The reality of container exchange between shipping lines : Clearing the pathway to virtual container yard", Transport Policy, 72, pp.55~66 (2018)
- Gupta U. I., "An optimal solution for the channel-assignment problem", IEEE Transactions on Computers, C-28(11), pp.807~810 (1979)
- Goh S. H., "Operational shadow pricing in back haul container shipping", Transportation Research Part E : Logistics and Transportation Review, 92, pp.3~15 (2016)
- Hojati. M., "A greedy heuristic for shift minimization personnel task scheduling problem", Computers and Operations Research, 100, pp.66~76 (2018)
- Jansen. K., "An approximation algorithm for the license and shift class design problem", European Journal of Operational Research, 73, pp.127~131 (1994)
- Kolen A. W. J., "Interval scheduling : A survey", Naval Research Logistics, 54(5), pp.530~543 (2007)
- Lam S. W., "An approximate dynamic programming approach for the empty container allocation problem", Transportation 14 Research Part C : Emerging Technologies, 15(4), pp.265~277 (2007)
- Lee C. Y., "Ocean container transport in global supply chains : Overview and research opportunities", Transportation Research Part B : Methodological, 95, pp.442~474 (2017)
- Legros B., "A time-based policy for empty container management by consignees", Production and Operations Management, 28(6), pp.1503~1527 (2019)
- Li J. A., "Allocation of empty containers between multiports", European Journal of Operational Research, 182(1), pp.400~412 (2007)
- Meng Q., "Liner shipping service network design with empty container repositioning", Transportation Research Part E : Logistics and Transportation Review, 47(5), pp.695~708 (2011)
- Moon I. K., "Repositioning of empty containers using both standard and foldable containers", Maritime Economics & Logistics, 18(1), pp.61~77 (2016)
- Rodrigue J. P., "Looking inside the box : Evidence from the containerization of commodities and the cold chain", Maritime Policy &Management, 42(3), pp.207~227 (2015)
- Shintani K., "The container shipping network design problem with empty container repositioning", Transportation Research Part E: Logistics and Transportation Review, 43(1), pp.39~59 (2007)
- Smet P., "The shift minimisation personnel task scheduling problem : A new hybrid approach and computational insights", Omega, 46, pp.64~73 (2014)
- Song D. P., "Long-haul liner service route design with ship deployment and empty container repositioning", Transportation Research Part B : Methodological, 55, pp.188~211 (2013)
- Zheng J., "Measuring the perceived container leasing prices in liner shipping network design with empty container repositioning", Transportation Research Part E : Logistics and Transportation Review, 94, pp.123~140 (2016)