Beatrice M. Ombuki

760 total citations · 1 hit paper
13 papers, 514 citations indexed

About

Beatrice M. Ombuki is a scholar working on Industrial and Manufacturing Engineering, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Beatrice M. Ombuki has authored 13 papers receiving a total of 514 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Industrial and Manufacturing Engineering, 5 papers in Artificial Intelligence and 4 papers in Computational Theory and Mathematics. Recurrent topics in Beatrice M. Ombuki's work include Scheduling and Optimization Algorithms (6 papers), Metaheuristic Optimization Algorithms Research (4 papers) and Advanced Manufacturing and Logistics Optimization (3 papers). Beatrice M. Ombuki is often cited by papers focused on Scheduling and Optimization Algorithms (6 papers), Metaheuristic Optimization Algorithms Research (4 papers) and Advanced Manufacturing and Logistics Optimization (3 papers). Beatrice M. Ombuki collaborates with scholars based in Japan and Canada. Beatrice M. Ombuki's co-authors include Brian J. Ross, Mario Ventresca, Morikazu Nakamura, Osamu Muta, Kenji Onaga and K. Shimabukuro and has published in prestigious journals such as Applied Intelligence, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences and International Journal of Computational Intelligence and Applications.

In The Last Decade

Beatrice M. Ombuki

13 papers receiving 479 citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows

2006 353 citations Beatrice M. Ombuki, Brian J. Ross et al. Applied Intelligence profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Beatrice M. Ombuki Japan	6	398	145	143	81	69	13	514
Andrea Bettinelli Italy	10	362 0.9×	45 0.3×	123 0.9×	103 1.3×	18 0.3×	19	463
Saïd Hanafi France	15	449 1.1×	117 0.8×	72 0.5×	83 1.0×	40 0.6×	21	579
Majid Yousefikhoshbakht Iran	12	313 0.8×	128 0.9×	105 0.7×	102 1.3×	29 0.4×	38	401
J. A. Moreno Spain	6	247 0.6×	91 0.6×	54 0.4×	50 0.6×	32 0.5×	13	392
Shinji Imahori Japan	13	485 1.2×	56 0.4×	175 1.2×	97 1.2×	36 0.5×	44	633
Roberto Carballedo Spain	12	208 0.5×	242 1.7×	30 0.2×	32 0.4×	83 1.2×	25	457
Daniele Ferone Italy	13	457 1.1×	42 0.3×	149 1.0×	126 1.6×	17 0.2×	33	589
Joris Kinable United States	13	435 1.1×	75 0.5×	214 1.5×	208 2.6×	26 0.4×	23	702
Khaled Hadj-Hamou France	11	284 0.7×	85 0.6×	113 0.8×	31 0.4×	69 1.0×	25	535
Carmine Cerrone Italy	12	200 0.5×	59 0.4×	36 0.3×	85 1.0×	57 0.8×	27	352

Countries citing papers authored by Beatrice M. Ombuki

Since Specialization

Citations

This map shows the geographic impact of Beatrice M. Ombuki'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 Beatrice M. Ombuki with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Beatrice M. Ombuki more than expected).

Fields of papers citing papers by Beatrice M. Ombuki

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Beatrice M. Ombuki. 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 Beatrice M. Ombuki. The network helps show where Beatrice M. Ombuki may publish in the future.

Co-authorship network of co-authors of Beatrice M. Ombuki

This figure shows the co-authorship network connecting the top 25 collaborators of Beatrice M. Ombuki. A scholar is included among the top collaborators of Beatrice M. Ombuki based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Beatrice M. Ombuki. Beatrice M. Ombuki is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

13 of 13 papers shown

Ombuki, Beatrice M., et al.. (2006). Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows. Applied Intelligence. 24(1). 17–30. 353 indexed citations breakdown →

Ventresca, Mario & Beatrice M. Ombuki. (2006). Search Space Analysis of Recurrent Spiking and Continuous-time Neural Networks. The 2006 IEEE International Joint Conference on Neural Network Proceedings. 4514–4521. 2 indexed citations

Ventresca, Mario & Beatrice M. Ombuki. (2005). A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS. International Journal of Computational Intelligence and Applications. 5(2). 267–281. 3 indexed citations

Ombuki, Beatrice M. & Mario Ventresca. (2004). Local Search Genetic Algorithms for the Job Shop Scheduling Problem. Applied Intelligence. 21(1). 99–109. 98 indexed citations

Nakamura, Morikazu, et al.. (2003). A genetic algorithm approach to vehicle routing problem with time deadlines in geographical information systems. 4. 595–600. 9 indexed citations

Ombuki, Beatrice M., et al.. (2003). Evolutionary computation for topological optimization of 3-connected computer networks. 1. 659–664. 6 indexed citations

Ombuki, Beatrice M., Morikazu Nakamura, Osamu Muta, Beatrice M. Ombuki, & Morikazu Nakamura. (2002). A HYBRID SEARCH BASED ON GENETIC ALGORITHMS AND TABU SEARCH FOR VEHICLE ROUTING. 54–5. 28 indexed citations

Ombuki, Beatrice M., Morikazu Nakamura, & Kenji Onaga. (2002). Experimental evaluation of an evolutionary scheduling scheme for the job shop scheduling problem. 3. 197–201. 2 indexed citations

Nakamura, Morikazu, et al.. (2002). Cyclic job-shop-scheduling based on evolutionary Petri nets. 4. 2855–2860. 2 indexed citations

10.

Ombuki, Beatrice M.. (2001). An Evolutionary Algorithm Approach to the Design of Minimum Cost Survivable Networks with Bounded Rings. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 84(6). 1545–1548. 3 indexed citations

11.

Ombuki, Beatrice M., Morikazu Nakamura, & Kenji Onaga. (1998). An Evolutionary Scheduling Scheme Based on gkGA Approach to the job Shop Scheduling Problem(Special Section of Papers Selected from ITC-CSCC'97). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(6). 1063–1071. 5 indexed citations

12.

Nakamura, Morikazu, Beatrice M. Ombuki, K. Shimabukuro, & Kenji Onaga. (1998). A new hybrid GA solution to combinatorial optimization problems— an application to the multiprocessor scheduling problem. Artificial Life and Robotics. 2(2). 74–79. 2 indexed citations

13.

Ombuki, Beatrice M., Morikazu Nakamura, & Kenji Onaga. (1997). A Hybridized GA Approach to the Job Shop Problem. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 483–486. 1 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