Online Large-scale Garbage Collection Scheduling: A Divide-and-conquer Approach

Online garbage collection scheduling is demanding for large cities to reduce the increasing operational costs. However, the garbage collection problem is NP-complete, making the problem intractable when the number of garbage sites is large. In this paper, we first intensively investigate the garbage...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings - International Conference on Parallel and Distributed Systems S. 395 - 402
Hauptverfasser:	Bian, Yixiang, Zhu, Hongzi, Lou, Ziyang
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.01.2023
Schlagworte:	agglomerative hierarchical clustering algorithm capacitated vehicle routing problem Clustering algorithms Complexity theory Costs Indexes Large-scale garbage collection problem Scheduling Urban areas Vehicle routing
ISSN:	2690-5965
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!