Günther Robert Raidl
Günther Robert Raidl publishes mostly in Industrial and Manufacturing Engineering, Artificial Intelligence and Computer Networks and Communications, on topics such as Vehicle Routing Optimization Methods, Optimization and Packing Problems and Metaheuristic Optimization Algorithms Research.
- World rank
- #488,050 of 7,710,434 ranked researchers
- Rank in Austria
- #3,182 of 43,330
- Works
- 321
- Citations
- 7k
- Citations per work
- 21.7
What does Günther Robert Raidl research?
Günther Robert Raidl's work is mostly in Engineering (42%), Computer Science (28%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences22570.0%
- Engineering13542.1%
- Computer Science9027.9%
- Everything else9630.0%
- 1Industrial and Manufacturing Engineering31% of their works
- 2Artificial Intelligence14% of their works
- 3Computer Networks and Communications8% of their works
- 4Computational Theory and Mathematics6% of their works
- 5Electrical and Electronic Engineering6% of their works
- 6Automotive Engineering5% of their works
Research topics
- Vehicle Routing Optimization Methods
- Optimization and Packing Problems
- Metaheuristic Optimization Algorithms Research
- Scheduling and Optimization Algorithms
- Transportation and Mobility Innovations
- Evolutionary Algorithms and Applications
- Constraint Satisfaction and Optimization
- Advanced Manufacturing and Logistics Optimization
Which keywords describe Günther Robert Raidl's research?
The keywords of their largest research topics: Heuristic Algorithms, Metaheuristics, Tabu Search, Vehicle Routing Problem, Genetic Algorithm, Evolutionary Algorithms, Cutting and Packing.
- Warehouse Design
- Distributed Algorithms
- Machine Learning
- Shared Autonomous Vehicles
- Scheduling
- Particle Swarm Optimization
- Packing
- Evolutionary Algorithms
- Vehicle Routing Problem
- Metaheuristics
- Heuristic Algorithms
- Tabu Search
- Genetic Algorithm
- Cutting
- Differential Evolution
- Manufacturing
- Ridesharing
- Genetic Programming
- Constraint Optimization
- Order Picking
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 20 words, with their numbers
- Heuristic Algorithms1882 topics
- Metaheuristics1742 topics
- Tabu Search1251 topic
- Vehicle Routing Problem1251 topic
- Genetic Algorithm1022 topics
- Evolutionary Algorithms792 topics
- Cutting631 topic
- Packing631 topic
- Differential Evolution491 topic
- Particle Swarm Optimization491 topic
- Manufacturing391 topic
- Scheduling391 topic
- Ridesharing361 topic
- Shared Autonomous Vehicles361 topic
- Genetic Programming301 topic
- Machine Learning301 topic
- Constraint Optimization281 topic
- Distributed Algorithms281 topic
- Order Picking281 topic
- Warehouse Design281 topic
Where does Günther Robert Raidl work?
Günther Robert Raidl's main affiliation in the publication record is TU Wien, Austria.
How many publications and citations does Günther Robert Raidl have?
OpenAlex counts 321 works and 6,968 citations for Günther Robert Raidl, an h-index of 40, ranking #488,050 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Günther Robert Raidl. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.