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]).
Towards A Personal Shopper's Dilemma: Time vs Cost
Lettich, Francesco;
2020-01-01
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]).
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
3397536.3422276.pdf
non disponibili
Tipologia:
Versione dell'editore
Licenza:
Accesso chiuso-personale
Dimensione
512.57 kB
Formato
Adobe PDF
|
512.57 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
