A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems

References

• Ascheuer N, Grötschel M, Abdel-Hamid AAA (1999) Order picking in an automatic warehouse: Solving online asymmetric TSPs. Math. Methods Oper. Res. 49(3):501–515.Crossref, Google Scholar
• Azadeh K, De Koster R, Roy D (2019) Robotized and automated warehouse systems: Review and recent developments. Transportation Sci. 53(4):917–945.Link, Google Scholar
• Bektas T (2006) The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega Internat. J. Management Sci. 34(3):209–219.Crossref, Google Scholar
• Bellmore M, Hong S (1974) Transformation of multisalesmen problem to the standard traveling salesman problem. J. ACM 21(3):500–504.Crossref, Google Scholar
• Boysen N, Stephan K (2016) A survey on single crane scheduling in automated storage/retrieval systems. Eur. J. Oper. Res. 254(3):691–704.Crossref, Google Scholar
• Boysen N, De Koster R, Weidinger F (2019) Warehousing in the e-commerce era: A survey. Eur. J. Oper. Res. 277(2):396–411.Crossref, Google Scholar
• Bozer YA, Aldarondo FJ (2018) A simulation-based comparison of two goods-to-person order picking systems in an online retail setting. Internat. J. Production Res. 56(11):3838–3858.Crossref, Google Scholar
• Bozer YA, White JA (1984) Travel-time models for automated storage/retrieval systems. IIE Trans. 16(4):329–338.Crossref, Google Scholar
• Bozer YA, White JA (1990) Design and performance models for end-of-aisle order picking systems. Management Sci. 36(7):852–866.Link, Google Scholar
• Bozer YA, White JA (1996) A generalized design and performance analysis model for end-of-aisle order-picking systems. IIE Trans. 28(4):271–280.Crossref, Google Scholar
• Butler S (2013) Marks & Spencer opens automated warehouse for online sales. The Guardian Online (May 8), http://www.guardian.co.uk/business/2013/may/08/marks-spencer-online-warehouse.Google Scholar
• Cardona LF, Gue KR (2020) Layouts of unit-load warehouses with multiple slot heights. Transportation Sci. 54(5):1332–1350.Link, Google Scholar
• Carlo HJ, Giraldo GE (2012) Toward perpetually organized unit-load warehouses. Comput. Indust. Engrg. 64(4):1003–1012.Crossref, Google Scholar
• Carter AE, Ragsdale CT (2006) A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur. J. Oper. Res. 175(1):246–257.Crossref, Google Scholar
• Chen L, Langevin A, Riopel D (2011) A tabu search algorithm for the relocation problem in a warehousing system. Internat. J. Production Econom. 129(1):147–156.Crossref, Google Scholar
• Dooly DR, Lee HF (2008) A shift-based sequencing method for twin-shuttle automated storage and retrieval systems. IIE Trans. 40(6):586–594.Crossref, Google Scholar
• Eglese RW (1990) Simulated annealing: A tool for operational research. Eur. J. Oper. Res. 46(3):271–281.Crossref, Google Scholar
• Foley RD, Hackman ST, Park BC (2004) Back-of-the-envelope miniload throughput bounds and approximations. IIE Trans. 36(3):279–285.Crossref, Google Scholar
• Frederickson G, Hecht M, Kim C (1978) Approximation algorithms for some routing problems. SIAM J. Comput. 7(2):178–193.Crossref, Google Scholar
• Gagliardi JP, Renaud J, Ruiz A (2012) Models for automated storage and retrieval systems: A literature review. Internat. J. Production Res. 50(24):7110–7125.Crossref, Google Scholar
• Galle V, Barnhart C, Jaillet P (2018) Yard crane scheduling for container storage, retrieval, and relocation. Eur. J. Oper. Res. 271(1):288–316.Crossref, Google Scholar
• Gavish B, Srikanth K (1986) An optimal solution method for large-scale multiple traveling salesmen problems. Oper. Res. 35(4):698–717.Link, Google Scholar
• Ghafurian S, Javadian N (2011) An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems. Appl. Soft Comput. 11(1):1256–1262.Crossref, Google Scholar
• Gharehgozli AH, Yu Y, Zhang X, De Koster R (2017) Polynomial time algorithms to minimize total travel time in a two-depot automated storage/retrieval system. Transportation Sci. 51(1):19–33.Link, Google Scholar
• Golden BL, Laporte G, Taillard ED (1997) An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput. Oper. Res. 24(5):445–452.Crossref, Google Scholar
• Gromicho J, Paixão J, Branco I (1992) Exact solution of multiple traveling salesman problems. Akgül M, Hamacher H, Tüfekçi S, eds. Combinatorial Optimization, NATO ASI Series (Springer, Berlin), 291–292.Crossref, Google Scholar
• Gu J, Goetschalckx M, McGinnis LF (2007) Research on warehouse operation: A comprehensive review. Eur. J. Oper. Res. 177(1):1–21.Crossref, Google Scholar
• Gue KR, Furmans K, Seibold Z, Uludag O (2014) Gridstore: A puzzle-based storage system with decentralized control. IEEE Trans. Automation Sci. Engrg. 11(2):429–438.Crossref, Google Scholar
• Han MH, McGinnis LF, Shieh JS, White JA (1987) On sequencing retrievals in an automated storage/retrieval system. IIE Trans. 19(1):56–66.Crossref, Google Scholar
• Hsu CY, Tsai MH, Chen WM (1991) A study of feature-mapped approach to the multiple travelling salesmen problem. IEEE Internat. Sympos. Circuits Systems, 1589–1592.Google Scholar
• Jaghbeer Y, Hanson R, Johansson MI (2020) Automated order picking systems and the links between design and performance: A systematic literature review. Internat. J. Production Res. 58(15):4489–4505.Crossref, Google Scholar
• Johnson DS, McGeoch LA (1997) The traveling salesman problem: A case study in local optimization. Aarts E, Lenstra JK, eds. Local Search in Combinatorial Optimization (John Wiley & Sons, London), 215–310.Google Scholar
• Kara I, Bektas T (2006) Integer linear programming formulations of multiple salesman problems and its variations. Eur. J. Oper. Res. 174(3):1449–1458.Crossref, Google Scholar
• Laporte G (1992) The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2):231–247.Crossref, Google Scholar
• Laporte G, Norbert Y (1980) A cutting plane algorithm for the m-salesmen problem. J. Oper. Res. Soc. 31(11):1017–1023.Crossref, Google Scholar
• Larki H, Yousefikhoshbakht M (2014) Solving the multiple traveling salesman problem by a novel meta-heuristic algorithm. J. Optim. Indust. Engrg. 7(16):55–63.Google Scholar
• Lee HF, Schaefer SK (1997) Sequencing methods for automated storage and retrieval systems with dedicated storage. Comput. Indust. Engrg. 32(2):351–362.Crossref, Google Scholar
• Liu W, Li S, Zhao F, Zheng A (2009) An ant colony optimization algorithm for the multiple traveling salesmen problem. Fourth IEEE Conf. Indust. Electronics Appl., 1533–1537.Google Scholar
• Mahajan S, Rao BV, Peters BA (1998) A retrieval sequencing heuristic for miniload end-of-aisle automated storage/retrieval systems. Internat. J. Production Res. 36(6):1715–1731.Crossref, Google Scholar
• Man X, Zheng F, Chu F, Liu M, Xu Y (2021) Bi-objective optimization for a two-depot automated storage/retrieval system. Ann. Oper. Res. 296(1):243–262.Crossref, Google Scholar
• Mirzaei M, De Koster RBM, Zaerpour N (2017) Modelling load retrievals in puzzle-based storage systems. Internat. J. Production Res. 55(21):6423–6435.Crossref, Google Scholar
• Modares A, Somhom S, Enkawa T (1999) A self organizing neural network approach for multiple traveling salesman and vehicle routing problems. Internat. Trans. Oper. Res. 6(6):591–606.Crossref, Google Scholar
• Nia AR, Haleh H, Saghaei A (2017) Dual command cycle dynamic sequencing method to consider GHG efficiency in unit-load multiple-rack automated storage and retrieval systems. Comput. Indust. Engrg. 111:89–108.Crossref, Google Scholar
• Park BC, Foley RD, Frazelle EH (2006) Performance of miniload systems with two-class storage. Eur. J. Oper. Res. 170(1):144–155.Crossref, Google Scholar
• Park BC, Frazelle EH, White JA (1999) Buffer sizing models for end-of-aisle order picking systems. IIE Trans. 31(1):31–38.Crossref, Google Scholar
• Park BC, Foley RD, White JA, Frazelle EH (2003) Dual command travel times and miniload system throughput with turnover-based storage. IIE Trans. 35(4):343–355.Crossref, Google Scholar
• Popović D, Vidović M, Bjelić N (2014) Application of genetic algorithms for sequencing of AS/RS with a triple-shuttle module in class-based storage. Flexible Services Manufacturing J. 26(3):432–453.Crossref, Google Scholar
• Potvin JY, Lapalme G, Rousseau JM (1989) A generalized k-opt exchange procedure for the MTSP. Inform. Systems Oper. Res. 27(4):474–481.Crossref, Google Scholar
• Roodbergen KJ, Vis IFA (2009) A survey of literature on automated storage and retrieval systems. Eur. J. Oper. Res. 194(2):343–362.Crossref, Google Scholar
• Rostami AS, Mohanna F, Keshavarz H, Hosseinabadi AAR (2015) Solving multiple traveling salesman problem using the gravitational emulation local search algorithm. Appl. Math. Inform. Sci. 9(2):699–709.Google Scholar
• Russell RA (1977) Technical note—An effective heuristic for the m-tour traveling salesman problem with some side conditions. Oper. Res. 25(2):517–524.Link, Google Scholar
• Sarin SC, Sherali HD, Judd JD, Tsai PFJ (2014) Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations. Comput. Oper. Res. 51:64–89.Crossref, Google Scholar
• Sedighpour M, Yousefikhoshbakht M (2012) An effective genetic algorithm for solving the multiple traveling salesman problem. J. Optim. Indust. Engrg. 8(1):73–79.Google Scholar
• Singh A, Baghel AS (2009) A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput. 13(1):95–101.Crossref, Google Scholar
• Somhom S, Modares A, Enkawa T (1999) Competition-based neural network for the multiple travelling salesmen problem with minmax objective. Comput. Oper. Res. 26(4):395–407.Crossref, Google Scholar
• Song CH, Lee K, Lee WD (2003) Extended simulated annealing for augmented TSP and multi-salesmen TSP. Proc. Internat. Joint Conf. Neural Networks, vol. 3, 2340–2343.Google Scholar
• Soylu B (2015) A general variable neighborhood search heuristic for multiple traveling salesmen problem. Comput. Indust. Engrg. 90:390–401.Crossref, Google Scholar
• Svestka JA, Huckfeldt VE (1973) Computational experience with an m-salesman traveling salesman algorithm. Management Sci. 19(7):790–799.Link, Google Scholar
• Tanaka S, Araki M (2009) Routing problem under the shared storage policy for unit-load automated storage and retrieval systems with separate input and output points. Internat. J. Production Res. 47(9):2391–2408.Crossref, Google Scholar
• Tang L, Liu J, Rong A, Yang Z (2000) A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan iron & steel complex. Eur. J. Oper. Res. 124(2):267–282.Crossref, Google Scholar
• Tompkins JA, White JA, Bozer YA, Tanchoco JMA (2010) Facilities Planning, 4th ed. (John Wiley & Sons, Inc).Google Scholar
• Toth P, Vigo D (2002) An overview of vehicle routing problems. Toth P, Vigo D, eds. The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia), 1–26.Google Scholar
• Uit het Broek MAJ, Schrotenboer AH, Jargalsaikhan B, Roodbergen KJ, Coelho LC (2021) Asymmetric multi-depot vehicle routing problems: Valid inequalities and a branch-and-cut algorithm. Oper. Res. 69(2):380–409.Link, Google Scholar
• Van den Berg JP (2002) Analytic expressions for the optimal dwell point in an automated storage/retrieval system. Internat. J. Production Econom. 76(1):13–25.Crossref, Google Scholar
• Van den Berg JP, Gademann AJRM (1999) Optimal routing in an automated storage/retrieval system with dedicated storage. IIE Trans. 31(5):407–415.Crossref, Google Scholar
• Venkatesh P, Singh A (2015) Two metaheuristic approaches for the multiple traveling salesperson problem. Appl. Soft Comput. 26:74–89.Crossref, Google Scholar
• Vis IFA, Roodbergen KJ (2009) Scheduling of container storage and retrieval. Oper. Res. 57(2):456–467.Link, Google Scholar
• Wacholder E, Han J, Mann RC (1989) A neural network algorithm for the multiple traveling salesmen problem. Biological Cybernetics 61(1):11–19.Crossref, Google Scholar
• Wauters T, Villa F, Christiaens J, Alvarez-Valdes R, Vanden Berghe G (2016) A decomposition approach to dual shuttle automated storage and retrieval systems. Comput. Indust. Engrg. 101:325–337.Crossref, Google Scholar
• Weidinger F, Boysen N (2018) Scattered storage: How to distribute stock keeping units all around a mixed-shelves warehouse. Transportation Sci. 52(6):1412–1427.Link, Google Scholar
• Weidinger F, Boysen N, Briskorn D (2018) Storage assignment with rack-moving mobile robots in kiva warehouses. Transportation Sci. 52(6):1479–1495.Link, Google Scholar
• Xu PJ, Allgor R, Graves SC (2009) Benefits of reevaluating real-time order fulfilment decisions. Manufacturing Service Oper. Management 11(2):340–355.Link, Google Scholar
• Yalcin A, Koberstein A, Schocke KO (2019) An optimal and a heuristic algorithm for the single-item retrieval problem in puzzle-based storage systems with multiple escorts. Internat. J. Production Res. 57(1):1431–1465.Crossref, Google Scholar
• Yang P, Miao L, Xue Z, Ye B (2015) Variable neighborhood search heuristic for storage location assignment and storage/retrieval scheduling under shared storage in multi-shuttle automated storage/retrieval systems. Transportation Res. Part E Logist. Transportation Rev. 79:164–177.Crossref, Google Scholar
• Yang P, Peng Y, Ye B, Miao L (2017) Integrated optimization of location assignment and sequencing in multi-shuttle automated storage and retrieval systems under modified 2 n-command cycle pattern. Engrg. Optim. 49(9):1604–1620.Crossref, Google Scholar
• Yousefikhoshbakht M, Didehvar F, Rahmati F (2013) Modification of the ant colony optimization for solving the multiple traveling salesman problem. Romanian J. Inform. Sci. Tech. 16(1):65–80.Google Scholar
• Yu Y, De Koster R (2012) Sequencing heuristics for storing and retrieving unit loads in 3D compact automated warehousing systems. IIE Trans. 44(2):69–87.Crossref, Google Scholar
• Yu Q, Wang D, Lin D, Li Y, Wu C (2012) A novel two-level hybrid algorithm for multiple traveling salesman problems. Tan Y, Shi Y, Ji Z, eds. Advances in Swarm Intelligence, Lecture Notes in Computer Science, vol. 7331 (Springer, Berlin, Heidelberg), 497–503.Crossref, Google Scholar
• Yuan Y, Tang L (2017) Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse. Eur. J. Oper. Res. 262(2):424–437.Crossref, Google Scholar
• Yuan S, Skinner B, Huang S, Liu D (2013) A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur. J. Oper. Res. 228(1):72–82.Crossref, Google Scholar