123 citations · 130 across the 10 of their papers we have counts for
11 papers
A heuristic for the non-unicost set covering problem using local branching
John E Beasley
In this paper we present a heuristic for the non-unicost set covering problem using local branching. Local branching eliminates the need to define a problem specific search neighbo…
A two stage approach for order and rack allocation with order backlog in a mobile rack environment
Cristiano Arbex Valle, John E Beasley
In this paper we investigate a problem associated with operating a robotic mobile fulfilment system (RMFS). This is the problem of allocating orders and mobile storage racks to pic…
A discrete optimisation approach for target path planning whilst evading sensors
J. E. Beasley
In this paper we deal with a practical problem that arises in military mission planning. The problem is to plan a path for one, or more, agents to reach a target without being dete…
A nonlinear optimisation model for constructing minimal drawdown portfolios
C. A. Valle, J. E. Beasley
In this paper we consider the problem of minimising drawdown in a portfolio of financial assets. Here drawdown represents the relative opportunity cost of the single best missed tr…
Quantitative portfolio selection: using density forecasting to find consistent portfolios
N. Meade, J. E. Beasley, C. J. Adcock
In the knowledge that the ex-post performance of Markowitz efficient portfolios is inferior to that implied ex-ante, we make two contributions to the portfolio selection literature…
An algorithm for the optimal solution of variable knockout problems
J. E. Beasley
We consider a class of problems related to variable knockout, where knockout means set a variable to zero. Given an optimisation problem formulated as a zero-one integer program th…
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment
Cristiano Arbex Valle, John E Beasley
In this paper we investigate the problem of simultaneously allocating orders and mobile storage racks to static pickers. Here storage racks are allocated to pickers to enable them…
Packing a fixed number of identical circles in a circular container with circular prohibited areas
C. O. Lopez, J. E. Beasley
In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed siz…
Order batching using an approximation for the distance travelled by pickers
Cristiano Arbex Valle, John E Beasley
In this paper we investigate the problem of order batching for picker routing. Our approach is applicable to warehouses (storage areas) arranged in the standard rectangular grid la…
Packing unequal rectangles and squares in a fixed size circular container using formulation space search
C. O. López, J. E. Beasley
In this paper we formulate the problem of packing unequal rectangles/squares into a fixed size circular container as a mixed-integer nonlinear program. Here we pack rectangles so a…
Optimally solving the joint order batching and picker routing problem
Cristiano Arbex Valle, John E Beasley, Alexandre Salles da Cunha
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial…