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

align trajectories

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.

OR-Library: Distributing Test Problems by Electronic Mail

1990 1.3k citations J. E. Beasley Journal of the Operational Research Society profile →
Heuristics for cardinality constrained portfolio optimisation

2000 621 citations Nigel Meade, J. E. Beasley et al. Computers & Operations Research profile →
A Genetic Algorithm for the Multidimensional Knapsack Problem

1998 552 citations J. E. Beasley et al. profile →
A genetic algorithm for the set covering problem

1996 403 citations J. E. Beasley et al. European Journal of Operational Research profile →

Peers

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

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

20 of 20 papers shown

#	Work	Indexed citations
1	Placental expression of imprinted genes varies with sampling site and mode of delivery 2015 ·Placenta ·(unknown), Simon J. Tunster, (unknown), Amey Holmes, J. E. Beasley, (unknown), R. Penketh, Rosalind M. John	26
2	Packing unequal circles using formulation space search 2012 ·Computers & Operations Research ·(unknown), J. E. Beasley	25
3	Metaheuristics with disposal facility positioning for the waste collection VRP with time windows 2012 ·Optimization Letters ·(unknown), J. E. Beasley	21
4	A heuristic for the circle packing problem with a variety of containers 2011 ·European Journal of Operational Research ·(unknown), J. E. Beasley	51
5	Path finding methods accounting for stoichiometry in metabolic networks 2011 ·Genome biology ·Jon Pey, Joaquín M. Prada, J. E. Beasley, Francisco J. Planes	39
6	Mixed-Integer Programming Approaches for Index Tracking and Enhanced Indexation 2010 ·SSRN Electronic Journal ·J. E. Beasley, (unknown)	12
7	An Evolutionary Heuristic for the Index Tracking Problem 2010 ·SSRN Electronic Journal ·Nigel Meade, (unknown), J. E. Beasley	10
8	A critical examination of stoichiometric and path-finding approaches to metabolic pathways 2008 ·Briefings in Bioinformatics ·Francisco J. Planes, J. E. Beasley	39
9	Path finding approaches and metabolic pathways 2008 ·Discrete Applied Mathematics ·Francisco J. Planes, J. E. Beasley	16
10	A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions 2007 ·Journal of the Operational Research Society ·(unknown), M. Jesús Álvarez, J. E. Beasley	86
11	Scatter search and bionomic algorithms for the aircraft landing problem 2005 ·International Conference on Applied Mathematics ·J. E. Beasley	3
12	Scatter Search and Bionomic Algorithms for the aircraft landing problem 2004 ·European Journal of Operational Research ·(unknown), J. E. Beasley	105
13	A population heuristic for constrained two-dimensional non-guillotine cutting 2003 ·European Journal of Operational Research ·J. E. Beasley	77
14	The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem 2003 ·Neural Networks ·(unknown), J. E. Beasley	69
15	An evolutionary heuristic for the index tracking problem 2003 ·European Journal of Operational Research ·J. E. Beasley, Nigel Meade, (unknown)	219
16	Scheduling aircraft landings at London Heathrow using a population heuristic 2001 ·Journal of the Operational Research Society ·J. E. Beasley, (unknown), (unknown)	122
17	A genetic algorithm for the generalised assignment problem 1997 ·Computers & Operations Research ·(unknown), J. E. Beasley	371
18	A genetic algorithm for the set covering problem breakdown → 1996 ·European Journal of Operational Research ·J. E. Beasley, (unknown)	403
19	A lagrangian heuristic for set-covering problems 1990 ·Naval Research Logistics (NRL) ·J. E. Beasley	179
20	Supercomputers and OR 1987 ·Journal of the Operational Research Society ·J. E. Beasley	6

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