An Electronic Brokering Process for Truckload Freight
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.
KeywordsMaster Problem Total Profit Truck Driver Combinatorial Auction Subgradient Optimization
Unable to display preview. Download preview PDF.
- 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.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
- 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, http://www.imm.dtu.dk//documents/ftp/tr95/tr95.html
- 5.Kutanoglu, E., Wu, S.D.: On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IMSE Technical Report 97T-012, Lehigh University (1997), http://lehigh.edu/~sdw1/erhan1
- 7.Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill International, UKGoogle Scholar
- 9.Zhao, X., Luh, P.B., Wang, J.: The surrogate gradient algorithm for Lagrangian relaxation. Journal of Optimization Theory and Applications 100(3) (1999), http://www.engr.uconn.edu/msl/p7.htm