×

An exact algorithm for a cross-docking supply chain network design problem. (English) Zbl 1167.90405

Summary: 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. The properties can also be used in deriving any efficient local search heuristics with the move operation (neighbourhood search operation) of modifying assignment of some freight demands from current CD centres to other CD centres. Computational experiments show that the branch-and-price algorithm is effective and efficient and also that the solution properties contribute to improve the efficiency of the local search heuristics.

MSC:

90B10 Deterministic network models in operations research
90B06 Transportation, logistics and supply chain management
PDFBibTeX XMLCite
Full Text: DOI