Publications

 

List of DPO publications

  • M. Löffler, N. Boysen, and M. Schneider. Human-robot cooperation: Coordinating autonomous mobile robots and human order pickers. Forthcoming in Transportation Science.

  • A. Santini, M. Schneider, T. Vidal, and D. Vigo. Decomposition strategies for vehicle routing heuristics. Forthcoming in INFORMS Journal on Computing.

  • C. Becker, J. B. Gauthier, T. Gschwind, and M. Schneider. In-depth analysis of granular local search for capacitated vehicle routing. Discrete Applied Mathematics. 329:61-86, 2023, doi: 10.1016/j.dam.2022.12.019. Temporarily free download.

  • M. Löffler, M. Schneider, and I. Žulj. Cost-neutral reduction of infection risk in picker-to-parts warehousing systems. OR Spectrum. 45:151-179, 2023, doi: 10.1007/s00291-022-00695-8. Free Download.

  • H. Schaap, M. Schiffer, M. Schneider, and G. Walther. A large neighborhood search for the vehicle routing problem with multiple time windows.Transportation Science. 56(5):111-1408, 2022, doi: https://doi.org/10.1287/trsc.2021.1120.

  • M. Siddig and Y. Song. Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse. Computational Optimization and Applications. 81:201-205, 2022, doi: 10.1007/s10589-021-00323-1.

  • R. Cavagnini, L. Bertazzi, and F. Maggioni. A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment. European Journal of Operational Research. 301(3):912-922, 2022, doi: 10.1016/j.ejor.2021.11.037.

  • I. Žulj, H. Salewski, D. Goeke, and M. Schneider. Order batching and batch sequencing in an AMR-assisted
    picker-to-parts system. European Journal of Operational Research. 298(1):182-201, 2022, doi: 10.1016/j.ejor.2021.05.033.

  • M. Löffler, N. Boysen, and M. Schneider. Picker routing in AGV-assisted order picking systems. INFORMS Journal on Computing, 34(1):440-462, 2022, doi: 10.1287/ijoc.2021.1060.

  • A. Santini, E. Bartolini, M. Schneider, and V. G. de Lemos. The Crop Growth Planning Problem in Vertical Farming. European Journal of Operational Research, 294(1):377-390, 2021, doi: 10.1016/j.ejor.2021.01.034.

  • J. Hof and M. Schneider. Intraroute resource replenishment with mobile depots. Transportation Science, 55(3):660-686, 2021, doi: 10.1287/trsc.2020.1034.

  • D. Goeke and M. Schneider. Modeling single-picker routing problems in classical and modern warehouses. INFORMS Journal on Computing, 33(2):436-451, 2021, doi: 10.1287/ijoc.2020.1040.

  • E. Bartolini, D. Goeke, M. Schneider, and M. Ye. The robust traveling salesman problem with time windows under knapsack-constrained travel time uncertainty. Transportation Science, 55(2):371-394, 2021, doi: 10.1287/trsc.2020.1011.

  • A. Foroughi, N. Boysen, S. Emde, and M. Schneider. High-density storage with mobile racks: Picker routing and product location. Journal of the Operational Research Society, 72(3):535-553, 2021, doi: 10.1080/01605682.2019.1700180.

  • M. Löffler, G. Desaulniers, S. Irnich, and M. Schneider. Routing electric vehicles with a single recharge per route. Networks, 76(2):187-205, 2020, doi: 10.1002/net.21964. Free Download.

  • E. Bartolini and M. Schneider. A two-commodity flow formulation for the capacitated truck-and-trailer routing problem. Discrete Applied Mathematics, 275:3-18, 2020, doi: 10.1016/j.dam.2018.07.033.

  • D. Goeke. Granular tabu search for the pickup and delivery problem with time windows and electric vehicles. European Journal of Operational Research, 278(3):821-836, 2019, doi: 10.1016/j.ejor.2019.05.010.

  • J. Hof and M. Schneider. An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. Networks, 74(3):207-250, 2019, doi: 10.1002/net.21879.

  • F. Weidinger, N. Boysen, and M. Schneider. Picker routing in the mixed-shelves warehouses of e-commerce retailers. European Journal of Operational Research, 274(2):501-515, 2019, doi: 10.1016/j.ejor.2018.10.021.

  • D. Goeke, T. Gschwind, and M. Schneider. Upper and lower bounds for the vehicle-routing problem with
    private fleet and common carrier. Discrete Applied Mathematics, 264:43-61, 2019, doi: 10.1016/j.dam.2018.10.015.

  • D. Goeke, R. Roberti, and M. Schneider. Exact and heuristic solution of the consistent vehicle-routing problem. Transportation Science, 53(4):1032-1042, 2019, doi: 10.1287/trsc.2018.0864.

  • M. Schiffer, M. Schneider, G. Walther, and G. Laporte. Vehicle routing and location routing with intermediate stops: A review. Transportation Science, 53(2):319-343, 2019, doi: 10.1287/trsc.2018.0836.

  • M. Schneider and M. Löffler. Large composite neighborhoods for the capacitated location-routing problem. Transportation Science, 53(1):301-318, 2019, doi: 10.1287/trsc.2017.0770.

  • J. Andelmin and E.Bartolini. A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation. Computers & Operations Research, 109:43-63, doi: 10.1016/j.cor.2019.04.018.

  • S. Emde and M. Schneider. Just-in-time vehicle routing for in-house part feeding to assembly lines. Transportation Science, 52(3):657-672, 2018, doi: 10.1287/trsc.2018.0824.

  • I. Žulj, C. Glock, E. Grosse, and M. Schneider. Picker routing and storage-assignment strategies for precedence-constrained order picking. Computers & Industrial Engineering, 123:338-347, 2018, doi: 10.1016/j.cie.2018.06.015.

  • I. Žulj, S. Kramer, and M. Schneider. A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. European Journal of Operational Research, 264(2):653-664, 2018, doi: 10.1016/j.ejor.2017.06.056.

  • A. Santini, C. Plum, and S. Ropke. A branch-and-price approach to the feeder network design problem. European Journal of Operational Research, 264(2):607-622, 2018, doi: 10.1016/j.ejor.2017.06.063.

  • M. Schiffer, M. Schneider, and G. Laporte. Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities. European Journal of Operational Research, 265(2):517-532, 2017, doi: 10.1016/j.ejor.2017.07.067.

  • H. Abedinnia, C. Glock, E. Grosse, and M. Schneider. Machine scheduling in production: A tertiary study. Computers & Industrial Engineering, 111:403-416, 2017, doi: 10.1016/j.cie.2017.06.026.

  • J. Andelmin and E. Bartolini. An exact algorithm for the green vehicle-routing problem. Transportation Science, 51(4):1288-1303, 2017, doi: 10.1287/trsc.2016.0734.

  • M. Schneider, F. Schwahn, and D. Vigo. Designing granular solution methods for routing problems with time windows. European Journal of Operational Research, 263(2):493-509, 2017, doi: 10.1016/j.ejor.2017.04.059.

  • E. Bartolini, M. Dell'Amico, and M. Iori. Scheduling cleaning activities on trains by minimizing idle times. Journal of Scheduling, 20(5):493-506, 2017, doi: 10.1007/s10951-017-0517-1.

  • M. Schneider and M. Drexl. A survey of the standard location-routing problem. Annals of Operations Research, 259(1):389-414, 2017, doi: 10.1007/s10479-017-2509-0.

  • J. Hof, M. Schneider, and D. Goeke. Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops. Transportation Research Part B, 97:102–112, 2017, doi: 10.1016/j.trb.2016.11.009.

  • H. Abedinnia, C. Glock, and M. Schneider. Machine scheduling in production: A content analysis. Applied Mathematical Modelling, 50:279-299, 2017, doi: 10.1016/j.apm.2017.05.016.

  • G. Desaulniers, F. Errico, S. Irnich, and M. Schneider. Exact algorithms for electric vehicle-routing problems with time windows. Operations Research, 64(6):1388–1405, 2016, doi: 10.1287/opre.2016.1535.