Small and mid-sized freight carriers are suggested to cooperate with fellow companies and to perform collaborative transportation planning (CTP) enabling an exchange of customer requests for higher operational efficiencies. In order to realize the synergy embedded in CTP, appropriate request exchange mechanisms have to be developed. Compared to their static counterparts, little research has been conducted on dynamic CTP problems (DCTPP). In this paper, the DCTPP of a coalition of freight carriers offering full truckload transport services is presented. A rolling horizon planning approach is proposed to solve this problem. Computational studies are carried out to identify the potential of cost-savings through CTP and to analyze the influence of the degree of dynamism of instances on the planning results. © 2013 Springer-Verlag.
CITATION STYLE
Wang, X., & Kopfer, H. (2013). Dynamic collaborative transportation planning: A rolling horizon planning approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8197 LNCS, pp. 128–142). Springer Verlag. https://doi.org/10.1007/978-3-642-41019-2_10
Mendeley helps you to discover research relevant for your work.