Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows
classification
💻 cs.DS
cs.DC
keywords
complexityparalleltimeanalysisdeliverypessimisticpickupproblem
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.