Robot scheduling for pod retrieval in a robotic mobile fulfillment system

Anghinolfi, 2011, A hybrid particle swarm optimization approach for the sequential ordering problem, Comput. Oper. Res., 38, 1076, 10.1016/j.cor.2010.10.014 Ascheuer, 1993, A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing), SIAM J. Optim., 3, 25, 10.1137/0803002 Azadeh, 2019, Robotized and automated warehouse systems: Review and recent developments, Transp. Sci., 53, 917, 10.1287/trsc.2018.0873 Balas, 1995, The precedence-constrained asymmetric traveling salesman polytope, Math. Program., 68, 241, 10.1007/BF01585767 Beckschäfer, 2017, Simulating storage policies for an automated grid-based warehouse system, 468 Bent, 2004, A two-stage hybrid local search for the vehicle routing problem with time windows, Transp. Sci., 38, 515, 10.1287/trsc.1030.0049 Bontoux, 2010, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Comput. Oper. Res., 37, 1844, 10.1016/j.cor.2009.05.004 Boysen, 2017, Parts-to-picker based order processing in a rack-moving mobile robots environment, European J. Oper. Res., 262, 550, 10.1016/j.ejor.2017.03.053 Boysen, 2019, Warehousing in the e-commerce era: A survey, European J. Oper. Res., 277, 396, 10.1016/j.ejor.2018.08.023 Boysen, 2016, The parallel stack loading problem to minimize blockages, European J. Oper. Res., 249, 618, 10.1016/j.ejor.2015.09.033 Boysen, 2016, A survey on single crane scheduling in automated storage/retrieval systems, European J. Oper. Res., 254, 691, 10.1016/j.ejor.2016.04.008 Bozer, 2018, A simulation-based comparison of two goods-to-person order picking systems in an online retail setting, Int. J. Prod. Res., 56, 3838, 10.1080/00207543.2018.1424364 Bruglieri, 2019, An adaptive large neighborhood search for relocating vehicles in electric carsharing services, Discrete Appl. Math., 253, 185, 10.1016/j.dam.2018.03.067 Bruns, 2016, Complexity results for storage loading problems with stacking constraints, European J. Oper. Res., 249, 1074, 10.1016/j.ejor.2015.09.036 Carpaneto, 1980, Some new branching and bounding criteria for the asymmetric travelling salesman problem, Manage Sci., 26, 736, 10.1287/mnsc.26.7.736 Cohen, L., Uras, T., Koenig, S., 2015. Feasibility study: Using highways for bounded-suboptimal multi-agent path finding. In: Eighth Annual Symposium on Combinatorial Search. De Koster, 2007, Design and control of warehouse order picking: A literature review, European J. Oper. Res., 182, 481, 10.1016/j.ejor.2006.07.009 De Koster, 1998, Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions, IIE Trans., 30, 469, 10.1080/07408179808966487 Del Ray, 2019 Enright, 2011, Optimization and coordinated autonomy in mobile fulfillment systems, 33 Escudero, 1988, An inexact algorithm for the sequential ordering problem, European J. Oper. Res., 37, 236, 10.1016/0377-2217(88)90333-5 Escudero, 1994, A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships, Ann. Oper. Res., 50, 219, 10.1007/BF02085641 Escudero, 1997, On due-date based valid cuts for the sequential ordering problem, Top, 5, 159, 10.1007/BF02568536 Eshtehadi, 2020, Solving the vehicle routing problem with multi-compartment vehicles for city logistics, Comput. Oper. Res., 115, 10.1016/j.cor.2019.104859 Fareeha, 2019 Fischetti, 1997, A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Oper. Res., 45, 378, 10.1287/opre.45.3.378 Fischetti, 1995, The symmetric generalized traveling salesman polytope, Networks, 26, 113, 10.1002/net.3230260206 Gagliardi, 2012, Models for automated storage and retrieval systems: a literature review, Int. J. Prod. Res., 50, 7110, 10.1080/00207543.2011.633234 Gambardella, 2000, An ant colony system hybridized with a new local search for the sequential ordering problem, INFORMS J. Comput., 12, 237, 10.1287/ijoc.12.3.237.12636 Garey, 1976, The complexity of flowshop and jobshop scheduling, Math. Oper. Res., 1, 117, 10.1287/moor.1.2.117 Gharehgozli, 2015, Scheduling twin yard cranes in a container block, Transp. Sci., 49, 686, 10.1287/trsc.2014.0533 Gharehgozli, 2016, Sea container terminals: New technologies and OR models, Maritime Econ. Logist., 18, 103, 10.1057/mel.2015.3 Gharehgozli, 2017, Polynomial time algorithms to minimize total travel time in a two-depot automated storage/retrieval system, Transp. Sci., 10.1287/trsc.2014.0562 Gharehgozli, 2020, High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system, European J. Oper. Res. Gharehgozli, 2019, Sequencing storage and retrieval requests in a container block with multiple open locations, Transp. Res. E, 125, 261, 10.1016/j.tre.2019.03.008 Gharehgozli, 2014, A decision-tree stacking heuristic minimising the expected number of reshuffles at a container terminal, Int. J. Prod. Res., 52, 2592, 10.1080/00207543.2013.861618 Gharehgozli, 2014, An exact method for scheduling a yard crane, European J. Oper. Res., 235, 431, 10.1016/j.ejor.2013.09.038 Gharehgozli, 2018, Stacking outbound barge containers in an automated deep-sea terminal, European J. Oper. Res., 267, 977, 10.1016/j.ejor.2017.12.040 Gharehgozli, 2019, Container terminal layout design: transition and future, Maritime Econ. Logist. Giannikas, 2017, An interventionist strategy for warehouse order picking: Evidence from two case studies, Int. J. Prod. Econ., 189, 63, 10.1016/j.ijpe.2017.04.002 Gonzalez, 2017 Gu, 2007, Research on warehouse operation: A comprehensive review, European J. Oper. Res., 177, 1, 10.1016/j.ejor.2006.02.025 Gu, 2010, Research on warehouse design and performance evaluation: A comprehensive review, European J. Oper. Res., 203, 539, 10.1016/j.ejor.2009.07.031 Gue, 2015, An approximation model for sojourn time distributions in acyclic multi-server queueing networks, Comput. Oper. Res., 63, 46, 10.1016/j.cor.2015.04.019 Guizzo, 2008, Three engineers, hundreds of robots, one warehouse – kiva systems wants to revolutionize distribution centers by setting swarms of robots loose on the inventory, IEEE Spectr., 45, 26, 10.1109/MSPEC.2008.4547508 Hall, 1993, Distance approximations for routing manual pickers in a warehouse, IIE Trans., 25, 76, 10.1080/07408179308964306 Hanson, 2018, Performance characteristics of robotic mobile fulfilment systems in order picking applications, IFAC-PapersOnLine, 51, 1493, 10.1016/j.ifacol.2018.08.290 Hornstra, 2020, The vehicle routing problem with simultaneous pickup and delivery and handling costs, Comput. Oper. Res., 115, 10.1016/j.cor.2019.104858 Iris, 2017, Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem, Transp. Res. E, 105, 123, 10.1016/j.tre.2017.06.013 Karapetyan, 2012, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, European J. Oper. Res., 219, 234, 10.1016/j.ejor.2012.01.011 Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 Kuhn, 1955, The Hungarian method for the assignment problem, Nav. Res. Logist. Q., 2, 83, 10.1002/nav.3800020109 Lamballais, 2017, Estimating performance in a robotic mobile fulfillment system, European J. Oper. Res., 256, 976, 10.1016/j.ejor.2016.06.063 Laporte, 1987, Generalized travelling salesman problem through n sets of nodes: the asymmetrical case, Discrete Appl. Math., 18, 185, 10.1016/0166-218X(87)90020-5 Lawler, 1985 Lee, 2019, Smart robotic mobile fulfillment system with dynamic conflict-free strategies considering cyber-physical integration, Adv. Eng. Inform., 42, 100998, 10.1016/j.aei.2019.100998 Lee, 1997, Sequencing methods for automated storage and retrieval systems with dedicated storage, Comput. Ind. Eng., 32, 351, 10.1016/S0360-8352(96)00298-7 Ma, 2017, Overview: A hierarchical framework for plan generation and execution in multirobot systems, IEEE Intell. Syst., 32, 6, 10.1109/MIS.2017.4531217 Ma, 2017, AI Buzzwords explained: Multi-agent path finding (MAPF), AI Matters, 3, 15, 10.1145/3137574.3137579 Mahulea, 2020 Mauri, 2016, An adaptive large neighborhood search for the discrete and continuous berth allocation problem, Comput. Oper. Res., 70, 140, 10.1016/j.cor.2016.01.002 Merschformann, 2019, Decision rules for robotic mobile fulfillment systems, Oper. Res. Perspect., 6, 100 Merschformann, 2018, RAWSim-O: A simulation framework for robotic mobile fulfillment systems, Logist. Res., 11, 1 Miller, 1991, Exact solution of large asymmetric traveling salesman problems, Science, 251, 754, 10.1126/science.251.4995.754 Montemanni, 2008, A heuristic manipulation technique for the sequential ordering problem, Comput. Oper. Res., 35, 3931, 10.1016/j.cor.2007.05.003 Mountz, M.C., Material handling system and method using mobile autonomous inventory trays and peer-to-peer communications, Google Patents, https://www.google.com/patents/US6950722 US Patent 6,950,722, 2005. Noon, 1991, A Lagrangian based approach for the asymmetric generalized traveling salesman problem, Oper. Res., 39, 623, 10.1287/opre.39.4.623 Ratliff, 1983, Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem, Oper. Res., 31, 507, 10.1287/opre.31.3.507 Roodbergen, 2001, Routing methods for warehouses with multiple cross aisles, Int. J. Prod. Res., 39, 1865, 10.1080/00207540110028128 Roodbergen, 2001, Routing order pickers in a warehouse with a middle aisle, European J. Oper. Res., 133, 32, 10.1016/S0377-2217(00)00177-6 Roodbergen, 2009, A survey of literature on automated storage and retrieval systems, European J. Oper. Res., 194, 343, 10.1016/j.ejor.2008.01.038 Ropke, 2006, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transp. Sci., 40, 455, 10.1287/trsc.1050.0135 Ropke, 2006, A unified heuristic for a large class of vehicle routing problems with backhauls, European J. Oper. Res., 171, 750, 10.1016/j.ejor.2004.09.004 Roy, 2019, Robot-storage zone assignment strategies in mobile fulfillment systems, Transp. Res. E, 122, 119, 10.1016/j.tre.2018.11.005 Sarasola, 2020, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, Networks, 75, 64, 10.1002/net.21905 Seo, 2003, A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem, 669 Shao, 2020, Variable neighborhood search and tabu search for auction-based waste collection synchronization, Transp. Res. B, 133, 1, 10.1016/j.trb.2019.12.004 Shaw, 1997 Snyder, 2006, A random-key genetic algorithm for the generalized traveling salesman problem, European J. Oper. Res., 174, 38, 10.1016/j.ejor.2004.09.057 Spieckermann, 2004, A sequential ordering problem in automotive paint shops, Int. J. Prod. Res., 42, 1865, 10.1080/00207540310001646821 Sun, 2020, Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows, Transp. Res. E, 138, 10.1016/j.tre.2020.101942 Tessensohn, 2020, Inventory allocation in robotic mobile fulfillment systems, IISE Trans., 52, 1, 10.1080/24725854.2018.1560517 Tompkins, 2003 Van den Berg, 1999, Optimal routing in an automated storage/retrieval system with dedicated storage, IIE Trans., 31, 407, 10.1080/07408179908969844 Van Gils, 2018, Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions, Int. J. Prod. Econ., 197, 243, 10.1016/j.ijpe.2017.11.021 Van Gils, 2018, Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review, European J. Oper. Res., 267, 1, 10.1016/j.ejor.2017.09.002 Vaughan, 1999, The effect of warehouse cross aisles on order picking efficiency, Int. J. Prod. Res., 37, 881, 10.1080/002075499191580 Vis, 2009, Scheduling of container storage and retrieval, Oper. Res., 57, 456, 10.1287/opre.1080.0621 Wen, 2016, An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem, Comput. Oper. Res., 76, 73, 10.1016/j.cor.2016.06.013 Wurman, 2008, Coordinating hundreds of cooperative, autonomous vehicles in warehouses, AI Mag., 29, 9 Yu, 2015, Intractability of optimal multirobot path planning on planar graphs, IEEE Robot. Autom. Lett., 1, 33, 10.1109/LRA.2015.2503143 Yuan, 2018, Stowage decisions in multi-zone storage systems, Int. J. Prod. Res., 56, 333, 10.1080/00207543.2017.1398428 Zaerpour, 2019, Vertical expansion: A solution for future container terminals, Transp. Sci., 53, 1235, 10.1287/trsc.2018.0884 Zaerpour, 2013, Storage policies and optimal shape of a storage system, Int. J. Prod. Res., 51, 6891, 10.1080/00207543.2013.774502 Zaerpour, 2019, Automated or manual storage systems: do throughput and storage capacity matter?, INFOR: Inform. Syst. Oper. Res., 57, 99 Zaerpour, 2015, Storing fresh produce for fast retrieval in an automated compact cross-dock system, Prod. Oper. Manage., 24, 1266, 10.1111/poms.12321 Zaerpour, 2017, Small is beautiful: A framework for evaluating and optimizing live-cube compact storage systems, Transp. Sci., 51, 34, 10.1287/trsc.2015.0586 Zaerpour, 2017, Response time analysis of a live-cube compact storage system with two storage classes, IISE Trans., 49, 461, 10.1080/24725854.2016.1273563 Zaerpour, 2017, Optimal two-class-based storage in a live-cube compact storage system, IISE Trans., 49, 653, 10.1080/24725854.2016.1273564 Zhang, 2020, A novel mathematical model and a large neighborhood search algorithm for container drayage operations with multi-resource constraints, Comput. Ind. Eng., 139, 10.1016/j.cie.2019.106143 Zou, 2017, Assignment rules in robotic mobile fulfilment systems for online retailers, Int. J. Prod. Res., 55, 6175, 10.1080/00207543.2017.1331050 Zou, 2018, Operating policies in robotic compact storage and retrieval systems, Transp. Sci., 10.1287/trsc.2017.0786 Zou, 2018, Evaluating battery charging and swapping strategies in a robotic mobile fulfillment system, European J. Oper. Res., 267, 733, 10.1016/j.ejor.2017.12.008