Improved harmony search algorithm for truck scheduling problem in multiple-door cross-docking systems
type: Item
instance of: scholarly article
title: Improved harmony search algorithm for truck scheduling problem in multiple-door cross-docking systems
zbMATH Open document ID: 1417.90083
DOI: 10.1155/2018/7913256
author: Zhanzhong Wang
author: Yue Lü
author: Liying Zhao
author: Ningbo Cao
published in: Discrete Dynamics in Nature and Society
publication date: 2019-02-20T00:00:00Z
review text: Summary: The key of realizing the cross docking is to design the joint of inbound trucks and outbound trucks, so a proper sequence of trucks will make the cross-docking system much more efficient and need less makespan. A cross-docking system is proposed with multiple receiving and shipping dock doors. The objective is to find the best door assignments and the sequences of trucks in the principle of products distribution to minimize the total makespan of cross docking. To solve the problem that is regarded as a mixed integer linear programming (MILP) model, three metaheuristics, namely, harmony search (HS), improved harmony search (IHS), and genetic algorithm (GA), are proposed. Furthermore, the fixed parameters are optimized by Taguchi experiments to improve the accuracy of solutions further. Finally, several numerical examples are put forward to evaluate the performances of proposed algorithms.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7026688
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/7913256
OpenAlex ID: W2800129407
cites work: Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
cites work: Truck scheduling in cross-docking terminals with fixed outbound departures
cites work: An improved harmony search algorithm for solving optimization problems
description: scientific article; zbMATH DE number 7026688