Order picking problems under weight, fragility and category constraints

References

• Ackerman, K. B. 2013. Practical Handbook of Warehousing. New York: Springer Science & Business Media.
   Google Scholar
• Bortolini, M., M. Faccio, M. Gamberi, and R. Manzini. 2015. “Diagonal Cross-aisles in Unit Load Warehouses to Increase Handling Performance.” International Journal of Production Economics 170: 838–849.
   Web of Science ®Google Scholar
• Chabot, T., L. C. Coelho, and J. Renaud, J.-F. Côté. 2015. “Mathematical Models, Heuristic and Exact Method for Order Picking in 3d-narrow Aisles.” Technical Report CIRRELT-2015-18. Québec, Canada.
   Google Scholar
• Chackelson, C., A. Errasti, D. Ciprés, and F. Lahoz. 2013. “Evaluating Order Picking Performance Trade-offs by Configuring Main Operating Strategies in a Retail Distributor: A Design of Experiments Approach.” International Journal of Production Research 51 (20): 6097–6109.
   Web of Science ®Google Scholar
• Chiang, D. M.-H., C.-P. Lin, and M.-C. Chen. 2011. “The Adaptive Approach for Storage Assignment by Mining Data of Warehouse Management System for Distribution Centres.” Enterprise Information Systems 5 (2): 219–234.
   Web of Science ®Google Scholar
• Cordeau, J.-F., and G. Laporte. 2007. “The Dial-a-ride Problem: Models and Algorithms.” Annals of Operations Research 153 (1): 29–46.
   Web of Science ®Google Scholar
• de Koster, R., T. Le-Duc, and K. J. Roodbergen. 2007. “Design and Control of Warehouse Order Picking: A Literature Review.” European Journal of Operational Research 182 (2): 481–501.
   Web of Science ®Google Scholar
• de Koster, R., and E. Van der Poort. 1998. “Routing Orderpickers in a Warehouse: A Comparison between Optimal and Heuristic Solutions.” IIE Transactions 30 (5): 469–480.
   Web of Science ®Google Scholar
• de Koster, R., E. S. Van der Poort, and K. J. Roodbergen. 1998. “When to Apply Optimal or Heuristic Routing of Orderpickers.” In Advances in Distribution Logistics, edited by B. Fleischmann, J. A. E. E. Van Nunen, M. G. Speranza and P. Stähly, 375–401. Berlin: Springer.
   Google Scholar
• de Vries, J., R. de Koster , and D. Stam. 2016. “Exploring the Role of Picker Personality in Predicting Picking Performance with Pick by Voice, Pick to Light and RF-terminal Picking.” International Journal of Production Research, 54 (8): 2260–2274.
   Web of Science ®Google Scholar
• Dekker, R., M. B. M. De Koster, K. J. Roodbergen, and H. Van Kalleveen. 2004. “Improving Order-picking Response Time at Ankor’s Warehouse.” Interfaces 34 (4): 303–313.
   Web of Science ®Google Scholar
• Gu, J., M. Goetschalckx, and L. F. McGinnis. 2010. “Research on Warehouse Design and Performance Evaluation: A Comprehensive Review.” European Journal of Operational Research 203 (3): 539–549.
   Web of Science ®Google Scholar
• Hall, R. W. 1993. “Distance Approximations for Routing Manual Pickers in a Warehouse.” IIE Transactions 25 (4): 76–87.
   Web of Science ®Google Scholar
• Henn, S., S. Koch, and G. Wäscher. 2012. “Order Batching in Order Picking Warehouses: A Survey of Solution Approaches.” In Warehousing in the Global Supply Chain, edited by R. Manzini, 105–137. London: Springer.
   Google Scholar
• Hompel, M., and T. Schmidt. 2006. Warehouse Management: Automation and Organisation of Warehouse and Order Picking Systems. Berlin: Springer.
   Google Scholar
• Junqueira, L., R. Morabito, and D. S. Yamashita. 2012. “Three-dimensional Container Loading Models with Cargo Stability and Load Bearing Constraints.” Computers & Operations Research 39 (1): 74–85.
   Web of Science ®Google Scholar
• Lahyani, R., L. C. Coelho, and J. Renaud. 2015. “Alternative Formulations and Improved Bounds for the Multi-depot Fleet Size and Mix Vehicle Routing.” Technical Report CIRRELT-2015-36. Québec, Canada.
   Google Scholar
• Lahyani, R, F. Semet, and B. Trouillet. 2014. “Vehicle Routing Problems with Scheduling Constraints.” In Metaheuristics for Production Scheduling, 433–463. Croydon: Wiley Online Library.
   Google Scholar
• Laporte, G. 1986. “Generalized Subtour Elimination Constraints and Connectivity Constraints.” Journal of the Operational Research Society 37 (5): 509–514.
   Web of Science ®Google Scholar
• Lu, W., D. McFarlane, V. Giannikas, and Q. Zhang. 2016. “An Algorithm for Dynamic Order-picking in Warehouse Operations.” European Journal of Operational Research 248 (1): 107–122.
   Web of Science ®Google Scholar
• Lysgaard, J. 2003. CVRPSEP: A Package of Separation Routines for the Capacitated Vehicle Routing Problem. Aarhus School of Business, Denmark: Department of Management Science and Logistics.
   Google Scholar
• Manzini, R. 2012. Warehousing in the Global Supply Chain. London: Springer.
   Google Scholar
• Matusiak, M., R. de Koster, L. Kroon, and J. Saarinen. 2014. “A Fast Simulated Annealing Method for Batching Precedence-constrained Customer Orders in a Warehouse.” European Journal of Operational Research 236 (3): 968–977.
   Web of Science ®Google Scholar
• Medard, C. P., and N. Sawhney. 2007. “Airline Crew Scheduling from Planning to Operations.” European Journal of Operational Research 183 (3): 1013–1027.
   Web of Science ®Google Scholar
• Padberg, M. W., and G. Rinaldi. 1991. “A Branch-and-cut Algorithm for the Resolution of Large-scale Symmetric Traveling Salesman Problems.” SIAM Review 33 (1): 60–100.
   Web of Science ®Google Scholar
• Park, J., and B.-I. Kim. 2010. “The School Bus Routing Problem: A Review.” European Journal of Operational Research 202 (2): 311–319.
   Web of Science ®Google Scholar
• Pessoa, A., E. Uchoa, and M. V. S. Poggi de Aragão. 2009. “A Robust Branch-cut-and-price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem.” Networks 54 (4): 167–177.
   Web of Science ®Google Scholar
• Petersen, C. G. 1997. “An Evaluation of Order Picking Routeing Policies.” International Journal of Operations & Production Management 17 (11): 1098–1111.
   Web of Science ®Google Scholar
• Petersen, C. G., and G. R. Aase. 2004. “A Comparison of Picking, Storage, and Routing Policies in Manual Order Picking.” International Journal of Production Economics 92 (1): 11–19.
   Web of Science ®Google Scholar
• Petersen, C. G., G. R. Aase, and D. R. Heiser. 2004. “Improving Order-picking Performance through the Implementation of Class-based Storage.” International Journal of Physical Distribution & Logistics Management 34 (7): 534–544.
   Google Scholar
• Petersen, C. G., and R. W. Schmenner. 1999. “An Evaluation of Routing and Volume-based Storage Policies in an Order Picking Operation.” Decision Sciences 30 (2): 481–501.
   Web of Science ®Google Scholar
• Picard, J. C., and M. Queyranne. 1978. “The Time-dependent Traveling Salesman Problem and its Application to the Tardiness Problem in One-machine Scheduling.” Operations Research 26 (1): 86–110.
   Web of Science ®Google Scholar
• Poggi de Aragão, M. V. S., and E. Uchoa. 2014. “New Exact Algorithms for the Capacitated Cehicle Routing Problem.” In Vehicle Routing: Problems, edited by P. Toth and D. Vigo, 59–86., Methods, and Applications Philadelphia: MOS-SIAM Series on Optimization.
   Google Scholar
• 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.
   Web of Science ®Google Scholar
• Roodbergen, K. J., and R. de Koster. 2001. “Routing Order Pickers in a Warehouse with a Middle Aisle.” European Journal of Operational Research 133 (1): 32–43.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• Shaw, P. 1997. “A New Local Search Algorithm Providing High Quality Solutions to Vehicle Routing Problems.” Technical Report, Glasgow, Scotland, UK: APES Group, Dept of Computer Science, University of Strathclyde.
   Google Scholar
• Tompkins, J. A., J. A. White, Y. A. Bozer, and J. M. A. Tanchoco. 2010. Facilities Planning. New York: John Wiley & Sons.
   Google Scholar
• Toth, P., and D. Vigo. 2014. “The Family of Vehicle Routing Problem.” In Vehicle Routing: Problems, edited by P. Toth and D. Vigo, 1–23., Methods, and Applications Philadelphia: MOS-SIAM Series on Optimization.
   Google Scholar
• Wäscher, G. 2004. “Order Picking: A Survey of Planning Problems and Methods.” In Supply Chain Management and Reverse Logistics, edited by H. Dyckhoff, R. Lackes and J. Reese, 323–347. Berlin: Springer.
   Google Scholar
• Zachariadis, E. E., C. D. Tarantilis, and C. T. Kiranoudis. 2016. “The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-dimensional Loading Constraints.” European Journal of Operational Research 251 (2): 369–386.
   Web of Science ®Google Scholar