World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
57
Citations
21778
World Ranking
3744
National Ranking
225

Mathematics

D-Index
56
Citations
21601
World Ranking
716
National Ranking
52

Overview

John E. Beasley is affiliated with Brunel University London in the United Kingdom. Their research spans several interconnected fields primarily within engineering and computer science.

Beasley's main fields of study include:

  • Engineering
  • Computer Science

Their work focuses on several subfields including:

  • Industrial and Manufacturing Engineering
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Civil and Structural Engineering

Key research topics covered by Beasley involve:

  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Search Problems
  • Vehicle Routing Optimization Methods
  • Robotic Path Planning Algorithms
  • Metaheuristic Optimization Algorithms Research
  • Optimization and Packing Problems
  • Infrastructure Resilience and Vulnerability Analysis

Frequent publication venues for Beasley's research include:

  • arXiv (Cornell University)
  • Computers & Operations Research
  • International Transactions in Operational Research
  • Annals of Operations Research
  • European Journal of Operational Research

Notable recent papers authored or coauthored by Beasley are:

  • A heuristic for the non-unicost set covering problem using local branching, 2024, International Transactions in Operational Research
  • A discrete optimisation approach for target path planning whilst evading sensors, 2021, Computers & Operations Research
  • Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment, 2020, Computers & Operations Research
  • Order batching using an approximation for the distance travelled by pickers, 2020, European Journal of Operational Research
  • A two stage approach for order and rack allocation with order backlog in a mobile rack environment, 2024, Annals of Operations Research

Beasley frequently collaborates with Cristiano Arbex Valle, with whom they have coauthored several publications.

Best Publications

  • OR-Library: Distributing Test Problems by Electronic Mail

    J. E. Beasley

  • A Genetic Algorithm for the Multidimensional Knapsack Problem

    P. C. Chu;J. E. Beasley

  • Heuristics for cardinality constrained portfolio optimisation

    T.-J. Chang;N. Meade;J. E. Beasley;Y. M. Sharaiha

  • A genetic algorithm for the set covering problem

    J.E Beasley;P.C Chu

  • A genetic algorithm for the generalised assignment problem

    P. C. Chu;J. E. Beasley

  • Restricting Weight Flexibility in Data Envelopment Analysis

    Y.-H. B. Wong;J. E. Beasley

  • An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure

    J. E. Beasley

  • Scheduling Aircraft Landings--The Static Case

    J. E. Beasley;M. Krishnamoorthy;Y. M. Sharaiha;D. Abramson

  • Determining Teaching and Research Efficiencies

    J. E. Beasley

  • Route first—Cluster second methods for vehicle routing

    JE Beasley

  • An evolutionary heuristic for the index tracking problem

    John E. Beasley;Nigel Meade;T.-J. Chang

  • Lagrangean heuristics for location problems

    J.E. Beasley

  • The period routing problem

    Nicos Christofides;John E. Beasley

  • Comparing university departments

    J.E. Beasley

  • Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

    J. E. Beasley

  • An algorithm for the resource constrained shortest path problem

    John E. Beasley;Nicos Christofides

  • An algorithm for set covering problem

    J.E. Beasley

  • Allocating fixed costs and resources via data envelopment analysis

    John E. Beasley

  • A lagrangian heuristic for set-covering problems

    J. E. Beasley

  • Mixed-integer programming approaches for index tracking and enhanced indexation

    N. A. Canakgoz;John E. Beasley

Frequent Co-Authors

Nigel Meade
Nigel Meade Imperial College London
Mohan Krishnamoorthy
Mohan Krishnamoorthy University of Queensland
David Abramson
David Abramson University of Queensland
Stefan Schuster
Stefan Schuster Friedrich Schiller University Jena

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can enhance career prospects. For those interested in leadership roles, online dba programs offer advanced business administration training focused on strategic decision-making and data analysis, bridging math skills with executive management.

Finance professionals greatly benefit from mathematical proficiency. Pursuing online masters in finance programs equips students with quantitative analysis, risk management, and financial modeling expertise—key areas that align well with a math background.

Alternatively, those aiming for versatile business roles might consider fastest online mba programs, designed to accelerate career growth without sacrificing educational quality. These programs help sharpen leadership, analytics, and strategic thinking skills essential in today’s competitive job market.

Marketing is another expanding field where data analytics and quantitative methods are vital. A masters degree in marketing offers students the chance to leverage mathematical concepts to analyze consumer behavior and optimize campaigns, blending creativity with analytical rigor.

Best Scientists Citing John E. Beasley

Trending Scientists