Article ID: | iaor2009313 |
Country: | United Kingdom |
Volume: | 59 |
Issue: | 1 |
Start Page Number: | 119 |
End Page Number: | 136 |
Publication Date: | Jan 2008 |
Journal: | Journal of the Operational Research Society |
Authors: | Sung C.S., Yang W. |
Keywords: | graphs, networks, programming: integer |
This paper proposes a branch-and-price algorithm as an exact algorithm for the cross-docking supply chain network design problem introduced by one of the authors of this paper. The objective is to optimally locate cross-docking (CD) centres and allocate vehicles for direct transportation services from the associated origin node to the associated CD centre or from the associated CD centre to the associated destination node so as to satisfy a given set of freight demands at minimum cost subject to the associated service (delivery) time restriction. A set-partitioning-based formulation is derived for the problem for which some solution properties are characterized. Based on the properties, a branch-and-price algorithm is derived.