Advanced search
Start date
Betweenand


Integration of cross-docking and routing problems for a distribution system

Full text
Author(s):
Eduardo Delcides Bernardes
Total Authors: 1
Document type: Doctoral Thesis
Press: São Carlos.
Institution: Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC/SB)
Defense date:
Examining board members:
Franklina Maria Bragion de Toledo; Victor Claudio Bento de Camargo; Ana Paula Ferreira Dias Barbosa Póvoa; Maristela Oliveira dos Santos
Advisor: Franklina Maria Bragion de Toledo
Abstract

Supply chain management entails controlling and integrating different processes between suppliers and consumers. Cross-docking is a widely adopted distribution strategy which considers intermediate installations (cross-docks) and contributes to reducing logistics costs, in particular, storage costs. According to literature, both in cross-docking and in its network, many decision problems may be integrated to define a more efficient distribution plan. In this study, cross-dock schedule and vehicle routing problems are approached in an integrated way based on a typical retail network. To the best of our knowledge, there are only two papers similar to this study; however, they focus on a distribution system of perishable products with features that are not suitable here. For the problem studied, we develop two mixed integer models and compare the integrated problem solutions with hierarchical strategies solutions through computational experiments. The results show that, with the integrated strategy, it is possible to obtain a lower cost distribution plan and fewer violations of delivery time windows. To deal with larger instances, we propose three solution heuristic methods. First, we present a constructive heuristic that provides a quick solution, mainly to the instances with higher chances of load consolidation. After that, we develop a variable neighborhood search meta-heuristic from which we obtain solutions up to 27% better than the ones obtained using the Gurobi solver. Finally, we adapt the matheuristic Proximity Search to solve the problem. In this case, as expected, the method presents a better performance to larger instances. (AU)

FAPESP's process: 16/20504-1 - Operational planning integrating cross docking and vehicle routing for a distribution system.
Grantee:Eduardo Delcides Bernardes
Support Opportunities: Scholarships in Brazil - Doctorate