Abstract
This paper studies an order fulfilment problem in an e-tailing environment, where the e-tailer fulfills orders by assigning orders to its fulfilment centers and routing the shipments from the fulfilment centers to its delivery stations. We develop a mixed integer program for the problem, analyze its computational complexity, and propose a Benders decomposition algorithm for solving the problem. Computational performance of the proposed algorithm is evaluated on problem instances generated based on the logistics network of JD.com in Shanghai. Computational results show that the Benders decomposition algorithm is able to achieve satisfactory performance within reasonable computation time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
