J. E. Beasley

15.3k total citations · 4 hit papers
113 papers, 10.6k citations indexed

About

J. E. Beasley is a scholar working on Industrial and Manufacturing Engineering, Management Science and Operations Research and Automotive Engineering. According to data from OpenAlex, J. E. Beasley has authored 113 papers receiving a total of 10.6k indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Industrial and Manufacturing Engineering, 29 papers in Management Science and Operations Research and 14 papers in Automotive Engineering. Recurrent topics in J. E. Beasley's work include Vehicle Routing Optimization Methods (35 papers), Optimization and Packing Problems (23 papers) and Advanced Manufacturing and Logistics Optimization (14 papers). J. E. Beasley is often cited by papers focused on Vehicle Routing Optimization Methods (35 papers), Optimization and Packing Problems (23 papers) and Advanced Manufacturing and Logistics Optimization (14 papers). J. E. Beasley collaborates with scholars based in United Kingdom, Spain and Mexico. J. E. Beasley's co-authors include N.D. Christofides, Yazid M. Sharaiha, Nigel Meade, Mohan Krishnamoorthy, David Abramson, Francisco J. Planes, C. Lucas, Kurt Jörnsten, Buyang Cao and M. Jesús Álvarez and has published in prestigious journals such as Bioinformatics, European Journal of Operational Research and Genome biology.

In The Last Decade

J. E. Beasley

112 papers receiving 9.9k citations

Hit Papers

OR-Library: Distributing ... 1990 2026 2002 2014 1990 2000 1998 1996 400 800 1.2k
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.

  1. OR-Library: Distributing Test Problems by Electronic Mail
    1990 1.3k citations J. E. Beasley Journal of the Operational Research Society profile →
  2. Heuristics for cardinality constrained portfolio optimisation
    2000 621 citations Nigel Meade, J. E. Beasley et al. Computers & Operations Research profile →
  3. A Genetic Algorithm for the Multidimensional Knapsack Problem
    1998 552 citations J. E. Beasley et al. Journal of Heuristics profile →
  4. A genetic algorithm for the set covering problem
    1996 403 citations J. E. Beasley et al. European Journal of Operational Research profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
J. E. Beasley 5.1k 3.0k 1.6k 1.3k 1.2k 113 10.6k
Marshall L. Fisher 6.1k 1.2× 2.6k 0.9× 1.5k 1.0× 2.5k 2.0× 949 0.8× 102 18.1k
Jonathan F. Bard 4.7k 0.9× 2.9k 1.0× 486 0.3× 640 0.5× 2.4k 2.1× 229 10.5k
James B. Orlin 3.3k 0.7× 1.4k 0.5× 1.5k 1.0× 3.9k 3.0× 1.0k 0.9× 156 12.4k
Warren B. Powell 3.0k 0.6× 2.2k 0.7× 2.3k 1.4× 1.2k 0.9× 2.6k 2.2× 269 12.6k
David Simchi‐Levi 4.3k 0.8× 3.0k 1.0× 394 0.3× 1.1k 0.9× 664 0.6× 266 13.8k
Hanif D. Sherali 3.2k 0.6× 1.6k 0.5× 596 0.4× 3.4k 2.6× 2.2k 1.9× 360 13.0k
Manuel Laguna 5.6k 1.1× 1.8k 0.6× 2.8k 1.8× 2.2k 1.7× 1.0k 0.9× 135 11.3k
Thomas L. Magnanti 3.5k 0.7× 974 0.3× 645 0.4× 2.7k 2.1× 1.4k 1.2× 92 10.9k
Mitsuo Gen 7.8k 1.5× 2.3k 0.8× 3.0k 1.9× 1.3k 1.0× 3.1k 2.6× 400 16.3k
Laurence A. Wolsey 7.1k 1.4× 2.2k 0.7× 2.3k 1.5× 4.4k 3.4× 2.5k 2.1× 156 17.7k

Countries citing papers authored by J. E. Beasley

Since Specialization
Citations

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

Fields of papers citing papers by J. E. Beasley

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of J. E. Beasley

This figure shows the co-authorship network connecting the top 25 collaborators of J. E. Beasley. A scholar is included among the top collaborators of J. E. Beasley 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 J. E. Beasley. J. E. Beasley is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Beasley, J. E., et al.. (2017). Optimally solving the joint order batching and picker routing problem. European Journal of Operational Research. 262(3). 817–834. 78 indexed citations
2.
Tunster, Simon J., et al.. (2015). Placental expression of imprinted genes varies with sampling site and mode of delivery. Placenta. 36(8). 790–795. 26 indexed citations
3.
Pey, Jon, et al.. (2014). Advances in network-based metabolic pathway analysis and gene expression data integration. Briefings in Bioinformatics. 16(2). 265–279. 22 indexed citations
4.
Pey, Jon, Kaspar Valgepea, Ángel Rubio, J. E. Beasley, & Francisco J. Planes. (2013). Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways. BMC Systems Biology. 7(1). 134–134. 6 indexed citations
5.
Beasley, J. E., et al.. (2012). Metaheuristics with disposal facility positioning for the waste collection VRP with time windows. Optimization Letters. 7(7). 1433–1449. 21 indexed citations
6.
Pey, Jon, Joaquín M. Prada, J. E. Beasley, & Francisco J. Planes. (2011). Path finding methods accounting for stoichiometry in metabolic networks. Genome biology. 12(5). R49–R49. 39 indexed citations
7.
Beasley, J. E., et al.. (2011). A heuristic for the circle packing problem with a variety of containers. European Journal of Operational Research. 214(3). 512–525. 51 indexed citations
8.
Beasley, J. E., et al.. (2010). Mixed-Integer Programming Approaches for Index Tracking and Enhanced Indexation. SSRN Electronic Journal. 12 indexed citations
9.
Meade, Nigel, et al.. (2010). An Evolutionary Heuristic for the Index Tracking Problem. SSRN Electronic Journal. 10 indexed citations
10.
Beasley, J. E., et al.. (2010). Optimisation of sludge treatment and transport. Journal of the Operational Research Society. 62(6). 939–948. 6 indexed citations
11.
Planes, Francisco J. & J. E. Beasley. (2008). Path finding approaches and metabolic pathways. Discrete Applied Mathematics. 157(10). 2244–2256. 16 indexed citations
12.
Beasley, J. E., et al.. (2008). Mixed-integer programming approaches for index tracking and enhanced indexation. European Journal of Operational Research. 196(1). 384–399. 161 indexed citations
13.
Planes, Francisco J. & J. E. Beasley. (2008). A critical examination of stoichiometric and path-finding approaches to metabolic pathways. Briefings in Bioinformatics. 9(5). 422–436. 39 indexed citations
14.
Beasley, J. E.. (2005). Scatter search and bionomic algorithms for the aircraft landing problem. International Conference on Applied Mathematics. 2. 3 indexed citations
15.
Beasley, J. E., et al.. (2003). The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem. Neural Networks. 16(10). 1499–1525. 69 indexed citations
16.
Beasley, J. E.. (2003). A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research. 156(3). 601–627. 77 indexed citations
17.
Beasley, J. E., et al.. (2002). Improving short-term conflict alert via tabu search. Journal of the Operational Research Society. 53(6). 593–602. 8 indexed citations
18.
Beasley, J. E., et al.. (1998). Constraint Handling in Genetic Algorithms: The Set Partitioning Problem. Journal of Heuristics. 4(4). 323–357. 59 indexed citations
19.
Beasley, J. E., et al.. (1997). A genetic algorithm for the generalised assignment problem. Computers & Operations Research. 24(1). 17–23. 371 indexed citations
20.
Beasley, J. E., et al.. (1996). The Vehicle Routing-Allocation Problem: A unifying framework. Top. 4(1). 65–86. 36 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

Breakdown of academic impact, for papers by Marshall L. Fisher Breakdown of academic impact, for papers by Jonathan F. Bard Breakdown of academic impact, for papers by James B. Orlin Breakdown of academic impact, for papers by Warren B. Powell Breakdown of academic impact, for papers by David Simchi‐Levi Breakdown of academic impact, for papers by Hanif D. Sherali Breakdown of academic impact, for papers by Manuel Laguna Breakdown of academic impact, for papers by Thomas L. Magnanti Breakdown of academic impact, for papers by Mitsuo Gen Breakdown of academic impact, for papers by Laurence A. Wolsey
Rankless by CCL
2026