Go to JKU Homepage
Deutsch, Sprache wechseln

Publications

Link zur Forschungsdokumentation (FODOK)

Journal publications

2021

  1. Sinnl, M.: Exact and heuristic algorithms for the maximum weighted submatrixcoverage problem, European Journal of Operational Research, Elsevier, 2021, https://doi.org/10.1016/j.ejor.2021.07.035
  2. Parragh S.N., Tricoire F., Gutjahr W.J.: A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem, OR Spectrum, Springer, 2021. https://doi.org/10.1007/s00291-020-00616-7
  3. Sinnl, M.: Mixed-integer programming approaches for the time-constrained maximal covering routing problem, OR Spectrum, 2021, https://doi.org/10.1007/s00291-021-00635-y

2020

  1. Enzi M., Parragh S., Pisinger D., Prandtstetter M.: Modeling and solving the multimodal car- and ride-sharing problem, in European Journal of Operational Research, Elsevier, 2020, Preprint: https://arxiv.org/abs/2001.05490
  2. Alvarez-Miranda E., Sinnl M.: Exact and heuristic algorithms for the weighted total domination problem, Computers & Operations Research, Elsevier, 2020
  3. Hauder V., Beham A., Raggl S., Parragh S., Affenzeller M.: Resource-constrained multi-project scheduling with activity and time flexibility, Computers & Industrial Engineering, Elsevier, 2020
  4. Güney, E., Leitner M., Ruthmair M., Sinnl M.: Large-Scale Influence Maximization via Maximal Covering Location, European Journal of Operational Research, accepted for publication, 2020
  5. Sinnl, M.: A note on computational approaches for the antibandwidth problem, Central European Journal of Operations Research, 2020, https://doi.org/10.1007/s10100-020-00688-4
  6. Kahr M., Leitner M., Ruthmair M., Sinnl M.: Benders decomposition for competitive influence maximization in (social) networks, Omega, 2020
  7. Fazekas K., Sinnl M., Biere A., Parragh S.: 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, 2020. https://doi.org/10.1007/978-3-030-58942-4_13

Submitted for Publication

  1. Miriam Enzi, Sophie N. Parragh, Jakob Puchinger, The bi-objective multimodal car-sharing problem, Submitted on 18 Oct 2020. http://arxiv.org/abs/2010.10344

  2. Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr, Bi-objective facility location in the presence of uncertainty, Submitted on 15 Jul 2020. https://arxiv.org/abs/2007.07767

  3. Miriam Enzi, Sophie N. Parragh, David Pisinger, Modeling and solving a vehicle-sharing problem, Submitted on 17 Mar 2020. https://arxiv.org/abs/2003.08207

2019

  1. Lehuédé F, Péton O, Tricoire F.: A lexicographic minimax approach to the vehicle routing problem with route balancing. European Journal of Operational Research. 2019. https://doi.org/10.1016/j.ejor.2019.09.010
  2. Feillet D., Parragh S., Tricoire F.: A local-search based heuristic for the unrestricted block relocation problem, in Computers & Operations Research, vol. 108, pp. 44-56, 2019
  3. Sinnl M.: Algorithmic expedients for the S-labeling problem, in Computers & Operations Research, 2019
  4. Alvarez-Miranda E., Sinnl M.: An exact solution framework for the multiple gradual cover location problem, in Computers & Operations Research, vol. 108, pp. 82 - 96, 2019
  5. Alvarez-Miranda E., Goycoolea M., Ljubic I., Sinnl M.: The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements, in Elsevier, in European Journal of Operational Research, 2019

2018

  1. Wolfinger D., Tricoire F., Doerner K.:A matheuristic for a multimodal long haul routing problem, in EURO Journal on Transportation and Logistics, 2018
  2. Parragh S., Tricoire F.:Branch-and-bound for bi-objective integer programming, in INFORMS Journal On Computing (accepted for publication), 2018
  3. Grabenschweiger J., Tricoire F., Doerner K.: Finding the trade-off between gas emissions and disturbance in an urban context, in Flexible Services and Manufacturing Journal, vol. 30, no. 3, pp. 554, 2018
  4. Tricoire F., Scagnetti J., Beham A.: New insights on the block relocation problem, in Computers & Operations Research, vol. 89, pp. 127, 2018
  5. Parragh S., Dörner K.:Solving routing problems with pairwise synchronization constraints, in Central European Journal of Operational Research, vol. 26, no. 2, pp. 443-464, 2018

2017

  1. 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
  2. Jasmin Grabenschweiger, Fabien Tricoire, and Karl F. Doerner. (2017) Finding the trade-off between gas emissions and disturbance in an urban context. Flexible Services and Manufacturing. Accepted for publication
  3. Fabien Tricoire and Sophie N. Parragh. (2017) Investing in logistics facilities today to reduce routing emissions tomorrow. Transportation Research Part B, 103:56–67. http://doi.org/10.1016/j.trb.2017.03.006
  4. Peter Matl, Pamela Nolz, Ulrike Ritzinger, Mario Ruthmair, and Fabien Tricoire. Bi-objective orienteering for personal activity scheduling. Computers & Operations Research, 82:69–82, 2017
  5. Stefanie Kritzinger, Fabien Tricoire, Karl F. Doerner, and Richard F. Hartl. A unified frame- work for routing problems with fixed fleet size. International Journal of Metaheuristics, 6(3): 160–209, 2017
  6. 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
  7. 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

2016

  1. 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

  2. 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

2015

  1. Stefanie Kritzinger, Fabien Tricoire, Karl F. Doerner, and Richard F. Hartl. Adaptive search techniques for problems in vehicle routing. part i: A survey. Yugoslav Journal of Operations Research, 25(1):3–31, 2015a
  2. Stefanie Kritzinger, Fabien Tricoire, Karl F. Doerner, and Richard F. Hartl. Adaptive search techniques for problems in vehicle routing. part ii: A numerical comparison. Yugoslav Journal of Operations Research, 25(2):169–184, 2015b

  3. 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

  4. 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

  5. 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

  6. 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

2014

  1.  Valentina Cacchiani, Vera C. Hemmelmayr, and Fabien Tricoire. A set covering based heuristic for the periodic vehicle routing problem. Discrete Applied Mathematics, 163(1):53–64, 2014

  2. 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

  3. 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.21522, http://phaidra.univie.ac.at/o:397974

  4. 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-4, http://phaidra.univie.ac.at/o:406859

  5. 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

2013

  1.  Claudia Archetti, Karl F. Doerner, and Fabien Tricoire. A heuristic algorithm for the free newspaper delivery problem. European Journal of Operational Research, 230(2):245–257, 2013
  2. 2. Fabien Tricoire, Nathalie Bostel, Pierre Dejax, and Pierre Guez. Exact and hybrid methods for the multiperiod field service routing problem. Central European Journal of Operations Research, 21(2):359–377, 2013

  3. 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

2012

  1.  Fabien Tricoire, Alexandra Graf, and Walter J. Gutjahr. The bi-objective stochastic covering tour problem. Computers & Operations Research, 39(7):1582–1592, 2012
  2. Fabien Tricoire. Multi-directional local search. Computers & Operations Research, 39(12): 3089–3101, 2012

  3. 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

  4. 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

2011

  1. Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, and Manuel Iori. Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum, 33(4):931–959, 2011
  2. Stefanie Kritzinger, Fabien Tricoire, Karl F. Doerner, and Richard F. Hartl. Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows. In Learning and Intelligent Optimization LION 2011, Lecture Notes in Computer Science, volume 6683, pages 61–75, 2011
  3. Elisabeth Gussmagg-Pfliegl, Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, and Stefan Irnich. Heuristics for a real-world mail delivery problem. In Applications of Evolutionary Computation EvoApplications 2011, Lecture Notes in Computer Sciences, volume 6625, pages 481–490, 2011

  4. Parragh, S.N. (2011). Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C, 19 (5), 912-930. http://dx.doi.org/10.1016/j.trc.2010.06.002

2010

  1. Johannes Strodl, Karl F. Doerner, Fabien Tricoire, and Richard F. Hartl. On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: An application to the 2-dimensional loading vehicle routing problem. In Hybrid Metaheuristics HM 2010, Lecture Notes in Computer Science, volume 6373, pages 160–173, 2010
  2. Fabien Tricoire, Martin Romauch, Karl F. Doerner, and Richard F. Hartl. Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research, 37(2):351–367, 2010

  3. 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

  4. 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

2009

  1. 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

2008

  1. 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

  2. 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

2007

  1.  Fabien Tricoire. Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment. 4OR, 5(2):165–168, 2007

Technical reports

  1. Barthelemy, T., Parragh, S.N. Tricoire, F., Hartl. R.F. (2015). Beam Search for integer multi-objective optimization. http://www.optimization-online.org/DB_HTML/2015/04/4879.htm

  2. Parragh, S.N., Tricoire, F. (2014). Branch-and-bound for bi-objective integer programming. http://www.optimization-online.org/DB_HTML/2014/07/4444.html

Book chapter

  1. Nathalie Bostel, Pierre Dejax, Pierre Guez, and Fabien Tricoire. Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In Bruce L. Golden, S. Raghavan, and Edward A. Wasil, editors, The vehicle routing problem: latest advances and new challenges, pages 503–525. New York, NY: Springer, 2008