Publications

  1. Enzi, M., Parragh, S.N., Puchinger, J. (2022) The bi-objective multimodal car-sharing problem. OR Spectrum, 44, 307–348. https://doi.org/10.1007/s00291-021-00631-2 Preprint: http://arxiv.org/abs/2010.10344
  2. Parragh, S.N., Tricoire, F., Gutjahr, W.J. (2022). A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem. OR Spectrum, 44, 419-459. https://doi.org/10.1007/s00291-020-00616-7 Preprint: https://arxiv.org/abs/2004.11248
  3. Nazemi, N., Parragh, S.N., Gutjahr, W. (2022). Bi-objective risk-averse facility location using a subset-based representation of the conditional value-at-risk. In Proceedings of the 11th International Conference on Operations Research and Enterprise Systems – ICORESISBN 978-989-758-548-7, pages 77-85. http://doi.org/10.5220/0010914900003117 [Best Student Paper Award]
  4. Berndorfer, J., Parragh, S.N. (2022). Modeling and solving a real world machine scheduling problem with due windows and processing set restrictions. Procedia Computer Science, 200, 1646-1653. https://doi.org/10.1016/j.procs.2022.01.365
  5. Nazemi, N., Parragh, S. N., Gutjahr, W. J. (2021). Bi-objective facility location under uncertainty with an application in last-mile disaster relief. Annals of Operations Research, https://doi.org/10.1007/s10479-021-04422-4
  6. Hofwimmer, M., Haslinger, X., Parragh, S.N., Müller, C., Goers, S., Tichler, R. (2021). Emissionsfreie Straßengüterverkehrslogistik durch den Einsatz von batterieelektrischen und H2-Brennstoffzellen-Lkw. In “Jahrbuch der Logistikforschung” Brunner, U., Prandtstetter, M., Reiner, G., Starkl, F.P., Stein, S., Wakolbinger, T. (eds), Vol 3, Trauner Verlag, pages 147-159.
  7. Enzi, M., Parragh, S.N., Pisinger, D., Prandtstetter, M. (2021). Modeling and solving the multimodal car- and ride-sharing problem. European Journal of Operational Research, 293(1), 290-303. https://doi.org/10.1016/j.ejor.2020.11.046, Preprint: https://arxiv.org/abs/2001.05490
  8. Gutjahr, M., Kellerer, H., Parragh, S.N. (2021). Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system. Procedia Computer Science 180, 825-832. https://doi.org/10.1016/j.procs.2021.01.332
  9. An D., Parragh S., Sinnl M. and Tricoire F. (2021). A LP Relaxation based Matheuristic for Multi-objective Integer Programming. In Proceedings of the 10th International Conference on Operations Research and Enterprise Systems – Volume 1: ICORES, ISBN 978-989-758-485-5, pages 88-98. DOI: 10.5220/0010347000880098, Preprint: https://arxiv.org/abs/2102.03582
  10. Renata Turkes, R., Sörensen K., Hvattum, L. M., Barrena, E., Chentli, H., Coelho, L. C., Dayarian I., Grimault, A., Gullhav, A. N., Iris, C., Keskin, M., Kiefer, A., Lusby, R. M., Mauri, G. R., Monroy-Licht, M., Parragh, S. N., Riquelme-Rodriguez, J.-P., Santini, A., Martins Santos, V. G., Thomas, C. (2020). Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search, Data in Brief 33. https://doi.org/10.1016/j.dib.2020.106568
  11. Hauder, V.A., Beham, A., Raggl, S., Parragh, S.N., Affenzeller, M. (2020). Resource-constrained multi-project scheduling with activity and time flexibility, Computers and Industrial Engineering, 150, 106857. https://doi.org/10.1016/j.cie.2020.106857
  12. Fazekas, K., Sinnl, M., Biere, A., Parragh, S. (2020). Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem. In: Hebrard E., Musliu N. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2020. Lecture Notes in Computer Science, vol 12296. Springer, Cham. https://doi.org/10.1007/978-3-030-58942-4_13
  13. Nazemi N., Parragh S., Gutjahr W. (2020). Bi-objective facility location in the presence of uncertainty. Proceedings of the TSL Second Triennial Conference.
  14. Feillet, D., Parragh, S.N., Tricoire, F. (2019) A Local-Search Based Heuristic for the Unrestricted Block Relocation Problem. Computers and Operations Research, 108, 44-56. https://doi.org/10.1016/j.cor.2019.04.006, Preprint: https://arxiv.org/abs/1809.08201
  15. Parragh, S.N., Tricoire, F. (2019). Branch-and-bound for bi-objective integer programming. INFORMS Journal on Computing, 31(4), 805-822. https://doi.org/10.1287/ijoc.2018.0856 https://arxiv.org/pdf/1809.06823.pdf
  16. Parragh, S.N., Tricoire, F. (2019). Das Potential der Mehrzieloptimierung in der Logistik. In “Jahrbuch der Logistikforschung”, F.P. Starkl, M. Prandtstetter, T. Wakolbinger, G. Reiner (eds), Vol 2, Trauner Verlag, pages 145-155.
  17. Parragh, S.N., Doerner, K.F. (2018). Solving Routing Problems with pairwise synchronization constraints. Central European Journal of Operational Research, 26(2), 443-464. https://doi.org/10.1007/s10100-018-0520-4
  18. Tricoire, F., Parragh, S.N. (2017). Investing in logistics facilities today to reduce routing emissions tomorrow. Transportation Research Part B: Methodological, 103, 56-67. http://doi.org/10.1016/j.trb.2017.03.006
  19. Parragh, S.N., Cordeau J.-F. (2017). Branch-and-Price and Adaptive Large Neighborhood Search for the Truck and Trailer Routing Problem with Time Windows. Computers and Operations Research, 83, 28-44. http://dx.doi.org/10.1016/j.cor.2017.01.020
  20. Ehrgott, M., Ljubic, I., Parragh, S.N. (2017), Feature Cluster: Recent Advances in Exact Methods for Multi-Objective Optimisation. European Journal of Operational Research, 260(3),  805-806. http://dx.doi.org/10.1016/j.ejor.2017.02.004
  21. Enzi, M., Biesinger, B., Knopp, S., Parragh, S. N., Prandtstetter, M. (2017). Planning Shared Corporate Mobility Services. Transportation Research Procedia, 27, 270-277. https://doi.org/10.1016/j.trpro.2017.12.141
  22. Tricoire, F., Parragh, S.N., Gansterer, M. (2016). The Golf Tourist Problem. In “Dynamic Perspectives on Managerial Decision Making: Essays in Honor of Richard F. Hartl”, Dawid, H., Doerner, K.F., Feichtinger, G., Kort, P.M., Seidl, A. (eds), Volume 22 of the series Dynamic Modeling and Econometrics in Economics and Finance, Springer International Publishing, pages 473-489. http://dx.doi.org/10.1007/978-3-319-39120-5_25
  23. Braekers, K., Hartl, R.F., Parragh, S.N., Tricoire, F. (2016). A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience. European Journal of Operational Research,248(2), 428-443. http://dx.doi.org/10.1016/j.ejor.2015.07.028
  24. Kovacs, A.A., Golden, B., Hartl, R.F., Parragh, S.N. (2015) The generalized consistent vehicle routing problem. Transportation Science, 49(4), 796-816. http://dx.doi.org/10.1287/trsc.2014.0529
  25. Kovacs, A.A., Parragh, S.N., Hartl, R.F. (2015). The Multi-Objective Generalized Consistent Vehicle Routing Problem. European Journal of Operational Research, 247(2), 441-458. http://dx.doi.org/10.1016/j.ejor.2015.06.030
  26. Parragh, S.N., Pinho de Sousa, J., Almada-Lobo, B. (2015). The dial-a-ride problem with split requests and profits, Transportation Science, 49(2), 311-334. http://dx.doi.org/10.1287/trsc.2014.0520
  27. Boegl, M., Doerner, K.F., Parragh, S.N. (2015). The school bus routing and scheduling problem with transfers. Networks, 65(2), 180-203. http://dx.doi.org/10.1002/net.21589
  28. Kovacs, A.A., Hartl, R.F., Parragh, S.N., Golden, B. (2014). Vehicle routing problems in which consistency considerations are important: A survey. Networks, 64(3) ,192-213. http://dx.doi.org/10.1002/net.21565
  29. Kovacs, A. A., Parragh, S. N., Hartl, R. F. (2014). A template based adaptive large neighborhood search for the consistent vehicle routing problem. Networks, 63(1), 60-81. http://dx.doi.org/10.1002/net.21522http://phaidra.univie.ac.at/o:397974
  30. Amorim, P., Parragh, S. N., Sperandio, F., Almada-Lobo, B. (2014). A rich vehicle routing problem dealing with perishable food: a case study. Top, 22(2), 489-508. http://dx.doi.org/10.1007/s11750-012-0266-4http://phaidra.univie.ac.at/o:406859
  31. Lehuédé, F., Masson, R., Parragh, S.N., Péton, O., Tricoire, F. (2014). A multi-criteria large neighborhood search for the transportation of disabled people. Journal of the Operational Research Society, 65, 983-1000. http://dx.doi.org/10.1057/jors.2013.17
  32. Parragh, S.N. and Schmid, V. (2013). Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers & Operations Research, 40 (1), 490-497. http://dx.doi.org/10.1016/j.cor.2012.08.004
  33. Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling, 15 (5), 579-600. http://dx.doi.org/10.1007/s10951-011-0246-9
  34. Parragh, S.N, Cordeau, J.-F., Doerner, K.F., Hartl, R.F. (2012) Models and Algorithms for the Heterogeneous Dial-a-Ride Problem with Driver Related Constraints. OR Spectrum, 34(3), 593-633. http://dx.doi.org/10.1007/s00291-010-0229-9
  35. Parragh, S.N. (2011). Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C: Emerging Technologies, 19 (5), 912-930. http://dx.doi.org/10.1016/j.trc.2010.06.002
  36. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2010). Variable Neighborhood Search for the Dial-a-Ride Problem. Computers & Operations Research, 37(6), 1129-1138. http://dx.doi.org/10.1016/j.cor.2009.10.003
  37. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2010) Demand responsive transportation. in: Wiley Encyclopedia of Operations Research and Management Science, James J. Cochran (ed.). http://dx.doi.org/10.1002/9780470400531.eorms0243
  38. Parragh, S.N., Doerner, K.F., Gandibleux, X., Hartl, R.F. (2009) A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks, 54, 227-242. http://dx.doi.org/10.1002/net.20335
  39. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2008.) A survey on pickup and delivery problems. Part I: Transportation between customers and depot. Journal für Betriebswirtschaft, 58(1), 21-51. http://dx.doi.org/10.1007/s11301-008-0033-7
  40. Parragh, S.N., Doerner, K.F., Hartl, R.F. (2008). A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft, 58(2), 81-117. http://dx.doi.org/10.1007/s11301-008-0036-4

Technical reports/submitted

  1. Su, Y., Dupin, N., Parragh, S.N., Puchinger, J. (2022) A Column Generation Approach for the Electric Autonomous Dial-a-Ride Problem. https://arxiv.org/abs/2206.13496 (submitted)
  2. Bökler, F., Parragh, S.N., Sinnl, M., Tricoire, F. (2022) An outer approximation algorithm for multi-objective mixed-integer linear and non-linear programming https://arxiv.org/abs/2103.16647  (submitted)
  3. An, D., Parragh, S.N., Sinnl, M., Tricoire, F. (2022). A matheuristic for tri-objective binary integer programming  https://arxiv.org/abs/2205.03386 (submitted)
  4. Soares, R., Marques, A., Amorim, P., Parragh, S. N. (2021) Synchronisation in vehicle routing: a literature-based classification schema and modelling framework, pp. 1-31, available here (submitted)
  5. Enzi, M., Parragh, S.N., Pisinger, D. (2020). Modeling and solving a vehicle-sharing problem. https://arxiv.org/abs/2003.08207 (submitted)
  6. Turkes, R., Sörensen, K., Hvattum, L.M., Barrena, E., Chentli, H., Coelho, L., Dayarian, I., Grimault, A., Gullhav, A., Iris, , Keskin, M., Kiefer, A., Lusby, R., Mauri, G., Monroy-Licht, M., Parragh, S.N., Riquelme-Rodri­guez, J.-P., Santini, A., Gandra Martins Santos, V., Thomas, C. (2019). Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search https://repository.uantwerpen.be/docman/irua/d9a052/163609.pdf
  7. Hauder, V.A., Beham, A., Raggl, S., Parragh, S.N., Affenzeller, M. (2018). On constraint programming for a new flexible project scheduling problem with resource constraints. https://arxiv.org/abs/1902.09244
  8. Parragh, S.N., Pinho de Sousa, J., Almada-Lobo, B. (2012). Valid inequalities for the dial-a-ride problem with split requests and profits. Technical report, IBM Center for Advanced Studies/INESC Porto and University of Vienna.