A decomposition scheme for large-scale Service Network Design with asset management
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.
Volume (Year): 46 (2010)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.