Optimizing Truck Scheduling in a Cross-docking System with Preemption and Unloading/loading Sequence Constraint

Yan Ye; Jing-feng Li; Richard Y. K. Fung; Kaibin Li; Hui Fu

doi:10.1109/ICNSC.2018.8361332

Optimizing Truck Scheduling in a Cross-docking System with Preemption and Unloading/loading Sequence Constraint

Yan Ye^*, Jing-feng Li, Richard Y. K. Fung, Kaibin Li, Hui Fu

^*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

2 Citations (Scopus)

Abstract

To solve the truck scheduling problem with preemption and unloading/loading sequence requirement in a multi-door cross-docking system, preemption rules are analyzed and a mathematical programming model is formulated aiming at minimizing total operation time. Then, a hybrid meta-heuristic algorithm based on particle swarm optimization and tabu search (PSO-TS) is proposed. Using Taguchi method, PSO-TS is tuned to attain the best robustness. Finally, computational experiments are carried out by using problem instances with different scales to compare the performances of PSO-TS and an improved PSO in the literature. Results show that PSO-TS had a significant advantage in computational time and produced better solutions with the increase of problem sizes.

Original language	English
Title of host publication	ICNSC 2018 - The 15th IEEE International Conference on Networking, Sensing and Control
Subtitle of host publication	HANDBOOK
Publisher	IEEE
Pages	1-6
ISBN (Print)	9781538650530, 9781538650523, 9781538650547
DOIs	https://doi.org/10.1109/ICNSC.2018.8361332
Publication status	Published - Mar 2018
Event	15th IEEE International Conference on Networking, Sensing and Control (ICNSC 2018) - Zhuhai, China Duration: 27 Mar 2018 → 29 Mar 2018

Conference

Conference	15th IEEE International Conference on Networking, Sensing and Control (ICNSC 2018)
Place	China
City	Zhuhai
Period	27/03/18 → 29/03/18

Research Keywords

cross-docking truck scheduling
particle swarm optimization
preemption
tabu search
unloading/loading constraint

Access Output

10.1109/ICNSC.2018.8361332

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{3468825df23048d3b2dfac0ade081c15,

title = "Optimizing Truck Scheduling in a Cross-docking System with Preemption and Unloading/loading Sequence Constraint",

abstract = "To solve the truck scheduling problem with preemption and unloading/loading sequence requirement in a multi-door cross-docking system, preemption rules are analyzed and a mathematical programming model is formulated aiming at minimizing total operation time. Then, a hybrid meta-heuristic algorithm based on particle swarm optimization and tabu search (PSO-TS) is proposed. Using Taguchi method, PSO-TS is tuned to attain the best robustness. Finally, computational experiments are carried out by using problem instances with different scales to compare the performances of PSO-TS and an improved PSO in the literature. Results show that PSO-TS had a significant advantage in computational time and produced better solutions with the increase of problem sizes.",

keywords = "cross-docking truck scheduling, particle swarm optimization, preemption, tabu search, unloading/loading constraint",

author = "Yan Ye and Jing-feng Li and Fung, {Richard Y. K.} and Kaibin Li and Hui Fu",

year = "2018",

month = mar,

doi = "10.1109/ICNSC.2018.8361332",

language = "English",

isbn = "9781538650530",

pages = "1--6",

booktitle = "ICNSC 2018 - The 15th IEEE International Conference on Networking, Sensing and Control",

publisher = "IEEE",

address = "United States",

note = "15th IEEE International Conference on Networking, Sensing and Control (ICNSC 2018) ; Conference date: 27-03-2018 Through 29-03-2018",

}

Ye, Y, Li, J, Fung, RYK, Li, K & Fu, H 2018, Optimizing Truck Scheduling in a Cross-docking System with Preemption and Unloading/loading Sequence Constraint. in ICNSC 2018 - The 15th IEEE International Conference on Networking, Sensing and Control: HANDBOOK. IEEE, pp. 1-6, 15th IEEE International Conference on Networking, Sensing and Control (ICNSC 2018), Zhuhai, China, 27/03/18. https://doi.org/10.1109/ICNSC.2018.8361332

Optimizing Truck Scheduling in a Cross-docking System with Preemption and Unloading/loading Sequence Constraint. / Ye, Yan; Li, Jing-feng; Fung, Richard Y. K. et al.
ICNSC 2018 - The 15th IEEE International Conference on Networking, Sensing and Control: HANDBOOK. IEEE, 2018. p. 1-6.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Optimizing Truck Scheduling in a Cross-docking System with Preemption and Unloading/loading Sequence Constraint

AU - Ye, Yan

AU - Li, Jing-feng

AU - Fung, Richard Y. K.

AU - Li, Kaibin

AU - Fu, Hui

PY - 2018/3

Y1 - 2018/3

N2 - To solve the truck scheduling problem with preemption and unloading/loading sequence requirement in a multi-door cross-docking system, preemption rules are analyzed and a mathematical programming model is formulated aiming at minimizing total operation time. Then, a hybrid meta-heuristic algorithm based on particle swarm optimization and tabu search (PSO-TS) is proposed. Using Taguchi method, PSO-TS is tuned to attain the best robustness. Finally, computational experiments are carried out by using problem instances with different scales to compare the performances of PSO-TS and an improved PSO in the literature. Results show that PSO-TS had a significant advantage in computational time and produced better solutions with the increase of problem sizes.

AB - To solve the truck scheduling problem with preemption and unloading/loading sequence requirement in a multi-door cross-docking system, preemption rules are analyzed and a mathematical programming model is formulated aiming at minimizing total operation time. Then, a hybrid meta-heuristic algorithm based on particle swarm optimization and tabu search (PSO-TS) is proposed. Using Taguchi method, PSO-TS is tuned to attain the best robustness. Finally, computational experiments are carried out by using problem instances with different scales to compare the performances of PSO-TS and an improved PSO in the literature. Results show that PSO-TS had a significant advantage in computational time and produced better solutions with the increase of problem sizes.

KW - cross-docking truck scheduling

KW - particle swarm optimization

KW - preemption

KW - tabu search

KW - unloading/loading constraint

UR - http://www.scopus.com/inward/record.url?scp=85048213805&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85048213805&origin=recordpage

U2 - 10.1109/ICNSC.2018.8361332

DO - 10.1109/ICNSC.2018.8361332

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781538650530

SN - 9781538650523

SN - 9781538650547

SP - 1

EP - 6

BT - ICNSC 2018 - The 15th IEEE International Conference on Networking, Sensing and Control

PB - IEEE

T2 - 15th IEEE International Conference on Networking, Sensing and Control (ICNSC 2018)

Y2 - 27 March 2018 through 29 March 2018

ER -

Optimizing Truck Scheduling in a Cross-docking System with Preemption and Unloading/loading Sequence Constraint

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this