Éric D. Taillard
Éric D. Taillard publishes mostly in Industrial and Manufacturing Engineering, Artificial Intelligence and Automotive Engineering, on topics such as Vehicle Routing Optimization Methods, Transportation and Mobility Innovations and Optimization and Packing Problems.
- World rank
- #154,034 of 7,710,434 ranked researchers
- Rank in Switzerland
- #3,134 of 80,918
- Works
- 88
- Citations
- 14k
- Citations per work
- 159.3
What does Éric D. Taillard research?
Éric D. Taillard's work is mostly in Engineering (47%), Computer Science (21%).
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 Sciences5967.3%
- Engineering4146.7%
- Computer Science1820.6%
- Everything else2932.7%
- 1Industrial and Manufacturing Engineering35% of their works
- 2Artificial Intelligence10% of their works
- 3Automotive Engineering8% of their works
- 4Computational Theory and Mathematics6% of their works
- 5Computer Vision and Pattern Recognition5% of their works
- 6Building and Construction4% of their works
Research topics
- Vehicle Routing Optimization Methods
- Transportation and Mobility Innovations
- Optimization and Packing Problems
- Metaheuristic Optimization Algorithms Research
- Advanced Multi-Objective Optimization Algorithms
- Robotic Path Planning Algorithms
- Data Management and Algorithms
- Scheduling and Optimization Algorithms
Which keywords describe Éric D. Taillard's research?
The keywords of their largest research topics: Heuristic Algorithms, Metaheuristics, Tabu Search, Vehicle Routing Problem, Genetic Algorithm, Evolutionary Algorithms, Particle Swarm Optimization and Cutting.
- Scheduling
- Optimal Motion Planning
- GPS Trajectories
- Multiobjective Optimization
- Ant Colony Optimization
- Ridesharing
- Cutting
- Evolutionary Algorithms
- Vehicle Routing Problem
- Metaheuristics
- Heuristic Algorithms
- Tabu Search
- Genetic Algorithm
- Particle Swarm Optimization
- Packing
- Shared Autonomous Vehicles
- Differential Evolution
- Surrogate Modeling
- Manufacturing
- Sampling-Based Algorithms
- Trajectory Data Mining
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 21 words, with their numbers
- Heuristic Algorithms572 topics
- Metaheuristics552 topics
- Tabu Search401 topic
- Vehicle Routing Problem401 topic
- Genetic Algorithm343 topics
- Evolutionary Algorithms242 topics
- Particle Swarm Optimization242 topics
- Cutting171 topic
- Packing171 topic
- Ridesharing171 topic
- Shared Autonomous Vehicles171 topic
- Ant Colony Optimization151 topic
- Differential Evolution151 topic
- Multiobjective Optimization91 topic
- Surrogate Modeling91 topic
- GPS Trajectories81 topic
- Manufacturing81 topic
- Optimal Motion Planning81 topic
- Sampling-Based Algorithms81 topic
- Scheduling81 topic
- Trajectory Data Mining81 topic
Where does Éric D. Taillard work?
Éric D. Taillard's main affiliation in the publication record is HES-SO University of Applied Sciences and Arts Western Switzerland, Switzerland.
How many publications and citations does Éric D. Taillard have?
OpenAlex counts 88 works and 14,014 citations for Éric D. Taillard, an h-index of 34, ranking #154,034 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 Éric D. Taillard. 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.