Management Science and Financial Engineering

  • 제13권1호
  • /
  • Pages.93-113
  • /
  • 2007
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

Dynamic Matching Algorithms for On-Time Delivery in e-Logistics Brokerage Marketplaces

  • 발행 : 2007.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In the previous research, we considered a logistics brokerage problem with the objective of minimizing total transportation lead time of freights in a logistics e-marketplace, in which a logistics brokerage agent intermediates empty vehicles and freights registered by car owners and shippers [7]. However, in the logistics e-marketplace, transportation due date tardiness is more important than the transportation lead time, since transportation service level is critically determined by whether the due date is met or not. Therefore, in this paper, we deal with the logistics brokerage problem with the objective of minimizing total tardiness of freights. Hungarian method based matching algorithms, real time matching(RTM), periodic matching(PM), and fixed matching(FM), are used for solving the problem considered in this paper. In order to test performance of the proposed algorithms, we perform computational experiments on a various problem instances. The results show that the waiting-and-matching algorithms, PM and FM, also give better performance than real time matching strategy, RTM, for the total tardiness minimization problem as the algorithms did for the total lead time minimization problem.

키워드

참고문헌

  1. Baita, F., R. Pesenti, W. Ukovich, and D. Favaretto, 'A comparison of different solution approaches to the vehicle scheduling problem in a practical case,' Computers and Operations Research 27 (2000), 1249-1269 https://doi.org/10.1016/S0305-0548(99)00073-8
  2. Baker, B. M. and J. Sheasby, 'Extensions to the generalised assignment heuristic for vehicle routing,' European Journal of Operational Research 119 (1999), 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 Sim-chi-Levi, David, 'Analysis of a new vehicle scheduling and location problem,' Naval Research Logistics 48 (2001), 363-385 https://doi.org/10.1002/nav.1024
  4. Bodin, L. D., B. L. Golden, A. A. Assad, and M. O. Ball, 'Routing and scheduling of vehicles and crews: the state of the art,' Computer and Operations Research 10 (1983), 63-211 https://doi.org/10.1016/0305-0548(83)90030-8
  5. Desrochers, M., J. K. Lenstra, and M. W. P. Savelsberg, 'A classification scheme for routing and scheduling problems,' European Journal of Operations Research 46 (1990), 322-332 https://doi.org/10.1016/0377-2217(90)90007-X
  6. Jeong, K.-C, 'Multi-Criteria Decision Making Based Logistics Brokerage Agents,' IE Interfaces 16 (2003), 473-484
  7. Jeong, K.-C., 'Dynamic matching algorithms for internet-based logistics brokerage agents,' International Journal of Management Science 10 (2004), 77-96
  8. Karacapilidis, N. and P. Moratis, 'Building an agent-mediated electronic commerce system with decision analysis features,' Decision Support Systems 32 (2001), 53-69 https://doi.org/10.1016/S0167-9236(01)00100-2
  9. Kim, J.-U. and Y.-D. Kim, 'A decomposition approach to a multi-period vehicle scheduling problem,' Omega 27 (1999), 421-430 https://doi.org/10.1016/S0305-0483(98)00067-X
  10. Penn, M. and M. Tennenholtz, 'Constrained multi-object auctions and bmatching,' Information Processing Letters 75 (2000), 29-34 https://doi.org/10.1016/S0020-0190(00)00073-9
  11. Ronen, D., 'Perspectives on practical aspects of truck routing and scheduling,' European Journal of Operations Research 35 (1988), 137-145 https://doi.org/10.1016/0377-2217(88)90022-7
  12. Sandholm, T., 'Algorithm for optimal winner determination in combinatorial auctions,' Artificial Intelligence 135 (2002), 1-54 https://doi.org/10.1016/S0004-3702(01)00159-X
  13. Vukadinovic, K., D. Teodorovic, and G. Pavkovic, 'An application of neuro-fuzzy modeling: The vehicle assignment problem,' European Journal of Operations Research 114 (1999), 474-488 https://doi.org/10.1016/S0377-2217(98)00154-4