Rafael Martı́
Rafael Martı́ publishes mostly in Industrial and Manufacturing Engineering, Artificial Intelligence and Computational Theory and Mathematics, on topics such as Vehicle Routing Optimization Methods, Metaheuristic Optimization Algorithms Research and Advanced Multi-Objective Optimization Algorithms.
- World rank
- #37,537 of 7,710,434 ranked researchers
- Rank in Spain
- #374 of 204,306
- Works
- 255
- Citations
- 11k
- Citations per work
- 41.2
What does Rafael Martı́ research?
Rafael Martı́'s work is mostly in Computer Science (44%), Engineering (24%).
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 Sciences17367.8%
- Computer Science11143.7%
- Engineering6124.1%
- Everything else8232.2%
- 1Industrial and Manufacturing Engineering24% of their works
- 2Artificial Intelligence17% of their works
- 3Computational Theory and Mathematics10% of their works
- 4Computer Networks and Communications7% of their works
- 5Computer Vision and Pattern Recognition6% of their works
- 6Signal Processing4% of their works
Research topics
- Vehicle Routing Optimization Methods
- Metaheuristic Optimization Algorithms Research
- Advanced Multi-Objective Optimization Algorithms
- Optimization and Packing Problems
- Data Management and Algorithms
- Optimization and Search Problems
- Computational Geometry and Mesh Generation
- Constraint Satisfaction and Optimization
Which keywords describe Rafael Martı́'s research?
The keywords of their largest research topics: Metaheuristics, Heuristic Algorithms, Evolutionary Algorithms, Particle Swarm Optimization, Tabu Search, Vehicle Routing Problem, Genetic Algorithm and Ant Colony Optimization.
- Constraint Optimization
- Delaunay Triangulations
- Mobile Robots
- GPS Trajectories
- Cutting
- Multiobjective Optimization
- Ant Colony Optimization
- Vehicle Routing Problem
- Particle Swarm Optimization
- Heuristic Algorithms
- Metaheuristics
- Evolutionary Algorithms
- Tabu Search
- Genetic Algorithm
- Differential Evolution
- Surrogate Modeling
- Packing
- Trajectory Data Mining
- Online Algorithms
- Mesh Generation
- Distributed Algorithms
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
- Metaheuristics1852 topics
- Heuristic Algorithms1442 topics
- Evolutionary Algorithms1212 topics
- Particle Swarm Optimization1212 topics
- Tabu Search1071 topic
- Vehicle Routing Problem1071 topic
- Genetic Algorithm802 topics
- Ant Colony Optimization781 topic
- Differential Evolution781 topic
- Multiobjective Optimization431 topic
- Surrogate Modeling431 topic
- Cutting371 topic
- Packing371 topic
- GPS Trajectories281 topic
- Trajectory Data Mining281 topic
- Mobile Robots261 topic
- Online Algorithms261 topic
- Delaunay Triangulations231 topic
- Mesh Generation231 topic
- Constraint Optimization221 topic
- Distributed Algorithms221 topic
Where does Rafael Martı́ work?
Rafael Martı́'s main affiliation in the publication record is Universitat de València, Spain.
How many publications and citations does Rafael Martı́ have?
OpenAlex counts 255 works and 10,505 citations for Rafael Martı́, an h-index of 52, ranking #37,537 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 Rafael Martı́. 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.