An exact algorithm for a cross-docking supply chain network design problem

Cited 31 time in webofscience Cited 0 time in scopus
  • Hit : 685
  • Download : 0
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.
Publisher
Palgrave Macmillan Ltd
Issue Date
2008-01
Language
English
Article Type
Article
Keywords

GENERALIZED ASSIGNMENT PROBLEM; EXPRESS SHIPMENT SERVICE; MOTOR CARRIER INDUSTRY; FORMULATIONS; SYSTEM

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.59, no.1, pp.119 - 136

ISSN
0160-5682
DOI
10.1057/palgrave.jors.2602328
URI
http://hdl.handle.net/10203/87210
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 31 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0