2000 character limit reached
Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows (1704.06724v1)
Published 21 Apr 2017 in cs.DS and cs.DC
Abstract: 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.
Collections
Sign up for free to add this paper to a collection.