Personal Website Stefan Irnich – FB 03

Stefan Irnich is a professor of Logistics Management at the Department of
Business and Economics at JGU Mainz.

He holds a diploma degree in Mathematics from RWTH Aachen University, Germany, which he obtained in 1995. He subsequently earned a magister’s degree in Information Systems and Operations Research in 1998. For the
duration of his doctoral studies, he was affiliated with the Institute of Operations Research at RWTH Aachen. He completed his PhD thesis, which focused on a service network design problem, in 2005. His research visits to GERAD in Montréal, Canada, were instrumental in shaping his professional journey. He subsequently advanced his career as a postdoctoral researcher (habilitation in 2008) at RWTH Aachen. Between 2008 and 2009, he assumed the role of deputy professor of the Chair of Operations Research and Logistics Management and the Chair of Operations Research and Supply Chain Management. In 2009, Stefan Irnich assumed the faculty position of full professor of Logistics Management at JGU Mainz.

Fields of Application

Methodology

Associate Editor of Transportation Science since 2021

Associate Editor and Member of the Editorial Board of Journal on Vehicle Routing Algorithms 2018–2019

Member of the Editorial Board of EURO Journal on Transportation and Logistics since 2013

Member of the Editorial Advisory Board of Computers and Operations Research since 2012

All (grouped by year)

2026

Becker, C., Cavagnini, R., Irnich, S., and Schneider, M. (2026). Rule-based design of a granular tabu search for the multi-depot vehicle routing problem. ANNALS OF OPERATIONS RESEARCH. Published. DOI Author/Publisher URL

2025

Lüke, L., Hessenius, A., and Irnich, S. (2025). A linear-size model for the single picker routing problem with scattered storage. European Journal of Operational Research. Published. DOI

Faldum, S., Gschwind, T., and Irnich, S. (2025). Subset-Row Inequalities and Unreachability in Path-Based Formulations for Vehicle Routing and Scheduling Problems. NETWORKS. Published. DOI Author/Publisher URL

DehghanChenary, M., Hartl, R. F., Irnich, S., and Tilk, C. (2025). On Combining Conventional Point-To-Point and Automated Waste Collection Systems. NETWORKS, 86(2), 174-198. DOI Author/Publisher URL

Schmidt, J., Tilk, C., and Irnich, S. (2025). Exact Solution of the Vehicle Routing Problem with Drones. TRANSPORTATION SCIENCE, 59(1). DOI Author/Publisher URL

Marianczuk, L., Althaus, E., Irnich, S., and Pfetsch, M. E. (2025). A New Relaxation for Tree-Based Problems and Minimum Power-Cost Spanning Trees. In P. Mutzel and N. Prezza (eds.), SEA (Vols. 338, pp. 24:1-24:1). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Author/Publisher URL

2024

Faldum, S., Machate, S., Gschwind, T., and Irnich, S. (2024). Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff. OR SPECTRUM, 46(4), 1063-1097. DOI Author/Publisher URL

Schmidt, J., Tilk, C., and Irnich, S. (2024). Using public transport in a 2-echelon last-mile delivery network. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 317(3), 827-840. DOI Author/Publisher URL

Lueke, L., Hessler, K., and Irnich, S. (2024). The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies. OR SPECTRUM, 46(3), 909-951. DOI Author/Publisher URL

Gauthier, J. B., and Irnich, S. (2024). Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems. DISCRETE APPLIED MATHEMATICS, 346, 131-153. DOI Author/Publisher URL

Bianchessi, N., Gschwind, T., and Irnichb, S. (2024). Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS JOURNAL ON COMPUTING, 36(1). DOI Author/Publisher URL

Hessler, K., and Irnich, S. (2024). Exact Solution of the Single-Picker Routing Problem with Scattered Storage. INFORMS JOURNAL ON COMPUTING, 36(6). DOI Author/Publisher URL

2023

Korbacher, L., Irnich, S., Martinovic, J., and Strasdat, N. (2023). Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model. DISCRETE APPLIED MATHEMATICS, 334, 145-162. DOI Author/Publisher URL

Dumez, D., Tilk, C., Irnich, S., et al. (2023). A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 305(1), 64-84. DOI Author/Publisher URL

Hessler, K., Irnich, S. (2023). Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem. INFORMS JOURNAL ON COMPUTING, 35(1), 50-65. DOI Author/Publisher URL

2022

Hessler, K., Irnich, S., Kreiter, T., and Pferschy, U. (2022). Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. OR SPECTRUM, 44(2), 375-417. DOI Author/Publisher URL

Heßler, K., and Irnich, S. (2022). A note on the linearity of Ratliff and Rosenthal’s algorithm for optimal picker routing. Operations Research Letters, 50, 155-159. DOI Author/Publisher URL

Heßler, K., Irnich, S., Kreiter, T., and Pferschy, U. (2022). Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. OR Spectr., 44, 1-43.

Schmidt, J., and Irnich, S. (2022). New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 10. DOI Author/Publisher URL

2021

Tilk, C., Olkis, K., Irnich, S. (2021). The last-mile vehicle routing problem with delivery options. OR SPECTRUM, 43(4), 877-904. DOI Author/Publisher URL

Bianchessi, N., Irnich, S., Tilk, C. (2021). A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. DISCRETE APPLIED MATHEMATICS, 288, 152-170. DOI Author/Publisher URL

Hessler, K., Irnich, S. (2021). A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. DISCRETE APPLIED MATHEMATICS, 288, 218-234. DOI Author/Publisher URL

Dumez, D., Tilk, C., Irnich, S., et al. (2021). Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 10. DOI Author/Publisher URL

Gschwind, T., Irnich, S., Furini, F., Calvo, R. W. (2021). A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS JOURNAL ON COMPUTING, 33(3), 1070-1090. DOI Author/Publisher URL

Hintsch, T., Irnich, S., Kiilerich, L. (2021). Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem. TRANSPORTATION SCIENCE, 55(3), 687-705. DOI Author/Publisher URL

2020

Loeffler, M., Desaulniers, G., Irnich, S., and Schneider, M. (2020). Routing electric vehicles with a single recharge per route. NETWORKS, 76(2), 187-205. DOI Author/Publisher URL

Gschwind, T., Irnich, S., Tilk, C., and Emde, S. (2020). Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. JOURNAL OF SCHEDULING, 23(3), 363-377. DOI Author/Publisher URL

Desaulniers, G., Gschwind, T., and Irnich, S. (2020). Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models. TRANSPORTATION SCIENCE, 54(5), 1170-1188. DOI Author/Publisher URL

Hintsch, T., and Irnich, S. (2020). Exact solution of the soft-clustered vehicle-routing problem. European journal of operational research, 280(1), Seiten: 164-178. Author/Publisher URL

Steiner, K., and Irnich, S. (2020). Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks. TRANSPORTATION SCIENCE, 54(6), 1616-1639. DOI Author/Publisher URL

2019

Bianchessi, N., and Irnich, S. (2019). Branch-and-cut for the split delivery vehicle routing problem with time windows. Transportation science, 53(2), Seiten: 442-462. Author/Publisher URL

Bianchessi, N., Drexl, M., and Irnich, S. (2019). The split delivery vehicle routing problem with time windows and customer inconvenience constraints. Transportation science, 53(4), Seiten: 1067-1084. Author/Publisher URL

Gschwind, T., Bianchessi, N., and Irnich, S. (2019). Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. European journal of operational research, 278(1), Seiten: 91-104. Author/Publisher URL

He, Q., Irnich, S., and Song, Y. (2019). Branch-cut-and-price for the vehicle routing problem with time windows and convex node costs. Transportation science, 53(5), Seiten: 1409-1426. Author/Publisher URL

Sayah, D., and Irnich, S. (2019). Optimal booking control in revenue management with two substitutable resources. Mathematical methods of operations research, 89(2), Seiten: 189-222. Author/Publisher URL

Tilk, C., Drexl, M., and Irnich, S. (2019). Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. European journal of operational research, 276(2), Seiten: 549-565. Author/Publisher URL

2018

Gschwind, T., Irnich, S., Podlinski, I. (2018). Maximum weight relaxed cliques and Russian Doll Search revisited. Discrete applied mathematics, 234, Seiten: 131-138. Author/Publisher URL

Gschwind, T., Irnich, S., Rothenbächer, A.-K., Tilk, C. (2018). Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. European journal of operational research, 266(2), Seiten: 521-530. Author/Publisher URL

Heßler, K., Gschwind, T., Irnich, S. (2018). Stabilized branch-and-price algorithms for vector packing problems. European journal of operational research, 271(2), Seiten: 401-419. Author/Publisher URL

Hintsch, T., Irnich, S. (2018). Large multiple neighborhood search for the clustered vehicle-routing problem. European journal of operational research, 270(1), Seiten: 118-131. Author/Publisher URL

Rothenbächer, A.-K., Drexl, M., Irnich, S. (2018). Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows. Transportation science, 52(5), Seiten: 1174-1190. Author/Publisher URL

Steiner, K., Irnich, S. (2018). Schedule-based integrated intercity bus line planning via branch-and-cut. Transportation science, 52(4), Seiten: 882-897. Author/Publisher URL

Tilk, C., Irnich, S. (2018). Combined column-and-row-generation for the optimal communication spanning tree problem. Computers and operations research, 93, Seiten: 113-122. Author/Publisher URL

Tilk, C., Bianchessi, N., Drexl, M., et al. (2018). Branch-and-price-and-cut for the active-passive vehicle-routing problem. Transportation science, 52(2), Seiten: 300-319. Author/Publisher URL

2017

Goel, A., and Irnich, S. (2017). An exact method for vehicle routing and truck driver scheduling problems. Transportation science, 51(2), Seiten: 737-754. Author/Publisher URL

Sayah, D., and Irnich, S. (2017). A new compact formulation for the discrete p-dispersion problem. European journal of operational research, 256(1), Seiten: 62-67. Author/Publisher URL

Tilk, C., Rothenbächer, A.-K., Gschwind, T., and Irnich, S. (2017). Asymmetry matters : dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. European journal of operational research, 261(2), Seiten: 530-539. Author/Publisher URL

Tilk, C., Rothenbächer, A.-K., Gschwind, T., and Stefan, I. (2017). Asymmetry matters : dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. European journal of operational research, 261(2), Seiten: 530-539. Author/Publisher URL

2016

Cherkesly, M., Desaulniers, G., Irnich, S., and Laporte, G. (2016). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. European journal of operational research, 250(3), Seiten: 782-793. Author/Publisher URL

Desaulniers, G., Errico, F., Irnich, S., and Schneider, M. (2016). Exact algorithms for electric vehicle-routing problems with time windows. Operations research, 64(6), Seiten: 1388-1405. Author/Publisher URL

Gschwind, T., and Irnich, S. (2016). Dual inequalities for stabilized column generation revisited. INFORMS journal on computing, 28(1), Seiten: 175-194. Author/Publisher URL

Gschwind, T., and Irnich, S. (2016). Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities. OR spectrum, 39(2), Seiten: 541-556. Author/Publisher URL

Rothenbächer, A.-K., Drexl, M., and Irnich, S. (2016). Branch-and-price-and-cut for a service network design and hub location problem. European journal of operational research, 255(3), Seiten: 935-947. Author/Publisher URL

Rothenbächer, A.-K., Drexl, M., and Stefan, I. (2016). Branch-and-price-and-cut for a service network design and hub location problem. European journal of operational research, 255(3), Seiten: 935-947. Author/Publisher URL

Schlebusch, C., and Irnich, S. (2016). Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem. 501-506. DOI

Tilk, C., and Irnich, S. (2016). Dynamic programming for the minimum tour duration Problem. Transportation science, 51(2), Seiten: 549-565. Author/Publisher URL

2015

Belenguer, J. M., Benavent, E., and Irnich, S. (2015). Chapter 9: The Capacitated Arc Routing Problem: Exact Algorithms. In Arc Routing (pp. 183-221). Society for Industrial and Applied Mathematics. DOI

Bode, C., and Irnich, S. (2015). In-depth analysis of pricing problem relaxations for the capacitated arc-routing problem. Transportation science, 49(2), Seiten: 369-383. Author/Publisher URL

Gschwind, T., and Irnich, S. (2015). Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. 49(2), Seiten: 335-354. Author/Publisher URL

Irnich, S., Laganà, D., Schlebusch, C., and Vocaturo, F. (2015). Two-phase branch-and-cut for the mixed capacitated general routing problem. European journal of operational research, 243(1), Seiten: 17-29. Author/Publisher URL

2014

Irnich, S., Schneider, M., and Vigo, D. (2014). Chapter 9: Four Variants of the Vehicle Routing Problem. In Vehicle Routing (pp. 241-271). Society for Industrial and Applied Mathematics. DOI

Irnich, S., Toth, P., and Vigo, D. (2014). Chapter 1: The Family of Vehicle Routing Problems. In Vehicle Routing (pp. 1-33). Society for Industrial and Applied Mathematics. DOI

Archetti, C., Bianchessi, N., Irnich, S., and Speranza, M. G. (2014). Formulations for an inventory routing problem. International transactions in operational research, 21(3), Seiten: 353-374. Author/Publisher URL

Bode, C., and Irnich, S. (2014). The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem. European journal of operational research, 238(2), Seiten: 415-426. Author/Publisher URL

Drexl, M., and Irnich, S. (2014). Solving elementary shortest-path problems as mixed-integer programs. OR spectrum, 36(2), Seiten: 281-296. Author/Publisher URL

Irnich, S., Schneider, M., and Vigo, D. (2014). Four variants of the vehicle routing problem. In P. Toth (ed.), Vehicle routing : problems, methods, and applications (pp. Seiten: 241-271). Philadelphia, PA:Society for Industrial and Applied Mathematics. Author/Publisher URL

Irnich, S., Toth, P., and Vigo, D. (2014). The family of vehicle routing problems. In P. Toth (ed.), Vehicle routing : problems, methods, and applications (pp. Seiten: 1-33). Philadelphia, PA:Society for Industrial and Applied Mathematics. Author/Publisher URL

2013

Belenguer, J. M., Benavent, E., and Irnich, S. (2013). The capacitated arc routing problem : exact algorithms. In Ángel Corberán (ed.), Arc routing : problems, methods, and applications (pp. Seiten: 183-221). Philadelphia, PA:Society for Industrial and Applied Mathematics. Author/Publisher URL

2012

Bode, C., and Irnich, S. (2012). Cut-first branch-and-price-second for the capacitated arc-routing problem. Operations research, 60(5), Seiten: 1167-1182. Author/Publisher URL

2011

Gschwind, T., Irnich, S. (2011). A note on symmetry reduction for circular traveling tournament problems. European journal of operational research, 210(2), Seiten: 452-456. Author/Publisher URL

Gussmagg-Pfliegl, E., Tricoire, F., Doerner, K., et al. (2011). Heuristics for a real-world mail delivery problem (C. Di Chio, ed.; pp. Seiten: 481-490). Berlin:Springer. Author/Publisher URL

2010

Irnich, S. (2010). A new branch-and-price algorithm for the traveling tournament problem. European journal of operational research, 204(2), Seiten: 218-228. Author/Publisher URL

Irnich, S., Desaulniers, G., Desrosiers, J., and Hadjar, A. (2010). Path-reduced costs for eliminating arcs in routing and scheduling. INFORMS journal on Computing : JOC, 22(2), Seiten: 297-313. Author/Publisher URL

2009

Irnich, S. (2009). New Models and Methods for Arc Routing. In C. Barnhart, U. Clausen, U. Lauther, and R. H. Möhring (eds.), Models and Algorithms for Optimization in Logistics (Vols. 09261). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Germany. Author/Publisher URL

2008

Irnich, S. (2008). Undirected postman problems with zigzagging option: A cutting-plane approach. COMPUTERS & OPERATIONS RESEARCH, 35(12), 3998-4009. DOI Author/Publisher URL

Irnich, S. (2008). Solution of real-world postman problems. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 190(1), 52-67. DOI Author/Publisher URL

Irnich, S. (2008). Resource extension functions: properties, inversion, and generalization to segments. OR SPECTRUM, 30(1), 113-148. DOI Author/Publisher URL

Irnich, S. (2008). A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS JOURNAL ON COMPUTING, 20(2), 270-287. DOI Author/Publisher URL

2006

Irnich, S., Funke, B., and Grünert, T. (2006). Sequential search and its application to vehicle-routing problems. COMPUTERS & OPERATIONS RESEARCH, 33(8), 2405-2429. DOI Author/Publisher URL

Irnich, S., and Villeneuve, D. (2006). The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS JOURNAL ON COMPUTING, 18(3), 391-406. DOI Author/Publisher URL

2005

Funke, B., Grünert, T., and Irnich, S. (2005). Local search for vehicle routing and scheduling problems: Review and conceptual integration. JOURNAL OF HEURISTICS, 11(4), 267-306. DOI Author/Publisher URL

Funke, B., Grünert, T., and Irnich, S. (2005). A note on single alternating cycle neighborhoods for the TSP. JOURNAL OF HEURISTICS, 11(2), 135-146. DOI Author/Publisher URL

Irnich, S., and Desaulniers, G. (2005). Shortest Path Problems with Resource Constraints. In Column Generation (pp. 33-65). Springer-Verlag. DOI

Irnich, S. (2005). A note on postman problems with zigzag service. INFOR, 43(1), 33-39. Author/Publisher URL

Grünert, T., and Irnich, S. (2005). Optimierung im Transport 1 Grundlagen.

Grünert, T., and Irnich, S. (2005). Optimierung im Transport Wege und Touren. Aachen:Shaker.

2002

Grünert, T., Irnich, S., Zimmermann, H. J., et al. (2002). Finding all k-cliques in k-partite graphs, an application in textile engineering. COMPUTERS & OPERATIONS RESEARCH, 29(1), 13-31. DOI Author/Publisher URL

2000

Irnich, S. (2000). A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 122(2), 310-328. DOI Author/Publisher URL

Not dated

Hempsch, C., and Irnich, S. Vehicle Routing Problems with Inter-Tour Resource Constraints. In Operations Research/Computer Science Interfaces (pp. 421-444). Springer US. DOI

Book Chapters

Irnich, S., Schneider, M., and Vigo, D. (2014). Chapter 9: Four Variants of the Vehicle Routing Problem. In Vehicle Routing (pp. 241-271). Society for Industrial and Applied Mathematics. DOI

Irnich, S., Toth, P., and Vigo, D. (2014). Chapter 1: The Family of Vehicle Routing Problems. In Vehicle Routing (pp. 1-33). Society for Industrial and Applied Mathematics. DOI

Irnich, S., and Desaulniers, G. (2005). Shortest Path Problems with Resource Constraints. In Column Generation (pp. 33-65). Springer-Verlag. DOI

Hempsch, C., and Irnich, S. Vehicle Routing Problems with Inter-Tour Resource Constraints. In Operations Research/Computer Science Interfaces (pp. 421-444). Springer US. DOI

Proceedings

Gschwind, T., Irnich, S., and Podlinski, I. (2018). Maximum weight relaxed cliques and Russian Doll Search revisited. Discrete applied mathematics, 234, Seiten: 131-138. Author/Publisher URL

Schlebusch, C., and Irnich, S. (2016). Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem. 501-506. DOI

Gussmagg-Pfliegl, E., Tricoire, F., Doerner, K., et al. (2011). Heuristics for a real-world mail delivery problem (C. Di Chio, ed.; pp. Seiten: 481-490). Berlin:Springer. Author/Publisher URL

Books

Grünert, T., and Irnich, S. (2005). Optimierung im Transport 1 Grundlagen.

Grünert, T., and Irnich, S. (2005). Optimierung im Transport Wege und Touren. Aachen:Shaker.

VeRoLog: Working Group on Vehicle Routing and Logistics Optimization of EURO, Board Member

GOR: Gesellschaft für Operations Research e.V.

VHB: Verband der Hochschullehrer für Betriebswirtschaft e.V.

Annals of Operations Research, Array, Computers & Industrial Engineering, Computers & Operations Research, Computational Optimization and Applications, Decision Making in Manufacturing and Services, EURO Journal on Transportation and Logistics, European Journal of Industrial Engineering, European Journal of Operational Research, Expert Systems With Applications, HICCS (Hawaii International Conference on System Sciences), INFORMS Journal on Applied Analytics, INFORMS Journal on Computing, INFORMS Journal on Optimization, INTERFACES, International Transactions in Operational Research, Journal für Betriebswirtschaft (Austria), Journal of Flexible Services, Journal of Scheduling, Journal on Vehicle Routing Algorithms, Mathematical Programming Computation, Mathematical Methods of Operations Research, Networks, MIC (Metaheuristics International Conferences), Operations Research, OMEGA, Optimization Letters, OR Spectrum, Public Transport, TOP (Journal of the Spanish Statistics and OR Society), Transportation Research Part C, Transportation Research Part E, Transportation Science, Zeitschrift für Betriebswirtschaft