The ant colony optimization meta-heuristic
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
The Best Shape for a Crossdock
Transportation Science
Multiple crossdocks with inventory and time windows
Computers and Operations Research
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Modeling and analysis of a generic cross-docking facility
WSC '05 Proceedings of the 37th conference on Winter simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
Vehicle routing scheduling for cross-docking in the supply chain
Computers and Industrial Engineering - Special issue: Logistics and supply chain management
Positioning of goods in a cross-docking environment
Computers and Industrial Engineering
Computers and Industrial Engineering
Truck scheduling at zero-inventory cross docking terminals
Computers and Operations Research
Scheduling trucks in cross-docking systems: Robust meta-heuristics
Computers and Industrial Engineering
Ant colony optimization algorithm to solve for the transportation problem of cross-docking network
Computers and Industrial Engineering
Vehicle routing with cross-docking in the supply chain
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Robust door assignment in less-than-truckload terminals
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
A tabu search approach to the truck scheduling problem with multiple docks and time windows
Computers and Industrial Engineering
Hi-index | 12.06 |
Cross-docking is an approach in inventory management which can reduce inventories, lead times and customer response time. In this strategy, products and shipments are unloaded from inbound trucks, sorted and categorized based on their characteristics, moved and loaded onto outbound trucks for delivery to demand points in a distribution network. The important fact is that, the items are stored in the inventory for a period which is primarily less than the actual time allocated to keep these items in a typical warehouse. Therefore, total cost and space requirement for inventory can be cut down. One of the most important targets in such systems is to establish coordination between the performance of inbound and outbound trucks in that these trucks can be scheduled, and the product items can be allocated to trucks effectively. This paper addresses some meta-heuristics to find the best sequence of inbound and outbound trucks, so that the objective, minimizing the total operation time called makespan, can be satisfied. Furthermore, not only the efficiency and capability of the algorithms' parameters are assessed and analyzed by some performance measures, but also these meta-heuristics are compared with each other in order to find out the set of homogeneous algorithms among all proposed algorithms. By this analysis, it can be shown that the suitability of these meta-heuristics is quite sensible especially for the cross-docking systems with large sizes in which a high volume of inbound or outbound trucks transmit the product items.