Planning in a cross dock network with an operational scheduling overview

Document Type : conference paper

Authors

1 School of Industrial Engineering, Iran university of Science and Technology, Tehran, Iran

2 Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

Abstract

Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. According to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. Considering the cross dock limited capacities (equipment, storage space, work force, and etc.), sometimes it is not possible to deliver the supplier's products to customers in the right times. Thus, suppliers pay more tardiness penalties for scheduling problems in the cross dock centers. The current paper aims to propose an integer programming mathematical model that enables the suppliers to choose appropriate transportation paths according to amount of products delivered and moreover considering cross docks scheduling time constraints. In fact, cross dock centers present the list of outbound trucks departure times and suppliers reserve certain capacity based on their tardiness, transportation and inventory holding costs. Moreover, in this paper, a Lightening search algorithm (LSA) is developed to solve the proposed model. Additionally, to develop the solving procedure, a heuristic algorithm is proposed and compared with the LSA.

Keywords

Main Subjects

References

Boysen, N. (2010). Truck scheduling at zero-inventory cross docking terminals. Computers & Operations Research, 37(1), 32-41.
 
Boysen, N., & Fliedner, M. (2010). Cross dock scheduling: Classification, literature review and research agenda. Omega, 38(6), 413-422.
 
Forouharfard, S., & Zandieh, M. (2010). An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems. The International Journal of Advanced Manufacturing Technology, 51(9-12), 1179-1193.
 
Liao, T. W., Egbelu, P. J., & Chang, P. C. (2013). Simultaneous dock assignment and sequencing of inbound trucks under a fixed outbound truck schedule in multi-door cross docking operations. International Journal of Production Economics, 141(1), 212-229.
 
Lim, A., Miao, Z., Rodrigues, B., & Xu, Z. (2005). Transshipment through crossdocks with inventory and time windows. Naval Research Logistics (NRL), 52(8), 724-733.
 
 Lim, A., Ma, H., & Miao, Z. (2006, May). Truck dock assignment problem with time windows and capacity constraint in transshipment network through crossdocks. In International Conference on Computational Science and Its Applications (pp. 688-697). Springer, Berlin, Heidelberg.
 
Martello, S. (1990). Knapsack problems: algorithms and computer implementations. Wiley-Interscience series in discrete mathematics and optimiza tion.
 
Rahmanzadeh Tootkaleh, S., Akbarpour Shirazi, M., Fatemi Ghomi, S. M. T., & Hosseini, S. D. (2014). Truck capacity analysis in a cross‐dock transportation network considering direct shipment. Journal of Advanced Transportation, 48(7), 891-901.
 
Shareef, H., Ibrahim, A. A., & Mutlag, A. H. (2015). Lightning search algorithm. Applied Soft Computing, 36, 315-333.
 
Vahdani, B., & Zandieh, M. (2010). Scheduling trucks in cross-docking systems: Robust meta-heuristics. Computers & Industrial Engineering, 58(1), 12-24.
 
Van Belle, J., Valckenaers, P., & Cattrysse, D. (2012). Cross-docking: State of the art. Omega, 40(6), 827-846.
 

Files

History

  • Receive Date: 19 September 2018
  • Accept Date: 19 September 2018

Share

How to cite

Statistics