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

Full description

Bibliographic Details

Published in:	Proceedings - International Conference on Parallel and Distributed Systems pp. 395 - 402
Main Authors:	Bian, Yixiang, Zhu, Hongzi, Lou, Ziyang
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.01.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!