Truck backhauling on networks with many terminals
暂无分享,去创建一个
Truck backhauling reduces empty truck-miles by having drivers haul loads on trips back to their home terminal. This paper develops a model to help coordinate backhauling between many (more than two) terminals. Two mathematical programming formulations of this backhauling problem are given. One formulates it as a "matching" problem that leads to a heuristic for solving the very large backhauling problems that arise in practice. Using Lagrangian relaxation, the other formulation allows a very tight bound on the optimal solution to be calculated. The quality of the heuristic solution can be determined by comparison with this bound. A large scale example based on actual truck shipments demonstrates how the model might be used in planning truck backhauling. For this example, the heuristic yields a solution within 1% of optimal.
[1] W. Cunningham,et al. A primal algorithm for optimum matching , 1978 .
[2] David Avis,et al. A survey of heuristics for the weighted matching problem , 1983, Networks.
[3] William C. Jordan,et al. Truck backhauling on two terminal networks , 1984 .
[4] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..