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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2017-04
Hauptverfasser: Blocho, Miroslaw, Nalepa, Jakub
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Complexity
Ejection
Routing
Windows (intervals)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422