World's Best Scientists 2026 revealed!
Günther R. Raidl

Günther R. Raidl

D-Index & Metrics

Computer Science

D-Index
44
Citations
9691
World Ranking
7488
National Ranking
60

Mathematics

D-Index
41
Citations
9090
World Ranking
1877
National Ranking
25

Overview

Günther R. Raidl is affiliated with TU Wien in Austria and has contributed extensively to the fields of Engineering and Computer Science. Their research spans various subfields, with a significant focus on Industrial and Manufacturing Engineering, Artificial Intelligence, Automotive Engineering, Computer Networks and Communications, and Computational Theory and Mathematics.

The scientist's work covers multiple topics within these fields, including:

  • Vehicle Routing Optimization Methods
  • Transportation and Mobility Innovations
  • Algorithms and Data Compression
  • Scheduling and Optimization Algorithms
  • Scheduling and Timetabling Solutions
  • Constraint Satisfaction and Optimization
  • Advanced Graph Theory Research

Frequent publication venues for their research include:

  • arXiv (Cornell University)
  • Applied Soft Computing
  • Energies
  • Computers & Operations Research
  • Procedia Computer Science

Among their recent papers are:

  • "Finding Longest Common Subsequences: New anytime A∗ search results" (2020, Applied Soft Computing)
  • "Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers" (2021, Energies)
  • "A∗-based construction of decision diagrams for a prize-collecting scheduling problem" (2020, Computers & Operations Research)
  • "Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings" (2021, Mathematics)
  • "Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet" (2022, IEEE Access)

Raidl's network of frequent coauthors includes Marko Djukanović, Christian Blum, Tobias Rodemann, Nikolaus Frohner, and Johannes Varga, with each collaborator having contributed alongside Raidl numerous times.

Best Publications

  • Hybrid metaheuristics in combinatorial optimization: A survey

    Christian Blum;Jakob Puchinger;Günther R. Raidl;Andrea Roli

  • Handbook of Metaheuristics

    Unknown

  • Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

    Jakob Puchinger;Günther R. Raidl

  • Evolutionary Computation in Combinatorial Optimization

    Jens Gottlieb;Günther R. Raidl

  • Edge sets: an effective evolutionary coding of spanning trees

    G.R. Raidl;B.A. Julstrom

  • The Multidimensional Knapsack Problem: Structure and Algorithms

    Jakob Puchinger;Günther R. Raidl;Ulrich Pferschy

  • Metaheuristics for solving a multimodal home-healthcare scheduling problem

    Gerhard Hiermann;Matthias Prandtstetter;Andrea Rendl;Jakob Puchinger

  • A unified view on hybrid metaheuristics

    Günther R. Raidl

  • Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization

    Günther R. Raidl;Jakob Puchinger

  • Models and algorithms for three-stage two-dimensional bin packing

    Jakob Puchinger;Günther R. Raidl

  • Balancing bicycle sharing systems: a variable neighborhood search approach

    Marian Rainer-Harbach;Petrina Papazek;Bin Hu;Günther R. Raidl

  • An improved genetic algorithm for the multiconstrained 0-1 knapsack problem

    G.R. Raidl

  • Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case

    Christian Kloimüllner;Petrina Papazek;Bin Hu;Günther R. Raidl

  • Prüfer numbers: a poor representation of spanning trees for evolutionary search

    Jens Gottlieb;Bryant A. Julstrom;Günther R. Raidl;Franz Rothlauf

  • Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

    Günther R. Raidl;Bryant A. Julstrom

  • An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem

    G.R. Raidl

  • Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

    Günther R. Raidl;Jens R. Gottlieb

  • Solving the post enrolment course timetabling problem by ant colony optimization

    Clemens Nothegger;Alfred Mayer;Andreas M. Chwatal;Günther R. Raidl

  • An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem

    Matthias Prandtstetter;Günther R. Raidl

  • A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem

    Günther R. Raidl;Bryant A. Julstrom

  • Part E: Evolutionary Computation

    Frank Neumann;Carsten Witt;Peter Merz;Carlos A. Coello Coello

  • Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

    Martin Gruber;Jano van Hemert;Günther R. Raidl

  • Applications of Evolutionary Computing - EvoWorkshops 2004: EvoBio, EvoComNet, EvoHOT, EvoIASP, EvoMUSART, EvoSTOC, Coimbra, Portugal

    Günther R. Raidl;Stefano Cagnoni;Jürgen Branke;David Wolfe Corne

Frequent Co-Authors

Christian Blum
Christian Blum Spanish National Research Council
Martin Middendorf
Martin Middendorf Leipzig University
Ulrich Pferschy
Ulrich Pferschy University of Graz
David Corne
David Corne Heriot-Watt University
Elena Marchiori
Elena Marchiori Radboud University
Yew-Soon Ong
Yew-Soon Ong Nanyang Technological University
Petra Mutzel
Petra Mutzel University of Bonn
Karl Mechtler
Karl Mechtler Research Institute of Molecular Pathology
Jan-Michael Peters
Jan-Michael Peters Research Institute of Molecular Pathology
Frank Eisenhaber
Frank Eisenhaber Agency for Science, Technology and Research

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Mathematics graduates often explore interdisciplinary fields to enhance their career prospects. One promising direction is pursuing an ms in digital marketing degree cost tuition fees carefully, which combines analytical skills with market insights, offering excellent job opportunities in the evolving digital economy.

For those aiming at leadership roles, business education is a great complement to mathematical expertise. Many students consider one year mba programs that provide an accelerated path to gaining essential business knowledge without a long gap in their career.

Flexibility is key, and online options are popular among professionals. Online MBA programs often incorporate policies like online mba transfer credits, allowing students to make the most of their previous academic work and reduce time and cost.

Additionally, data-driven roles are expanding rapidly. Pursuing data analysis programs enhances capabilities in interpreting complex data — a skill highly sought after in finance, technology, and consulting sectors.

Best Scientists Citing Günther R. Raidl

Trending Scientists