论文信息 - Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows

Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows

This paper presents the pessimistic time complexity analysis of the parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows. We show how to estimate the pessimistic complexity step by step. This approach can be easily adopted to other parallel algorithms for solving complex transportation problems.

Jakub Nalepa | Miroslaw Blocho

[1] Jakub Nalepa,et al. A Parallel Algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows , 2015, 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC).