Integrated service network design for a cross-docking supply chain network

Journal of the Operational Research Society

Volumn 54, Issue 12, 2003, Pages 1283-1295

  Sung, C S ^a   Song, S H ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Integer programming; Logistics; Networks and graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; GRAPHIC METHODS; LOGISTICS; MANAGEMENT; MATHEMATICAL PROGRAMMING; POSTAL SERVICES; STRUCTURAL DESIGN; TRANSPORTATION; VEHICLES;

CROSS DOCKING (CD); INTEGRATED SERVICE NETWORKS;

DOCKING;

EID: 0346276925     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601645     Document Type: Article

References (32)

1. Grunert T and Sebastian H-J (2000). Planning models for longhaul operations of postal and express shipment companies. Eur J Opl Res 122: 289-309.
2. Simchi-Levi D, Kaminsky P and Simchi-Levi E (2000). Designing and Managing the Supply Chain. Irwin McGraw-Hill: Boston.
3. Donaldson H et al (1999). Schedule-driven cross-docking networks. Working paper The Logistics Institute of Georgia Institute of Technology.
4. Crainic TG (2000). Service network design in freight transportation. Eur J Opl Res 122: 272-288.
5. Crainic TG and Laporte G (1997). Planning models for freight transportation. Eur J Opl Res 97: 409-438.
6. Erenguc SS, Simpson NC and Vakharia AJ (1999). Integrated production/distribution planning in supply chains: an invited review. Eur J Opl Res 115: 219-236.
7. Melkote S and Daskin MS (2001). An integrated model of facility location and transportation network design. Transport Res Part A 35: 515-538.
8. Ravi R and Sinha A (2002). Integrated logistics: approximation algorithms combining facility location and network design. Presented at Ninth International IPCO Conference, May 2002, Cambridge: USA.
9. Donaldson H, Vate JV and Zhang M (1999). Network design for load-driven cross-docking systems. Working paper. The Logistics Institute of Georgia Institute of Technology.
10. Sung CS and Jin HW (2001). Dual-based approach for a hub network design problem under non-restrictive policy. Eur J Opl Res 132: 88-105.
11. Aykin T (1995). Networking policies for hub-and-spoke systems with applications to the air transportation systems. Trans Sci 29: 201-221.
12. Campbell JF (1994). Integer programming formulations of discrete hub location problems. Eur J Opl Res 72: 387-405.
13. Powell WB (1986). A local improvement heuristic for the design of less-than-truckload motor carrier networks. Trans Sci 20(4): 246-257.
14. Powell WB and Sheffi Y (1989). Design and implementation of an interactive optimization system for network design in the motor carrier industry. Opns Res 37(1): 12-29.
15. Crainic TG and Jacques R (1992). Design of regular intercity driver routes for the LTL motor carrier industry. Trans Sci 26(4): 280-295.
16. Akyilmaz MO (1994). An algorithmic framework for routeing LTL shipements. J Opl Res Soc 45(5): 529-538.
17. Farvolden JM and Powell WB (1994). Subgradient methods for the service network design problem. Trans Sci 28(3): 256-272.
18. Hoppe B et al (1999). Strategic load planning for less-than-truckload trucking. Working paper Center for research on parallel computation, Rice university.
19. Barnhart C and Schneur RR (1996). Air network design for express shipment service. Opns Res 44(6): 852-863.
20. Kim D et al (1999). Multimodal express package delivery: a service network design applications. Trans Sci 33(4): 391-407.
21. Armacost AP, Barnhart C and Ware KA (2002). Composite variable formulations for express shipment service network design. Trans Sci 36(1): 1-20.
22. Sung CS and Song SH (2003). Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network. J Opl Res Soc 54(1): 72-82.
23. Nemhauser GL and Wolsey LA (1988). Integer and Combinatorial Optimization. John Wiley & Sons: New York.
24. Sung CS and Jin HW (2000). A tabu-search-based heuristic for clustering. Pattern Recognitions 33: 849-858.
25. Berger D et al (2000). Tabu search for a network loading problem with multiple facilities. J Heuristics 6: 253-267.
26. Chamberland S, Sanso B and Marcotte O (2000). Topological design of two-level telecommunication networks with modular switches. Opns Res 48(5): 745-760.
27. Chamberland S and Sanso B (2001). On the design problem of rnultitechnology networks. INFORMS J Computing 13(3): 245-256.
28. Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston.
29. Magnanti TL, Mirchandani P and Vachani R (1995). Modeling and solving the two-facility capacitated network loading problem. Opns Res 43(1): 142-157.
30. Brookmuller B, Gunluk O and Wolsey LA (1996). Designing private line networks - polyhedral analysis and computation. Working paper CORE.
31. Lee K and Park S (2000). A cut generation method for the (0,1)-knapsack problem with a variable capacity. J KORMS Soc 25(3): 1-15.
32. Lee K (1998). Routing and capacity assignment models and algorithms for the design of telecommunication networks, Ph.D. thesis, KAIST (unpublished).