Browse > Article

Dynamic Matching Algorithms for Internet-based Logistics Brokerage Agents  

Jeong, Keun-Chae (Department of Structural Systems and Computer Aided Engineering, Chungbuk National University)
Publication Information
Management Science and Financial Engineering / v.10, no.1, 2004 , pp. 77-96 More about this Journal
Abstract
In this paper, we present a dynamic matching methodology for the logistics brokerage agent that intermediates empty vehicles and freights registered to the logistics e-marketplace by car owners and shippers. In this matching methodology, two types of decisions should be made： one is when to match freights and vehicles and the other is how to match freights and vehicles at that time. We propose three strategies for deciding when to match, ie. real time matching (RTM) , periodic matching (PM), and fixed matching (FM) and use Hungarian method for solving the how-to-match problem. In order to compare the performance of the when-to-match strategies, computational experiments are done and the results show that the waiting-and-matching strategies, PM and FM, give better performance than real time matching strategy, RTM. We can expect that the suggested matching methodology may be used as an efficient and effective tool for the brokerage agent in the logistics e-marketplaces.
Keywords
Logistics; Matching; Brokerage; Agent;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Jeong, K.-C., 'Multi-Criteria Decision Making Based Logistics Brokerage Agents,' IE Interfaces 16 (2003), 473-484
2 Karacapilidis, N. and Moratis, P., 'Building an agent-mediated electronic commerce system with decision analysis features,' Decision Support Systems 32 (2001), 53-69   DOI   ScienceOn
3 Vukadinovic, K., Teodorovic, D., and Pavkovic, G., 'An application of neurofuzzy modeling: The vehicle assignment problem,' European Journal of Operations Research 114 (1999), 474-488   DOI   ScienceOn
4 Sandholm, T., 'Algorithm for optimal winner determination in combinatorial auctions,' Artificial Intelligence 135 (2002), 1-54   DOI   ScienceOn
5 Penn, M. and Tennenholtz, M., 'Constrained multi-object auctions and bmatching,' Information Processing Letters 75 (2000), 29-34   DOI   ScienceOn
6 Ronen D., 'Perspectives on practical aspects of truck routing and scheduling,' European Journal of Operations Research 35 (1988), 137-145   DOI   ScienceOn
7 Desrochers, M., Lenstra, J. K., and Savelsberg, M. W. P., 'A classification scheme for routing and scheduling problems,' European Journal of Operations Research 46 (1990), 322-332   DOI   ScienceOn
8 Kim, J.-U. and Kim, Y.-D., 'A decomposition approach to a multi-period vehicle scheduling problem,' Omega 27 (1999), 421-430   DOI   ScienceOn
9 Bish, Ebru K., Leong, Thin-Yin, Li, Chung-Lun, Ng, Jonathan W. C., and Simchi-Levi, David, 'Analysis of a new vehicle scheduling and location problem,' Naval Research Logistics 48 (2001), 363-385   DOI   ScienceOn
10 Baita, F., Pesenti, R., Ukovich, W., and Favaretto, D., 'A comparison of different solution approaches to the vehicle scheduling problem in a practical case,' Computers and Operations Research 27 (2000), 1249-1269   DOI   ScienceOn
11 Baker, B. M. and Sheasby, J., 'Extensions to the generalised assignment heuristic for vehicle routing,' European Journal of Operational Research 119(1999), 147-157   DOI   ScienceOn
12 Bodin L. D., Golden B. L., Assad A. A., and Ball M. O., 'Routing and scheduling of vehicles and crews: the state of the art,' Computer and Operations Research 10 (1983), 63-211   DOI   ScienceOn