Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. of Global Optimization 6, 109–133 (1995)
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
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
Oren, M.E., Williams, A.C.: On competitive bidding. Operational Research 23(6), 1072–1079 (1975)
Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill International, UK
Stewart Jr., W.R., Golden, B.L.: A Lagrangean relaxation heuristic for vehicle routing. European Journal of Operational Research 15, 84–88 (1984)
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, K.H., Choi, YW., Chung, W.J. (2006). An Electronic Brokering Process for Truckload Freight. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_106
Download citation
DOI: https://doi.org/10.1007/11881223_106
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45907-1
Online ISBN: 978-3-540-45909-5
eBook Packages: Computer ScienceComputer Science (R0)