IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v51y2019i10p1128-1150.html
   My bibliography  Save this article

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

Author

Listed:
  • Xiangyong Li
  • Jieqi Li
  • Y.P. Aneja
  • Zhaoxia Guo
  • Peng Tian

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.

Suggested Citation

  • Xiangyong Li & Jieqi Li & Y.P. Aneja & Zhaoxia Guo & Peng Tian, 2019. "Integrated order allocation and order routing problem for e-order fulfillment," IISE Transactions, Taylor & Francis Journals, vol. 51(10), pages 1128-1150, October.
    • Handle: RePEc:taf:uiiexx:v:51:y:2019:i:10:p:1128-1150
    DOI: 10.1080/24725854.2018.1552820
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2018.1552820
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2018.1552820?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Jianbin & Zheng, Yuting & Dai, Bin & Yu, Jiang, 2020. "Implications of matching and pricing strategies for multiple-delivery-points service in a freight O2O platform," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:51:y:2019:i:10:p:1128-1150. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.