Models and Methods for Merge-In-Transit Operations
We develop integer programming formulations and solution methods for addressing operational issues in merge-in-transit distribution systems. The models account for various complex problem features including the integration of inventory and transportation decisions, the dynamic and multimodal compone...
| Main Authors: | , , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5135 |
| _version_ | 1811068734256709632 |
|---|---|
| author | Croxton, Keely L. Gendon, Bernard Magnanti, Thomas L. |
| author_facet | Croxton, Keely L. Gendon, Bernard Magnanti, Thomas L. |
| author_sort | Croxton, Keely L. |
| collection | MIT |
| description | We develop integer programming formulations and solution methods for addressing operational issues in merge-in-transit distribution systems. The models account for various complex problem features including the integration of inventory and transportation decisions, the dynamic and multimodal components of the application, and the non-convex piecewise linear structure of the cost functions. To accurately model the cost functions, we introduce disaggregation techniques that allow us to derive a hierarchy of linear programming relaxations. To solve these relaxations, we propose a cutting-plane procedure that combines constraint and variable generation with rounding and branch-and-bound heuristics. We demonstrate the effectiveness of this approach on a large set of test problems with instances with up to almost 500,000 integer variables derived from actual data from the computer industry. Key words : Merge-in-transit distribution systems, logistics, transportation, integer programming, disaggregation, cutting-plane method. |
| first_indexed | 2024-09-23T08:00:17Z |
| format | Working Paper |
| id | mit-1721.1/5135 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:00:17Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/51352019-04-09T16:03:14Z Models and Methods for Merge-In-Transit Operations Croxton, Keely L. Gendon, Bernard Magnanti, Thomas L. We develop integer programming formulations and solution methods for addressing operational issues in merge-in-transit distribution systems. The models account for various complex problem features including the integration of inventory and transportation decisions, the dynamic and multimodal components of the application, and the non-convex piecewise linear structure of the cost functions. To accurately model the cost functions, we introduce disaggregation techniques that allow us to derive a hierarchy of linear programming relaxations. To solve these relaxations, we propose a cutting-plane procedure that combines constraint and variable generation with rounding and branch-and-bound heuristics. We demonstrate the effectiveness of this approach on a large set of test problems with instances with up to almost 500,000 integer variables derived from actual data from the computer industry. Key words : Merge-in-transit distribution systems, logistics, transportation, integer programming, disaggregation, cutting-plane method. 2004-05-28T19:24:44Z 2004-05-28T19:24:44Z 2001-09 Working Paper http://hdl.handle.net/1721.1/5135 en_US Operations Research Center Working Paper;OR 351-01 1744 bytes 3046528 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Croxton, Keely L. Gendon, Bernard Magnanti, Thomas L. Models and Methods for Merge-In-Transit Operations |
| title | Models and Methods for Merge-In-Transit Operations |
| title_full | Models and Methods for Merge-In-Transit Operations |
| title_fullStr | Models and Methods for Merge-In-Transit Operations |
| title_full_unstemmed | Models and Methods for Merge-In-Transit Operations |
| title_short | Models and Methods for Merge-In-Transit Operations |
| title_sort | models and methods for merge in transit operations |
| url | http://hdl.handle.net/1721.1/5135 |
| work_keys_str_mv | AT croxtonkeelyl modelsandmethodsformergeintransitoperations AT gendonbernard modelsandmethodsformergeintransitoperations AT magnantithomasl modelsandmethodsformergeintransitoperations |