Partitioning orders in online shopping services

Conference Paper

The rapid growth of the Internet has led to the widespread use of newer and richer models of online shopping and delivery services. erace to efficient large scale on-demand delivery has transformed such services into complex networks of shoppers (typically working in the stores), stores, and consumers. The efficiency of processing orders in stores is critical to the profitability of the business model. Motivated by this se.ing, we consider the following problem: given a set of shopping orders each consisting of a few items, how to best partition the orders among a given number of shoppers working for an online shopping service? Formulating this as an optimization problem, we propose a family of simple and efficient algorithms that admit natural constraints such as number of items a shopper can process in this se.ing. In addition to showing provable guarantees for the algorithms, we also demonstrate their efficiency in practice on real-world data, outperforming strong baselines.

Full Text

Duke Authors

Cited Authors

  • Gollapudi, S; Kumar, R; Panigrahi, D; Panigrahy, R

Published Date

  • November 6, 2017

Published In

  • International Conference on Information and Knowledge Management, Proceedings

Volume / Issue

  • Part F131841 /

Start / End Page

  • 1319 - 1328

International Standard Book Number 13 (ISBN-13)

  • 9781450349185

Digital Object Identifier (DOI)

  • 10.1145/10.1145/3132847.3132903

Citation Source

  • Scopus