A branch-and-cut algorithm for the generalized traveling salesman problem with time windows

Ascheuer, 2001, Solving the asymmetric travelling salesman problem with time windows by branch-and-cut, Mathematical Programming, 90, 475, 10.1007/PL00011432 Balas, 1995, The precedence-constrained asymmetric traveling salesman polytope, Mathematical programming, 68, 241, 10.1007/BF01585767 Baldacci, 2012, New state-space relaxations for solving the traveling salesman problem with time windows, INFORMS Journal on Computing, 24, 356, 10.1287/ijoc.1110.0456 Dantzig, 1954, Solution of a large-scale traveling-salesman problem, Journal of the operations research society of America, 2, 393, 10.1287/opre.2.4.393 Dash, 2012, A time bucket formulation for the traveling salesman problem with time windows, INFORMS Journal on Computing, 24, 132, 10.1287/ijoc.1100.0432 Desrochers, 1992, A new optimization algorithm for the vehicle routing problem with time windows, Operations research, 40, 342, 10.1287/opre.40.2.342 Desrochers, 1991, Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints, Operations Research Letters, 10, 27, 10.1016/0167-6377(91)90083-2 Dimitrijević, 1997, An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs, Information Sciences, 102, 105, 10.1016/S0020-0255(96)00084-9 eMarketer (2018). Retail ecommerce sales worldwide, 2016–2021 (trillions, % change and % of total retail sales). http://www.emarketer.com/Chart/Retail-Ecommerce-Sales-Worldwide-2016-2021-trillions-change-of-total-retail-sales/215138. Online, accessed February 2019. Farber, M. (2016). Consumers are now doing most of their shopping online. http://fortune.com/2016/06/08/online-shopping-increases/. Online, accessed March 2019. Fischetti, 1997, A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Operations Research, 45, 378, 10.1287/opre.45.3.378 Ghiani, 2000, An efficient transformation of the generalized vehicle routing problem, European Journal of Operational Research, 122, 11, 10.1016/S0377-2217(99)00073-9 Gomory, 1961, Multi-terminal network flows, Journal of the Society for Industrial and Applied Mathematics, 9, 551, 10.1137/0109047 Gutin, 2010, A memetic algorithm for the generalized traveling salesman problem, Natural Computing, 9, 47, 10.1007/s11047-009-9111-6 Helsgaun, 2000, An effective implementation of the Lin–Kernighan traveling salesman heuristic, European Journal of Operational Research, 126, 106, 10.1016/S0377-2217(99)00284-2 Helsgaun, 2009, General k-opt submoves for the Lin–Kernighan TSP heuristic, Mathematical Programming Computation, 1, 119, 10.1007/s12532-009-0004-6 Helsgaun, 2015, Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun algorithm, Mathematical Programming Computation, 7, 269, 10.1007/s12532-015-0080-8 Israeli, 2002, Shortest-path network interdiction, Networks: An International Journal, 40, 97, 10.1002/net.10039 Karapetyan, D. (2012). Gtsp instances library. http://www.cs.nott.ac.uk/~pszdk/gtsp.html. Online, accessed August 2018. Karapetyan, 2012, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, European Journal of Operational Research, 219, 234, 10.1016/j.ejor.2012.01.011 Laporte, 1999, Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem, INFOR: Information Systems and Operational Research, 37, 114 Lowe, 2014, The Last Mile - exploring the online purchasing and delivery journey Miller, 1960, Integer programming formulation of traveling salesman problems, Journal of the ACM (JACM), 7, 326, 10.1145/321043.321046 Moccia, 2012, An incremental tabu search heuristic for the generalized vehicle routing problem with time windows, Journal of the Operational Research Society, 63, 232, 10.1057/jors.2011.25 Nemhauser, 1999, Application of special-purpose algorithm Noon, 1991, A lagrangian based approach for the asymmetric generalized traveling salesman problem, Operations Research, 39, 623, 10.1287/opre.39.4.623 Noon, 1993, An efficient transformation of the generalized traveling salesman problem, INFOR: Information Systems and Operational Research, 31, 39 Ozbaygin, 2017, A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations, Transportation Research Part B: Methodological, 100, 115, 10.1016/j.trb.2017.02.003 Padberg, 1973, On the facial structure of set packing polyhedra, Mathematical Programming, 5, 199, 10.1007/BF01580121 Reyes, 2017, Vehicle routing with roaming delivery locations, Transportation Research Part C: Emerging Technologies, 80, 71, 10.1016/j.trc.2017.04.003 Smith, 2017, GLNS: An effective large neighborhood search heuristic for the generalized traveling salesman problem, Computers & Operations Research, 87, 1, 10.1016/j.cor.2017.05.010 Solomon, 1987, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, 35, 254, 10.1287/opre.35.2.254 Srivastava, 1969, Generalized traveling salesman problem through n sets of nodes, CORS Journal, 7, 97 Yuan, 2020, A note on the lifted miller–tucker–zemlin subtour elimination constraints for routing problems with time windows, Operations Research Letters, 48, 167, 10.1016/j.orl.2020.01.008