An Electronic Brokering Process for Truckload Freight

  • Kap Hwan Kim
  • Yong-Woon Choi
  • Woo Jun Chung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4222)


This paper suggests a brokering process in which individual truckers participate in the process of matching trucks with freight. To maximize the total profit of trucks, a mathematical model is formulated for matching trucks with freight. It is shown that, by Lagrangean relaxation, the matching problem can be decomposed into a master problem and multiple sub-problems. This paper proposes a brokering process, based on the subgradient optimization technique, in which an optimality of individual truckers as well as the system optimality of truckers is satisfied. The effects of various practical considerations on the performance of the suggested brokering process are tested numerically and by using a simulation study.


Master Problem Total Profit Truck Driver Combinatorial Auction Subgradient Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abrache, J., Crainic, T.G., Gendreau, M.: Design Issues for Combinatorial Auctions. CRT-2002-2, Centre de recherché sur les transports, University of Montreal (2002)Google Scholar
  2. 2.
    Babin, G., Crainic, T.G., Gendreau, M., Keller, R.K., Kropf, P., Robert, J.: Towards Electronic Marketplaces: A Progress Report. CRT-2001-33, Centre de recherché sur les transports, University of Montreal (2001)Google Scholar
  3. 3.
    Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. of Global Optimization 6, 109–133 (1995)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Kohl, N., Madsen, O.B.G.: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangean Relaxation. Technical Report, Institute of Mathematical Modeling, The Technical University of Denmark,
  5. 5.
    Kutanoglu, E., Wu, S.D.: On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IMSE Technical Report 97T-012, Lehigh University (1997),
  6. 6.
    Oren, M.E., Williams, A.C.: On competitive bidding. Operational Research 23(6), 1072–1079 (1975)MATHMathSciNetGoogle Scholar
  7. 7.
    Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill International, UKGoogle Scholar
  8. 8.
    Stewart Jr., W.R., Golden, B.L.: A Lagrangean relaxation heuristic for vehicle routing. European Journal of Operational Research 15, 84–88 (1984)MATHCrossRefGoogle Scholar
  9. 9.
    Zhao, X., Luh, P.B., Wang, J.: The surrogate gradient algorithm for Lagrangian relaxation. Journal of Optimization Theory and Applications 100(3) (1999),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kap Hwan Kim
    • 1
  • Yong-Woon Choi
    • 1
  • Woo Jun Chung
    • 1
  1. 1.Department of Industrial EngineeringPusan National UniversityBusanKorea

Personalised recommendations