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

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 fr...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The Journal of the Operational Research Society Ročník 59; číslo 1; s. 119 - 136
Hlavní autoři:	Sung, C S, Yang, W
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Taylor & Francis 01.01.2008 Palgrave Macmillan Press Palgrave Macmillan UK Palgrave Taylor & Francis Ltd
Témata:	Algorithms Applied sciences Business and Management Cross docking Direct service costs Exact sciences and technology Firm modelling Flows in networks. Combinatorial problems Freight Heuristic Heuristics integer programming Logistics Management networks and graphs Operational research and scientific management Operational research. Management science Operations research Operations Research/Decision Theory Optimal solutions Performance evaluation Shipping Studies Supply chain management Supply chains Theoretical Paper Theoretical Papers Transportation demand Transportation services Variable costs Vehicle capacity Vehicles networks and graphs integer programming logistics Branching Local search Distribution cost Set partitioning Combinatorial optimization Delivery lead time Integer programming Service time Neighborhood search Heuristic method Network Set theory Logistics
ISSN:	0160-5682, 1476-9360
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!