Network Scheduling Problem with Cross-Docking and Loading Constraints. Castellucci, P. B., Costa, A. M., & Toledo, F. Computers & Operations Research, 2021. doi abstract bibtex 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.
@article{castellucci21network,
title = {Network Scheduling Problem with Cross-Docking and Loading Constraints},
author = {Castellucci, P. B. and Costa, A. M. and Toledo, F.M.B},
year = {2021},
journal = {Computers \& Operations Research},
volume = {132 (online first)},
issn = {0305-0548},
doi = {10.1016/j.cor.2021.105271},
urldate = {2021-04-15},
abstract = {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.},
copyright = {All rights reserved},
langid = {english},
file = {/Users/acosta/Zotero/storage/6GEHPY5A/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf;/Users/acosta/Zotero/storage/7PTPHJPX/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf}
}
Downloads: 0
{"_id":"aENj6HA58dz2XZSqb","bibbaseid":"castellucci-costa-toledo-networkschedulingproblemwithcrossdockingandloadingconstraints-2021","author_short":["Castellucci, P. B.","Costa, A. M.","Toledo, F."],"bibdata":{"bibtype":"article","type":"article","title":"Network Scheduling Problem with Cross-Docking and Loading Constraints","author":[{"propositions":[],"lastnames":["Castellucci"],"firstnames":["P.","B."],"suffixes":[]},{"propositions":[],"lastnames":["Costa"],"firstnames":["A.","M."],"suffixes":[]},{"propositions":[],"lastnames":["Toledo"],"firstnames":["F.M.B"],"suffixes":[]}],"year":"2021","journal":"Computers & Operations Research","volume":"132 (online first)","issn":"0305-0548","doi":"10.1016/j.cor.2021.105271","urldate":"2021-04-15","abstract":"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.","copyright":"All rights reserved","langid":"english","file":"/Users/acosta/Zotero/storage/6GEHPY5A/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf;/Users/acosta/Zotero/storage/7PTPHJPX/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf","bibtex":"@article{castellucci21network,\n title = {Network Scheduling Problem with Cross-Docking and Loading Constraints},\n author = {Castellucci, P. B. and Costa, A. M. and Toledo, F.M.B},\n year = {2021},\n journal = {Computers \\& Operations Research},\n volume = {132 (online first)},\n issn = {0305-0548},\n doi = {10.1016/j.cor.2021.105271},\n urldate = {2021-04-15},\n abstract = {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.},\n copyright = {All rights reserved},\n langid = {english},\n file = {/Users/acosta/Zotero/storage/6GEHPY5A/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf;/Users/acosta/Zotero/storage/7PTPHJPX/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf}\n}\n\n","author_short":["Castellucci, P. B.","Costa, A. M.","Toledo, F."],"key":"castellucci21network","id":"castellucci21network","bibbaseid":"castellucci-costa-toledo-networkschedulingproblemwithcrossdockingandloadingconstraints-2021","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://www.dropbox.com/s/6qxz2tlaz2bi6av/costaam.bib?dl=1","dataSources":["MrfAAeH3CCWrgiXCu"],"keywords":[],"search_terms":["network","scheduling","problem","cross","docking","loading","constraints","castellucci","costa","toledo"],"title":"Network Scheduling Problem with Cross-Docking and Loading Constraints","year":2021}