Truck backhauling on networks with many terminals |
| |
| Institution: | 1. Division of Transport Planning, KTH Royal Institute of Technology, Brinellvägen 23, Stockholm SE-100 44, Sweden;1. Department of Management Science & Technology, Athens University of Economics and Business, Greece;2. School of Chemical Engineering, National Technical University of Athens, Greece\n;1. Otto von Guericke University, Universitätsplatz 2, 39106 Magdeburg, Germany;2. University of Hagen, Universitätsstraße 1, 58097 Hagen, Germany;1. IT Convergence Technology Research Laboratory, ETRI, Daejeon 305-700, Republic of Korea;2. Department of Industrial Engineering, Seoul National University, Seoul 151-744, Republic of Korea |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
