Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Surrogate gradient algorithm for Lagrangian relaxation
Journal of Optimization Theory and Applications - Special issue in honor of Yu-Chi Ho
Hi-index | 0.00 |
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.