761
Views
13
CrossRef citations to date
0
Altmetric
Articles

Order fulfilment problem with time windows and synchronisation arising in the online retailing

& ORCID Icon
Pages 1187-1215 | Received 05 May 2019, Accepted 19 Jan 2020, Published online: 06 Feb 2020

References

  • Acimovic, J., and S. C. Graves. 2015. “Making Better Fulfillment Decisions on the Fly in An Online Retail Environment.” Manufacturing & Service Operations Management 17 (1): 34–51.
  • Ahmadi, G., S. A. Torabi, and R. Tavakkoli-Moghaddam. 2016. “A Bi-Objective Location-Inventory Model with Capacitated Transportation and Lateral Transshipments.” International Journal of Production Research 54 (7): 2035–2056.
  • Anderluh, A., V. C. Hemmelmayr, and P. Nolz. 2017. “Synchronizing Vans and Cargo Bikes in a City Distribution Network.” Central European Journal of Operations Research 25 (2): 345–376.
  • Baldacci, R., A. Mingozzi, R. Roberti, and R. W. Calvo. 2013. “An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem.” Operations Research 61 (2): 298–314.
  • Belo-Filho, M., P. Amorim, and B. Almada-Lobo. 2015. “An Adaptive Large Neighbourhood Search for the Operational Integrated Production and Distribution Problem of Perishable Products.” International Journal of Production Research 53 (20): 6040–6058.
  • Breunig, U., V. Schmid, R. F. Hartl, and T. Vidal. 2016. “A Large Neighbourhood Based Heuristic for Two-Echelon Routing Problems.” Computers & Operations Research 76: 208–225.
  • Catalán, A., and M. Fisher. 2012. “Assortment Allocation to Distribution Centers to Minimize Split Customer Orders.” SSRN Electronic Journal. doi:10.2139/ssrn.2166687.
  • Cleophas, C., and J. F. Ehmke. 2014. “When are Deliveries Profitable?” Business & Information Systems Engineering 6 (3): 153–163.
  • Crainic, T. G., S. Mancini, G. Perboli, and R. Tadei. 2008. Clustering-Based Heuristics for the Two- Echelon Vehicle Routing Problem. Technical Report: CIRRELT-2008-46.
  • Crainic, T. G., S. Mancini, G. Perboli, and R. Tadei. 2011. “Multi-Start Heuristics for the Two-Echelon Vehicle Routing Problem.” In European Conference on Evolutionary Computation in Combinatorial Optimization, 179–190. Berlin: Springer.
  • Crainic, T. G., S. Mancini, G. Perboli, and R. Tadei. 2012. “Impact of Generalized Travel Costs on Satellite Location in the Two-Echelon Vehicle Routing Problem.” Procedia – Social and Behavioral Sciences 39: 195–204.
  • Crainic, T. G., S. Mancini, G. Perboli, and R. Tadei. 2013. “GRASP With Path Relinking for the Two-Echelon Vehicle Routing Problem.” In Advances in Metaheuristics, 113–125. New York: Springer.
  • Crainic, T. G., G. Perboli, S. Mancini, and R. Tadei. 2010. “Two-Echelon Vehicle Routing Problem: A Satellite Location Analysis.” Procedia-Social and Behavioral Sciences 2 (3): 5944–5955.
  • Crainic, T. G., N. Ricciardi, and G. Storchi. 2009. “Models for Evaluating and Planning City Logistics Systems.” Transportation Science 43 (4): 432–454.
  • Crainic, T. G., and A. Sgalambro. 2014. “Service Network Design Models for Two-Tier City Logistics.” Optimization Letters 8 (4): 1375–1387.
  • Cuda, R., G. Guastaroba, and M. G. Speranza. 2015. “A Survey on Two-Echelon Routing Problems.” Computers & Operations Research 55: 185–199.
  • Drexl, M. 2012. “Synchronization in Vehicle Routing – A Survey of VRPs with Multiple Synchronization Constraints.” Transportation Science 46 (3): 297–316.
  • Dullaert, W., and O. Bräysy. 2003. “Routing Relatively Few Customers Per Route.” TOP 11 (2): 325–336.
  • Grangier, P., M. Gendreau, F. Lehuédé, and L. M. Rousseau. 2016. “An Adaptive Large Neighborhood Search for the Two-Echelon Multiple-Trip Vehicle Routing Problem with Satellite Synchronization.” European Journal of Operational Research 254 (1): 80–91.
  • Hemmelmayr, V. C., J. F. Cordeau, and T. G. Crainic. 2012. “An Adaptive Large Neighborhood Search Heuristic for Two-Echelon Vehicle Routing Problems Arising in City Logistics.” Computers & Operations Research 39 (12): 3215–3228.
  • Jasin, S., and A. Sinha. 2015. “An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment.” Operations Research 63 (6): 1336–1351.
  • JD.com. 2017. “2016 Annual Report.” Accessed February 17, 2017. http://ir.jd.com/phoenix.zhtml?c=253315&p=irol-newsArticle&ID=2247039
  • JD.com. 2018. “2017 Annual Report.” Accessed March 2, 2018. http://ir.jd.com/phoenix.zhtml?c=253315&p=irol-newsarticle&id=2335867.
  • Jepsen, M., S. Spoorendonk, and S. Ropke. 2013. “A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem.” Transportation Science 47 (1): 23–37.
  • Jiang, L., M. Dhiaf, J. F. Dong, C. Y. Liang, and S. P. Zhao. 2019. “A Traveling Salesman Problem With Time Windows for the Last Mile Delivery in Online Shopping.” International Journal of Production Research. doi:10.1080/00207543.2019.1656842.
  • Jie, W. C., J. Yang, M. Zhang, and Y. X. Huang. 2019. “The Two-Echelon Capacitated Electric Vehicle Routing Problem with Battery Swapping Stations: Formulation and Efficient Methodology.” European Journal of Operational Research 272 (3): 879–904.
  • Lahyani, R., A. L. Gouguenheim, and L. C. Coelho. 2019. “A Hybrid Adaptive Large Neighbourhood Search for Multi-Depot Open Vehicle Routing Problems.” International Journal of Production Research 57 (22): 6963–6976.
  • Leung, K., K. L. Choy, P. K. Siu, G. T. Ho, H. Lam, and C. K. Lee. 2018. “A B2C E-Commerce Intelligent System for Re-Engineering the E-order Fulfilment Process.” Expert Systems with Applications 91: 386–401.
  • Li, X. Y., J. Q. Li, Y. P. Aneja, Z. X. Guo, and P. Tian. 2019. “Integrated Order Allocation and Order Routing Problem for E-Order Fulfillment.” IISE Transactions 51 (10): 1128–1150.
  • Liu, T., Z. X. Luo, H. Qin, and A. Lim. 2018. “A Branch-and-Cut Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem with Grouping Constraints.” European Journal of Operational Research 266 (2): 487–497.
  • López-Ibáñez, M., L. P. Cáceres, J. Dubois-Lacoste, T. Stützle, and M. Birattari. 2016a. The Irace Package: User Guide. Technical Report. IRIDIA, Université Libre de Bruxelles, Belgium, TR/IRIDIA/2016-004.
  • López-Ibáñez, M., J. Dubois-Lacoste, L. P. Cáceres, M. Birattari, and T. Stützle. 2016b. “The Irace Package: Iterated Racing for Automatic Algorithm Configuration.” Operations Research Perspectives 3: 43–58.
  • Moons, S., K. Braekers, K. Ramaekers, A. Caris, and Y. Arda. 2019. “The Value of Integrating Order Picking and Vehicle Routing Decisions in a B2C E-Commerce Environment.” International Journal of Production Research 57 (20): 6405–6423.
  • Nasiri, M. M., A. Rahbari, F. Werner, and R. Karimi. 2018. “Incorporating Supplier Selection and Order Allocation Into the Vehicle Routing and Multi-Cross-Dock Scheduling Problem.” International Journal of Production Research 56 (19): 6527–6552.
  • Perboli, G., and M. Rosano. 2016. “A Decision Support System for Optimizing the Last-Mile by Mixing Traditional and Green Logistics.” In International Conference on Information Systems, Logistics and Supply Chain, 28–46. Cham, Springer.
  • Perboli, G., M. Rosano, M. Saint-Guillain, and P. Rizzo. 2018. “Simulation-Optimisation Framework for City Logistics: An Application on Multimodal Last-Mile Delivery.” IET Intelligent Transport Systems12 (4): 262–269.
  • Perboli, G., R. Tadei, and D. Vigo. 2011. “The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics.” Transportation Science 45 (3): 364–380.
  • Pisinger, D., and S. Ropke. 2007. “A General Heuristic for Vehicle Routing Problems.” Computers & Operations Research 34 (8): 2403–2435.
  • Potvin, J. Y., and J. M. Rousseau. 1993. “A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows.” European Journal of Operational Research 66 (3): 331–340.
  • Ropke, S., and D. Pisinger. 2006. “An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.” Transportation Science 40 (4): 455–472.
  • Schrotenboer, A. H., S. Wruck, K. J. Roodbergen, M. Veenstra, and A. S. Dijkstra. 2017. “Order Picker Routing with Product Returns and Interaction Delays.” International Journal of Production Research55 (21): 6394–6406.
  • Shaw, P. 1998. “Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems.” In International Conference on Principles and Practice of Constraint Programming, 417–431. Berlin, Springer.
  • Solomon, M. 1987. “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints.” Operations Research 35 (2): 254–265.
  • Torabi, S., E. Hassini, and M. Jeihoonian. 2015. “Fulfillment Source Allocation, Inventory Transshipment, and Customer Order Transfer in E-Tailing.” Transportation Research Part E: Logistics and Transportation Review 79: 128–144.
  • Varon, L., F. Swerdlow, S. Meena, S. Wu, X. F. Wang, and M. Cain. 2017. “ECommerce Trends and Outlook for Asia Pacific.” Accessed May 10, 2018. https://www.forrester.com/report/eCommerce+Trends+And+Outlook+For+Asia+Pacific/-/E-RES131984
  • Wang, J., H. M. Miao, and M. Z. Yu. 2019. “Interdependent Order Allocation in the Two-Echelon Competitive and Cooperative Supply Chain.” International Journal of Production Research 57 (4): 1190–1213.
  • Xu, P. J., R. Allgor, and S. C. Graves. 2009. “Benefits of Reevaluating Real-Time Order Fulfillment Decisions.” Manufacturing & Service Operations Management 11 (2): 340–355.
  • Zhang, Y. K., M. F. Huang, X. P. Hu, and L. J. Sun. 2018. “Package Consolidation Approach to the Split-Order Fulfillment Problem of Online Supermarkets.” Journal of the Operational Research Society 69 (1): 127–141.
  • Zhang, J., X. P. Wang, and K. Huang. 2016. “Integrated Online Scheduling of Order Batching and Delivery Under B2C E-Commerce.” Computers & Industrial Engineering 94: 280–289.
  • Zhou, L., R. Baldacci, D. Vigo, and X. Wang. 2018. “A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution.” European Journal of Operational Research 265 (2): 765–778.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.