A Decomposition Scheme for Large-Scale Service Network Design with Asset Management
Résumé
In this paper, we address a large-scale freight transportation problem for maximizing the profit of a carrier. We propose two solving algorithms using a decomposition of the problem into three main steps: construction of the network, filling vehicles with commodities and construction of the vehicle plannings. The resolution of these steps involves heuristic schemes, Mixed Integer Programming and Constraint Programming techniques. To evaluate the model and the solution algorithms, we produce instances based on a study of real-life data. The results show that the methods without transhipment provide solutions with a good computation time/quality trade-off.