123 citations · 130 across the 10 of their papers we have counts for
9 papers · 1 filter
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…
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…