Network scheduling problem with cross-docking and loading constraints
| Autor: | Pedro Belin Castellucci, Franklina Maria Bragion de Toledo, Alysson M. Costa |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization 021103 operations research General Computer Science Linear programming Consolidation (soil) Job shop scheduling Distribution (number theory) Computer science DISTRIBUIÇÃO DE MERCADORIAS 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Solver Benders' decomposition 020901 industrial engineering & automation Modeling and Simulation Decomposition (computer science) Cross-docking |
| Zdroj: | Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual) Universidade de São Paulo (USP) instacron:USP |
| Popis: | Cross-docking is a logistic strategy which can increase rates of consolidation, and reduce distribution and storage costs and delivery times. The optimization literature on cross-docking has mostly focused on the modeling and solution of problems considering a single cross-docking facility. Networks with multiple cross-docks remain rather unexplored and the few papers that deal with the problem do this by simplifying the geometry of the goods. We intend to shorten this gap by proposing a mixed-integer linear programming model for optimizing distribution and delay costs for the transportation of goods in open networks with multiple cross-docks considering the three-dimensional aspects of the cargo. Also, we propose a logic-based Benders decomposition strategy which allow for the solution of larger instances when compared with those that can be handled by a branch-and-cut MIP solver. Experiments showed that the decomposition can handle instances with two times more nodes and five times more boxes than a direct use of the solver. Also, the framework is flexible enough to accommodate other features of practical cases. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|