Integrated trucks assignment and scheduling problem with mixed service mode docks: A Q-learning based adaptive large neighborhood search algorithm

• Integrating dock mode, truck assignment, and scheduling improves operational efficiency • Unmanned warehouse operations benefit significantly from mixed service mode docks • Q-learning enhances operator selection efficiency in Adaptive Large Neighborhood Search • Optimal operators and selection mechanisms significantly improve algorithm performance Mixed service mode (MSM) docks enhance efficiency by flexibly handling both loading and unloading trucks in warehouses. However, existing research often predefines the number and location of MSM docks prior to planning truck assignment and sequencing. This predefined approach becomes less effective in high-demand systems and increases operational complexity, as warehouse operators must manually test various configurations. This paper addresses this challenge by proposing a new model that integrates dock mode decision, truck assignment, and scheduling, enabling more flexible dock mode arrangements. To solve the complex problem, we introduce a Q-learning-based adaptive large neighborhood search (Q-ALNS) algorithm, which adaptively adjusts dock modes through perturbation operators while simultaneously solving truck assignment and scheduling with destroy and repair operators. The Q-learning mechanism selects these operators based on their performance history and future gains, employing the epsilon-greedy strategy. Comprehensive experimental results and statistical analysis indicate that the Q-ALNS outperforms the benchmark in terms of optimality gap, with an average drop of 12.1%, while maintaining competitive computation efficiency. Compared to the predefined approach, our proposed adaptive strategy reduces tardiness by 22.5% and makespan by 7.6% on average, demonstrating its superiority in improving operational efficiency and supporting demand-driven assignment of MSM docks.

Authors

Institutions

Publication Details

Journal
European Journal of Operational Research
Published
2025-12-01
DOI
https://doi.org/10.1016/j.ejor.2025.12.036
Citations
1
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
1.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Integrated trucks assignment and scheduling problem with mixed service mode docks: A Q-learning based adaptive large neighborhood search algorithm

Willem van Jaarsveld, Yunxing Lan, Xiaodong Zhang, Yueyi Li et al.
1 citations
European Journal of Operational Research
Vehicle Routing Optimization Methods
1.24
article

Integrated trucks assignment and scheduling problem with mixed service mode docks: A Q-learning based adaptive large neighborhood search algorithm

Willem van Jaarsveld, Yunxing Lan, Xiaodong Zhang, Yueyi Li, Mehrdad Mohammadi
article en
1 citations

Abstract

• Integrating dock mode, truck assignment, and scheduling improves operational efficiency • Unmanned warehouse operations benefit significantly from mixed service mode docks • Q-learning enhances operator selection efficiency in Adaptive Large Neighborhood Search • Optimal operators and selection mechanisms significantly improve algorithm performance Mixed service mode (MSM) docks enhance efficiency by flexibly handling both loading and unloading trucks in warehouses. However, existing research often predefines the number and location of MSM docks prior to planning truck assignment and sequencing. This predefined approach becomes less effective in high-demand systems and increases operational complexity, as warehouse operators must manually test various configurations. This paper addresses this challenge by proposing a new model that integrates dock mode decision, truck assignment, and scheduling, enabling more flexible dock mode arrangements. To solve the complex problem, we introduce a Q-learning-based adaptive large neighborhood search (Q-ALNS) algorithm, which adaptively adjusts dock modes through perturbation operators while simultaneously solving truck assignment and scheduling with destroy and repair operators. The Q-learning mechanism selects these operators based on their performance history and future gains, employing the epsilon-greedy strategy. Comprehensive experimental results and statistical analysis indicate that the Q-ALNS outperforms the benchmark in terms of optimality gap, with an average drop of 12.1%, while maintaining competitive computation efficiency. Compared to the predefined approach, our proposed adaptive strategy reduces tardiness by 22.5% and makespan by 7.6% on average, demonstrating its superiority in improving operational efficiency and supporting demand-driven assignment of MSM docks.

European Journal of Operational Research
Beijing Jiaotong University (CN), Eindhoven University of Technology (NL)
Industry, innovation and infrastructure
Openalex Percentile: Top 13%
Vehicle Routing Optimization Methods
1.24
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.