IE interfaces (산업공학)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Variable Periodic/Fixed Matching Algorithms for Internet-Based Logistics Brokerage Agents

인터넷 기반의 물류중개 에이전트를 위한 가변형 정기/정량 매칭 알고리즘

  • 정근채 (충북대학교 토목공학부)
  • Received : 2010.01.22
  • Accepted : 2010.02.12
  • Published : 2010.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

In logistics e-marketplaces, brokerage agents intermediate empty vehicles and freights registered by car owners and shippers. In the previous research, we proposed constant periodic/fixed matching algorithms for the logistics brokerage agents with the objective of minimizing the total transportation lead time and the transportation due date tardiness of freights(Jeong, 2004; Jeong, 2007). However, the constant type algorithms cannot consider changes in the balance status of an e-marketplace, i.e. the difference between the numbers of freights and vehicles to wait for matching, because they use non-changing matching periods and amounts. In this paper, we propose variable type algorithms for the logistics brokerage agent, in which the matching periods and amounts are changed continuously by considering the balance status between the freights and vehicles. In order to compare performance of the variable type algorithms to the previous constant type algorithms, we carried out computational experiments on various problem instances. The results show that the variable type algorithms give better performance than the constant type algorithms. We can expect that the logistics brokerage agents can improve their performance by using the proposed variable periodic/fixed matching algorithms.

Keywords

References

  1. Baita, F., Pesenti, R., Ukovich, W., and Favaretto, D. (2000), A Comparison of Different Solution Approaches to the Vehicle Scheduling Problem in a Practical Case," Computers and Operations Research, 27(13), 1249-1269. https://doi.org/10.1016/S0305-0548(99)00073-8
  2. Baker, B. M. and Sheasby, J. (1999), Extensions to the Generalised Assignment Heuristic for Vehicle Routing, European Journal of Operational Research, 119(1), 147-157. https://doi.org/10.1016/S0377-2217(98)00348-8
  3. Bish, Ebru K., Leong, Thin-Yin, Li, Chung-Lun, Ng, Jonathan W. C., and Simchi-Levi, David (2001), Analysis of a New Vehicle Scheduling and Location Problem, Naval Research Logistics, 48(5), 363-385. https://doi.org/10.1002/nav.1024
  4. Bodin L. D., Golden B. L., Assad A. A., and Ball M. O. (1983), Routing and Scheduling of Vehicles and Crews: the State of the Art, Computer and Operations Research, 10(2), 63-211. https://doi.org/10.1016/0305-0548(83)90030-8
  5. Desrochers, M., Lenstra, J. K., and Savelsberg, M. W. P. (1990), A Classification Scheme for Routing and Scheduling Problems, European Journal of Operations Research, 46(3), 322-332. https://doi.org/10.1016/0377-2217(90)90007-X
  6. Jeong, K.-C. (2003), Multi-Criteria Decision Making Based Logistics Brokerage Agents, IE Interfaces 16(3), 473-484.
  7. Jeong, K.-C. (2004), Dynamic Matching Algorithms for Internet-Based Logistics Brokerage Agents, International Journal of Management Science, 10(1), 77-96.
  8. Jeong, K.-C. (2007), Dynamic Matching Algorithms for On-Time Delivery in e-Logistics Brokerage Marketplaces, International Journal of Management Science, 13(1), 93-113.
  9. Karacapilidis, N. and Moratis, P. (2001), Building an Agent-Mediated Electronic Commerce System with Decision Analysis Features, Decision Support Systems, 32(1), 53-69. https://doi.org/10.1016/S0167-9236(01)00100-2
  10. Kim, J.-U. and Kim, Y.-D. (1999), A Decomposition Approach to a Multi-Period Vehicle Scheduling Problem, Omega, 27(4), 421-430. https://doi.org/10.1016/S0305-0483(98)00067-X
  11. Penn, M. and Tennenholtz, M. (2000), Constrained Multi-Object Auctions and B-Matching, Information Processing Letters, 75(1-2), 29-34. https://doi.org/10.1016/S0020-0190(00)00073-9
  12. Ronen D. (1988), Perspectives on Practical Aspects of Truck Routing and Scheduling, European Journal of Operations Research, 35(2), 137-145. https://doi.org/10.1016/0377-2217(88)90022-7
  13. Sandholm, T. (2002), Algorithm for Optimal Winner Determination in Combinatorial Auctions, Artificial Intelligence, 135(1-2), 1-54. https://doi.org/10.1016/S0004-3702(01)00159-X
  14. Vukadinovic, K., Teodorovic, D., and Pavkovic, G. (1999), An Application of Neurofuzzy Modeling : the Vehicle Assignment Problem, European Journal of Operations Research, 114(3), 474-488. https://doi.org/10.1016/S0377-2217(98)00154-4