An optimal solution to a dock door assignment problem
Proceedings of the 14th annual conference on Computers and industrial engineering
Staging queues in material handling and transportation systems
Proceedings of the 33nd conference on Winter simulation
Multiple crossdocks with inventory and time windows
Computers and Operations Research
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Modeling cross-docking operations using discrete event simulation
Proceedings of the 6th International Workshop on Enterprise & Organizational Modeling and Simulation
Expert Systems with Applications: An International Journal
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Multi-objective genetic-based algorithms for a cross-docking scheduling problem
Applied Soft Computing
Layout and control policies for cross docking operations
Computers and Industrial Engineering
| Hi-index | 0.00 |
This paper addresses the transportation problem of cross-docking network where the loads are transferred from origins (suppliers) to destinations (retailers) through cross-docking facilities, without storing them in a distribution center (DC). We work on minimizing the transportation cost in a network by loading trucks in the supplier locations and then route them either directly to the customers or indirectly to cross-docking facilities so the loads can be consolidated. For generating a truck operating plan in this type of distribution network, the problem was formulated using an integer programming (IP) model and solved using a novel ant colony optimization (ACO) algorithm. We solved several numerical examples for verification and demonstrative purposes and found that our proposed approach finds solutions that significantly reduce the shipping cost in the network of cross-docks and considerably outperform Branch-and-Bound algorithm especially for large problems.