Search Results - "Beasley, J.E."

An optimisation model for minimising changes in frequency allocations by Beasley, J.E.

“…•We consider a problem associated with frequency assignment.•The problem is to make frequency allocation changes so as to minimise unrequested changes whilst…”
Get full text

Heuristic algorithms for the cardinality constrained efficient frontier by Woodside-Oriakhi, M., Lucas, C., Beasley, J.E.

“…► Finding the cardinality constrained efficient frontier in portfolio optimisation. ► Metaheuristic algorithms are used. ► Good quality results are achieved…”
Get full text

A formulation space search heuristic for packing unequal circles in a fixed size circular container by López, C.O., Beasley, J.E.

“…•First paper to consider packing unequal circles in a fixed size circular container,•Proves the optimal solution has a particular form when maximising number…”
Get full text

Scatter Search and Bionomic Algorithms for the aircraft landing problem by Pinol, H., Beasley, J.E.

“…The problem of deciding how to land aircraft approaching an airport involves assigning each aircraft to an appropriate runway, computing a landing sequence for…”
Get full text

A population heuristic for constrained two-dimensional non-guillotine cutting by Beasley, J.E.

“…In this paper we present a heuristic algorithm for the constrained two-dimensional non-guillotine cutting problem. This is the problem of cutting a number of…”
Get full text

A genetic algorithm for the set covering problem by Beasley, J.E, Chu, P.C

“…In this paper we present a genetic algorithm-based heuristic for non-unicost set covering problems. We propose several modifications to the basic genetic…”
Get full text

A tree search algorithm for the crew scheduling problem by Beasley, J.E., Cao, B.

“…In this paper we consider the crew scheduling program, that is the problem of assigning K crews to N tasks with fixed start and finish times such that each…”
Get full text

A discrete optimisation approach for target path planning whilst evading sensors by Beasley, J.E.

“…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…”
Get full text

A dynamic programming based algorithm for the crew scheduling problem by Beasley, J.E., Cao, B.

“…A dynamic programming based algorithm for the crew scheduling problem. There are many papers concerned with the crew scheduling problem in the literature. Most…”
Get full text

A heuristic for the non‐unicost set covering problem using local branching by Beasley, J.E.

“…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…”
Get full text

Quantitative portfolio selection: Using density forecasting to find consistent portfolios by Meade, N., Beasley, J.E., Adcock, C.J.

“…•We consider 2 approaches to overcome optimistically biased ex-ante efficient frontier.•Density forecasts: use/develop Berkowitz statistic to identify…”
Get full text

Portfolio rebalancing with an investment horizon and transaction costs by Woodside-Oriakhi, M., Lucas, C., Beasley, J.E.

“…In this paper we consider the problem of rebalancing an existing financial portfolio, where transaction costs have to be paid if we change the amount held of…”
Get full text

Allocating fixed costs and resources via data envelopment analysis by Beasley, J.E

“…In this paper we show that data envelopment analysis (DEA) can be viewed as maximising the average efficiency of the decision-making units (DMUs) in an…”
Get full text

Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, A.M., Beasley, J.E.

“…In this problem there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of homogeneous vehicles…”
Get full text

Mixed-integer programming approaches for index tracking and enhanced indexation by Canakgoz, N.A., Beasley, J.E.

“…We consider the problem of reproducing the performance of a stock market index, but without purchasing all of the stocks that make up the index, index…”
Get full text

Packing unequal rectangles and squares in a fixed size circular container using formulation space search by López, C.O., Beasley, J.E.

“…•New formulation for the problem of packing unequal rectangles/squares in a fixed size circular container.•Heuristic based on formulation space search, a new…”
Get full text

A heuristic for the circle packing problem with a variety of containers by López, C.O., Beasley, J.E.

“…► Heuristic algorithm applicable to a variety of containers. ► Improves on previously best known results for some containers. ► Computationally effective…”
Get full text

Packing unequal circles using formulation space search by López, C.O., Beasley, J.E.

“…In this paper we present a heuristic algorithm for the problem of packing unequal circles in a fixed size container such as the unit circle, the unit square or…”
Get full text

Heuristics for cardinality constrained portfolio optimisation by Chang, T.-J., Meade, N., Beasley, J.E., Sharaiha, Y.M.

“…In this paper we consider the problem of finding the efficient frontier associated with the standard mean–variance portfolio optimisation model. We extend the…”
Get full text

An evolutionary heuristic for the index tracking problem by Beasley, J.E., Meade, N., Chang, T.-J.

“…Index tracking is a popular form of passive fund management. The index tracking problem is the problem of reproducing the performance of a stock market index,…”
Get full text