Integrated order allocation and order routing problem for e-order fulfillment

Xiangyong Li, Jieqi Li, Y.P. Aneja, Zhaoxia Guo and Peng Tian

IISE Transactions, 2019, vol. 51, issue 10, 1128-1150

Abstract: In this article, we study the order fulfillment problem, which integrates order allocation and order routing decisions of an online retailer. Our problem is to find the best way to fulfill each customer’s order to minimize the transportation cost. We first present a mixed-integer programming formulation to help online retailers optimally fulfill customers’ order. We then introduce an adaptive large neighborhood search-based approach for this problem. With extensive computational experiments, we demonstrate the effectiveness of the proposed approach, by benchmarking its performance against a leading commercial solver and a greedy heuristic. Our approach can produce high-quality solutions in short computing times. We also experimentally show that products overlap among different fulfillment centers does affect the operation expense of e-tailers.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/24725854.2018.1552820 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:51:y:2019:i:10:p:1128-1150

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/24725854.2018.1552820

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().