A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
The split delivery vehicle scheduling problem with time windows and grid network distances
Computers and Operations Research
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Transportation Science
IBM Journal of Research and Development
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
Traveling Salesman Problems with Profits
Transportation Science
IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Vehicle routing problem with elementary shortest path based column generation
Computers and Operations Research
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
Parallel machine scheduling through column generation: minimax objective functions
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Operations Research Letters
The combined manpower-vehicle routing problem for multi-staged services
Expert Systems with Applications: An International Journal
Ship routing and scheduling with cargo coupling and synchronization constraints
Computers and Industrial Engineering
An insertion heuristic manpower scheduling for in-flight catering service application
ICCL'12 Proceedings of the Third international conference on Computational Logistics
A genetic algorithm for the TOPdTW at operating rooms
ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.01 |
In this paper, we consider the manpower allocation problem with time windows, job-teaming constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks. Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an integer programming model for the problem, which is decomposed using Dantzig-Wolfe decomposition. The problem is solved by column generation in a branch-and-price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test instances. The main contribution of this article is the addition of synchronization between teams in an exact optimization context.