Optimizing Multi-Layer Merge-In-Transit Supply Chains
The authors propose an integer programming model formulation and solution algorithm to model a multi-layer supply chain network for merge-in-transit pool operations. The model explicitly describes individual small size shipment transportation decisions on choosing merge-in-transit pool strategies and pool centers in a multi-carrier supply chain network. The model subjects to a set of merge-in-transit pool operation constraints at in-transit pool centers for orders from multiple origins and destinations, which do not require to hold inventory at pool centers but require simultaneous arrivals. To solve large-scale applications, the authors develop a logic-based Benders decomposition algorithm in a branch-and-bound framework that can deal with subproblems of integer programs. The authors demonstrate the effectiveness of the proposed algorithms in two supply chain networks.
-
Supplemental Notes:
- This paper was sponsored by TRB committee ADB30 Transportation Network Modeling.
-
Corporate Authors:
500 Fifth Street, NW
Washington, DC United States 20001 -
Authors:
- Yang, Dengfeng
- Zhang, Kuilin
-
Conference:
- Transportation Research Board 94th Annual Meeting
- Location: Washington DC, United States
- Date: 2015-1-11 to 2015-1-15
- Date: 2015
Language
- English
Media Info
- Media Type: Digital/other
- Features: Figures; References; Tables;
- Pagination: 15p
- Monograph Title: TRB 94th Annual Meeting Compendium of Papers
Subject/Index Terms
- TRT Terms: Algorithms; Branch and bound algorithms; Integer programming; Optimization; Small shipments; Supply chain management
- Uncontrolled Terms: Benders decomposition; Pool centers
- Subject Areas: Freight Transportation; Planning and Forecasting; I72: Traffic and Transport Planning;
Filing Info
- Accession Number: 01556827
- Record Type: Publication
- Report/Paper Numbers: 15-1937
- Files: TRIS, TRB, ATRI
- Created Date: Mar 12 2015 11:55AM