Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders
type: Item
instance of: scholarly article
title: Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders
zbMATH Open document ID: 1487.90201
author: Shan Zhu
author: Xiangpei Hu
author: Kai Huang
author: Yufei Yuan
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7354612
zbMATH Keywords: logistics
zbMATH Keywords: e-commerce order fulfillment
zbMATH Keywords: order splitting
zbMATH Keywords: warehouse products distribution
zbMATH Keywords: heuristic clustering algorithm
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.08.024
OpenAlex ID: W3067243057
cites work: Online retailers' promotional pricing, free-shipping threshold, and inventory decisions: a simulation-based analysis
cites work: Clustering data that are graph connected
cites work: Warehousing in the e-commerce era: a survey
cites work: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
cites work: Variable neighborhood search for minimum sum-of-squares clustering on networks
cites work: Approximation algorithms for maximization problems arising in graph partitioning
cites work: A clustering algorithm for item assignment in a synchronized zone order picking system
cites work: An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment
cites work: Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
cites work: The value of postponing online fulfillment decisions in multi-channel retail/e-tail organizations
cites work: Formalizing and solving the problem of clustering in MCDA
cites work: Variable neighborhood search
cites work: Dominant-set clustering: a review
cites work: A model for clustering data from heterogeneous dissimilarities
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
DOI: 10.1016/J.EJOR.2020.08.024
description: scientific article; zbMATH DE number 7354612