Tunçhan Cura

636 total citations
14 papers, 452 citations indexed

About

Tunçhan Cura is a scholar working on Industrial and Manufacturing Engineering, Artificial Intelligence and Management Science and Operations Research. According to data from OpenAlex, Tunçhan Cura has authored 14 papers receiving a total of 452 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Industrial and Manufacturing Engineering, 7 papers in Artificial Intelligence and 3 papers in Management Science and Operations Research. Recurrent topics in Tunçhan Cura's work include Metaheuristic Optimization Algorithms Research (7 papers), Vehicle Routing Optimization Methods (6 papers) and Advanced Manufacturing and Logistics Optimization (3 papers). Tunçhan Cura is often cited by papers focused on Metaheuristic Optimization Algorithms Research (7 papers), Vehicle Routing Optimization Methods (6 papers) and Advanced Manufacturing and Logistics Optimization (3 papers). Tunçhan Cura collaborates with scholars based in Türkiye. Tunçhan Cura's co-authors include and has published in prestigious journals such as Expert Systems with Applications, Applied Soft Computing and Knowledge-Based Systems.

In The Last Decade

Tunçhan Cura

14 papers receiving 432 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Tunçhan Cura Türkiye 9 184 167 98 56 51 14 452
William B. Haskell United States 12 112 0.6× 181 1.1× 60 0.6× 20 0.4× 64 1.3× 46 425
Laura Cruz–Reyes Mexico 13 201 1.1× 220 1.3× 141 1.4× 30 0.5× 86 1.7× 76 587
Raj Subbu United States 13 274 1.5× 110 0.7× 69 0.7× 27 0.5× 97 1.9× 36 587
Antonin Ponsich Mexico 11 329 1.8× 146 0.9× 122 1.2× 32 0.6× 108 2.1× 42 714
Nijat Mehdiyev Germany 11 196 1.1× 171 1.0× 58 0.6× 11 0.2× 38 0.7× 27 526
Juan Pérez Chile 11 206 1.1× 49 0.3× 31 0.3× 25 0.4× 40 0.8× 20 463
Jianguo Zheng China 12 99 0.5× 75 0.4× 55 0.6× 19 0.3× 40 0.8× 67 457
Bernard F. Lamond Canada 13 48 0.3× 75 0.4× 59 0.6× 88 1.6× 45 0.9× 40 464
K Darby-Dowman United Kingdom 12 47 0.3× 195 1.2× 128 1.3× 47 0.8× 74 1.5× 31 478
Manfred Grauer Germany 10 57 0.3× 125 0.7× 46 0.5× 23 0.4× 80 1.6× 54 367

Countries citing papers authored by Tunçhan Cura

Since Specialization
Citations

This map shows the geographic impact of Tunçhan Cura's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tunçhan Cura with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tunçhan Cura more than expected).

Fields of papers citing papers by Tunçhan Cura

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tunçhan Cura. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tunçhan Cura. The network helps show where Tunçhan Cura may publish in the future.

No nodes

All Works

14 of 14 papers shown
1.
Cura, Tunçhan. (2023). A parallel mayfly algorithm for the α -neighbor p-center problem. Applied Soft Computing. 144. 110527–110527. 1 indexed citations
2.
Cura, Tunçhan. (2023). Hybridizing local searching with genetic algorithms for the job sequencing and tool switching problem with non-identical parallel machines. Expert Systems with Applications. 223. 119908–119908. 5 indexed citations
3.
Cura, Tunçhan. (2021). A rapidly converging artificial bee colony algorithm for portfolio optimization. Knowledge-Based Systems. 233. 107505–107505. 21 indexed citations
4.
Cura, Tunçhan. (2019). Use of support vector machines with a parallel local search algorithm for data classification and feature selection. Expert Systems with Applications. 145. 113133–113133. 16 indexed citations
5.
Cura, Tunçhan, et al.. (2019). A new use of the ant system algorithm for the max-mean dispersion problem. Computers & Industrial Engineering. 135. 628–642. 1 indexed citations
6.
Cura, Tunçhan. (2015). An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion. International Journal of Operational Research. 22(3). 366–366. 8 indexed citations
7.
Cura, Tunçhan. (2014). An artificial bee colony algorithm approach for the team orienteering problem with time windows. Computers & Industrial Engineering. 74. 270–290. 50 indexed citations
8.
Cura, Tunçhan. (2013). An artificial bee colony approach for the undirected capacitated arc routing problem with profits. International Journal of Operational Research. 17(4). 483–483. 8 indexed citations
9.
Cura, Tunçhan. (2011). A particle swarm optimization approach to clustering. Expert Systems with Applications. 39(1). 1582–1588. 114 indexed citations
10.
Cura, Tunçhan. (2010). A parallel local search approach to solving the uncapacitated warehouse location problem. Computers & Industrial Engineering. 59(4). 1000–1009. 34 indexed citations
11.
Cura, Tunçhan. (2010). A Random Search Approach to Finding the Global Minimum. 3 indexed citations
12.
Cura, Tunçhan. (2008). Modern Sezgisel Teknikler ve Uygulamaları. 9 indexed citations
13.
Cura, Tunçhan. (2008). Particle swarm optimization approach to portfolio optimization. Nonlinear Analysis Real World Applications. 10(4). 2396–2406. 180 indexed citations
14.
Cura, Tunçhan. (2007). Timetabling of Faculty Lectures Using Simulated Annealing Algorithm. DergiPark (Istanbul University). 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026