A tree-based tabu search algorithm for the manpower allocation problem with time windows and job-teaming constraints

Authors:
Yilin Cai;Zizhen Zhang;Songshan Guo;Hu Qin;Andrew Lim
Affiliations:
Department of Computer Science, Sun Yat-Sen University;Department of Management Sciences, City University of Hong Kong;Department of Computer Science, Sun Yat-Sen University;School of Management, Huazhong University of Science and Technology;Department of Management Sciences, City University of Hong Kong
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 8
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Tabu Search

Tabu Search
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Transportation Science
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach

Computers and Operations Research
Scheduling Algorithms

Scheduling Algorithms
A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP

Computers and Operations Research
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the manpower allocation problem with time windows and job-teaming constraints (MAPTWTC), a practical scheduling and routing problem that tries to synchronize workers' schedules to complete all tasks. We first provide an integer programming model for the problem and discuss its properties. Next, we show that tree data structure can be used to represent the MAPTWTC solutions, and its optimal solution can be obtained from one of trees by solving a minimum cost flow model for each worker type. Consequently, we develop for the problem a novel tabu search algorithm employing search operators based on the tree data structure. Finally, we prove the effectiveness of the tabu search algorithm by computational experiments on two sets of instances.