Privacy-Friendly Delivery Plan Recommender
International Conference on eDemocracy & eGovernment(2021)
摘要
When planning the distribution of parcels, postal services often face different problems. One of them is delivering a parcel to a customer's home while making sure the customer is there to receive it. Undeniably, a successful first-try delivery minimizes monetary costs and is less resource-consuming. The goal of this project is to recommend delivery plans to postal services, in order to achieve a better success rate for home deliveries on the first try. A dataset of three years of deliveries of a postal company located in Switzerland is analyzed, to create appropriate features for classifying customers based on their past deliveries. The K-Means algorithm is applied to achieve this classification. By only using anonymized information about the customers' past deliveries, which is information already owned by postal services, it avoids invading the data privacy of these customers while still providing a viable solution.
更多查看译文
关键词
Recommender system,clustering,k-means,delivery plan,last-mile delivery,home delivery
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要