{"title":"面对个人购物者的困境:时间vs成本","authors":"Samiul Anwar, Francesco Lettich, M. Nascimento","doi":"10.1145/3397536.3422276","DOIUrl":null,"url":null,"abstract":"Consider a customer who has a shopping list and a personal shopper who is willing to buy and resell goods in a customer's shopping list. It is in the personal shopper's best interest to find shopping routes that minimize two competing criteria: the time needed to serve a customer and the price paid for the goods. In this short paper we present an efficient solution to this problem based on finding an approximate linear skyline set of such shopping routes. (An extended version of this paper can be found at [1]).","PeriodicalId":233918,"journal":{"name":"Proceedings of the 28th International Conference on Advances in Geographic Information Systems","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards A Personal Shopper's Dilemma: Time vs Cost\",\"authors\":\"Samiul Anwar, Francesco Lettich, M. Nascimento\",\"doi\":\"10.1145/3397536.3422276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consider a customer who has a shopping list and a personal shopper who is willing to buy and resell goods in a customer's shopping list. It is in the personal shopper's best interest to find shopping routes that minimize two competing criteria: the time needed to serve a customer and the price paid for the goods. In this short paper we present an efficient solution to this problem based on finding an approximate linear skyline set of such shopping routes. (An extended version of this paper can be found at [1]).\",\"PeriodicalId\":233918,\"journal\":{\"name\":\"Proceedings of the 28th International Conference on Advances in Geographic Information Systems\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 28th International Conference on Advances in Geographic Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3397536.3422276\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3397536.3422276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Towards A Personal Shopper's Dilemma: Time vs Cost
Consider a customer who has a shopping list and a personal shopper who is willing to buy and resell goods in a customer's shopping list. It is in the personal shopper's best interest to find shopping routes that minimize two competing criteria: the time needed to serve a customer and the price paid for the goods. In this short paper we present an efficient solution to this problem based on finding an approximate linear skyline set of such shopping routes. (An extended version of this paper can be found at [1]).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
