Open Access

ARTICLE

A Truck Scheduling Problem for Multi-Crossdocking System with Metaheuristics

Phan Nguyen Ky Phuc¹, Nguyen Van Thanh^2,*, Duong Bao Tram¹

1 International University-Vietnam National University, Vietnam National University, HoChiMinh City, 70000, Vietnam
2 Faculty of Commerce, Van Lang University, Ho Chi Minh City, 70000, Vietnam

* Corresponding Author: Nguyen Van Thanh. Email:

Computers, Materials & Continua 2022, 72(3), 5165-5178. https://doi.org/10.32604/cmc.2022.027967

Received 29 January 2022; Accepted 23 March 2022; Issue published 21 April 2022

Abstract

The cross-docking is a very important subject in logistics and supply chain managements. According to the definition, cross-docking is a process dealing with transhipping inventory, in which goods and products are unloaded from an inbound truck and process through a flow-center to be directly loaded onto an outbound truck. Cross-docking is favored due to its advantages in reducing the material handing cost, the needs to store the product in warehouse, as well decreasing the labor cost by eliminating packaging, storing, pick-location and order picking. In cross-docking, products can be consolidated and transported as a full load, reducing overall distribution costs. In this paper, we focus on a truck scheduling at the multi-door, multi-crossdocking network with inventory constraints and process capability constraints. In this model, a truck can visit severals docks for loading or unloading many types products. This situation is very common in reality. This study also developed an exact mathematical model using mixed-integer linear programming (MILP) with the objective of minimizing the makespan to obtaint the benchmark in small scale problems. Large scale problems are solved through Simulated Annealing (SA) algorithm and Tabu Search (TS) algorithm. Performance of these algorithms will be compared to benchmarks obtained from solver as well as to each other.

---

Keywords

---