Title

A customized genetic algorithm for solving multi-period cross-dock truck scheduling problems

Document Type

Article

Publication Date

5-15-2017

DOI

https://doi.org/10.1016/j.measurement.2017.05.027

Abstract

Cross-docking is a logistics strategy for direct distribution of products from a supplier or manufacturing plant to a customer or retail outlet with little or no handling and storage time. The classical cross-docking models are used to find the optimal inbound/outbound truck schedule that minimizes the total operational time. We propose a new multi-period cross-docking model with multiple products, due dates, variable truck capacities, and temporary warehouse. The problem is formulated as mixed-integer programming and an evolutionary computation approach based on a genetic algorithm (GA) is designed to solve it. The structure of the chromosomes, the operators, and the constraint handling strategy are specifically designed for multi-period problems. Several test instances have been generated to compare the performance of the proposed GA with that of a branch and bound solution procedure. Moreover, a comprehensive statistical analysis is conducted to illustrate the performance efficacy of the proposed GA relative to the branch and bound algorithm. This analysis reveals that the GA provides a substantial decrease in the computational burden when compared to the branch and bound algorithm.

Language

English

Comments

Khalili-Damghani, K., Tavana. M., Santos-Arteaga, F.J. and Ghanbarzad-Dashti, M. (2017) ‘A Customized Genetic Algorithm for Solving Multi-Period Cross-Dock Truck Scheduling Problems,’ Measurement, Vol. 108, pp. 101-118.

Share

COinS