Beasley J.E.

J.E. Beasley

Information about the author J.E. Beasley will soon be added to the site.
Found 29 papers in total
A tabu search algorithm for the single vehicle routing allocation problem
2007
In the single vehicle routing allocation problem (SVRAP) we have a single vehicle,...
Scatter search and bionomic algorithms for the aircraft landing problem
2006
The problem of deciding how to land aircraft approaching an airport involves assigning...
A population heuristic for constrained two-dimensional non-guillotine cutting
2004
In this paper we present a heuristic algorithm for the constrained two-dimensional...
An iterative construction heuristic for the ore selection problem
2004
The ore selection problem involves choosing a processing option for a number of mining...
An evolutionary heuristic for the index tracking problem
2003
Index tracking is a popular form of passive fund management. The index tracking...
Displacement problem and dynamically scheduling aircraft landings
2004
In this paper we define a generic decision problem – the displacement problem....
Allocating fixed costs and resources via data envelopment analysis
2003
In this paper we show that data envelopment analysis (DEA) can be viewed as maximising...
Improving short-term conflict alert via tabu search
2002
In this paper we describe some work carried out by National Air Traffic Services in...
A branch and cut algorithm for the Steiner problem in graphs
1998
In this paper, we consider the Steiner problem in graphs, which is the problem of...
Scheduling aircraft landings at London Heathrow using a population heuristic
2001
With increasing levels of air traffic, making effective use of limited airport...
Placing boxes on shelves: A case study
2001
This case study paper describes work undertaken for a major UK high street retailer,...
Scheduling aircraft landings – the static case
2000
In this paper, we consider the problem of scheduling aircraft (plane) landings at an...
Heuristics for cardinality constrained portfolio optimisation
2000
In this paper we consider the problem of finding the efficient frontier associated...
A genetic algorithm for the multidimensional knapsack problem
1998
In this paper we present a heuristic based upon genetic algorithms for the...
Constraint handling in genetic algorithms: The set partitioning problem
1998
In this paper we present a genetic algorithm-based heuristic for solving the set...
A dynamic programming based algorithm for the crew scheduling problem
1998
In this paper we consider the crew scheduling problem, that is the problem of...
Vehicle routing with a sparse feasibility graph
1997
In this paper we introduce the concept of a feasibility graph for vehicle routing...
A genetic algorithm for the set covering problem
1996
In this paper we present a genetic algorithm-based heuristic for non-unicost set...
A tree search algorithm for the crew scheduling problem
1996
In this paper we consider the crew scheduling problem, that is the problem of...
A genetic algorithm for the generalised assignment problem
1997
In this paper the authors present a genetic algorithm (GA)-based heuristic for solving...
Lagrangean heuristics for location problems
1993
The paper presents a framework for developing Lagrangean heuristics (heuristics based...
A heuristic for Euclidean and rectilinear Steiner problems
1992
This paper presents a heuristic for Euclidean and rectilinear Steiner problems. This...
Enhancing an algorithm for set covering problems
1992
In this note the authors present enhancements to a previously published algorithm for...
Determining teaching and research efficiencies
1995
This paper considers the problem of determing teaching and research efficiencies for...
Papers per page: