Network scheduling problem with cross-docking and loading constraints. Castellucci, P. B., Costa, A. M., & Toledo, F. Computers & Operations Research, 2021. ![Network scheduling problem with cross-docking and loading constraints [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Link 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},
volume = {132},
copyright = {All rights reserved},
issn = {0305-0548},
url = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Castellucci-et-al.-2021-Network-scheduling-problem-with-cross-docking-and-.pdf},
doi = {10.1016/j.cor.2021.105271},
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.},
language = {en},
urldate = {2021-04-15},
journal = {Computers \& Operations Research},
author = {Castellucci, P. B. and Costa, A. M. and Toledo, F.M.B},
year = {2021},
}
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","volume":"132","copyright":"All rights reserved","issn":"0305-0548","doi":"10.1016/j.cor.2021.105271","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.","language":"en","urldate":"2021-04-15","journal":"Computers & Operations Research","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","bibtex":"@article{castellucci21network,\n\ttitle = {Network scheduling problem with cross-docking and loading constraints},\n\tvolume = {132},\n\tcopyright = {All rights reserved},\n\tissn = {0305-0548},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Castellucci-et-al.-2021-Network-scheduling-problem-with-cross-docking-and-.pdf},\n\tdoi = {10.1016/j.cor.2021.105271},\n\tabstract = {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\tlanguage = {en},\n\turldate = {2021-04-15},\n\tjournal = {Computers \\& Operations Research},\n\tauthor = {Castellucci, P. B. and Costa, A. M. and Toledo, F.M.B},\n\tyear = {2021},\n}\n\n\n\n","author_short":["Castellucci, P. B.","Costa, A. M.","Toledo, F."],"urlLink":"https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Castellucci-et-al.-2021-Network-scheduling-problem-with-cross-docking-and-.pdf","key":"castellucci21network-1","id":"castellucci21network-1","bibbaseid":"castellucci-costa-toledo-networkschedulingproblemwithcrossdockingandloadingconstraints-2021","role":"author","urls":{"Link":"https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Castellucci-et-al.-2021-Network-scheduling-problem-with-cross-docking-and-.pdf"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero-mypublications/alycosta","dataSources":["MrfAAeH3CCWrgiXCu","hCi3uawDLBj5gkLeb"],"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}