4.7 Article

An Adaptive Polyploid Memetic Algorithm for scheduling trucks at a cross-docking terminal

Journal

INFORMATION SCIENCES
Volume 565, Issue -, Pages 390-421

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2021.02.039

Keywords

Cross-docking terminals; Truck scheduling; Evolutionary algorithms; Polyploidy; Hybridization; Service cost savings

Funding

  1. National Science Foundation (USA) [CMMI-1901109]

Ask authors/readers for more resources

This study introduces a new Adaptive Polyploid Memetic Algorithm (APMA) for scheduling CDT trucks in supply chains. The algorithm relies on the polyploidy concept and problem-specific hybridization techniques to improve solution quality and reduce total truck service costs.
Many supply chain stakeholders rely on the cross-docking concept, according to which products delivered in specific transportation management units to the cross-docking terminal (CDT) undergo decomposition, sorting based on the end customer preferences, consolidation, and then transported to the final destinations. Scheduling of the inbound and outbound trucks for service at the CDT doors is considered as one of the convoluted decision problems faced by the CDT operators. This study proposes a new Adaptive Polyploid Memetic Algorithm (APMA) for the problem of scheduling CDT trucks that can assist with proper CDT operations planning. APMA directly relies on the polyploidy concept, where copies of the parent chromosomes (i.e., solutions) are stored before performing the crossover operations and producing the offspring chromosomes. The number of chromosome copies is controlled through the adaptive polyploid mechanism based on the objective function improvements achieved and computational time changes. Moreover, a number of problem-specific hybridization techniques are used within the algorithm to facilitate the search process. Computational experiments show that the application of adaptive polyploidy alone may not be sufficient for the considered decision problem. Hybridization techniques that directly consider problem-specific properties are required in order to improve solution quality at convergence. Furthermore, the APMA algorithm developed in this article substantially outperforms some of the well-known state of the art metaheuristics with regards to solution quality and returns truck schedules that have lower total truck service cost. (c) 2021 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available