Traditionally search techniques explore a single space to solve the problem at hand. This paper investigates performing search across more than one space which we refer to as bi-space search. As a proof of concept we illustrate this using the solution and heuristic spaces. In previous work two approaches for combining search across the heuristic and solution spaces have been studied. The first approach, the sequential approach, firstly explores the heuristic space to obtain complete solutions and then applies local search to explore the solution space created by these solutions. The second approach, the interleaving approach, alternates search in the heuristic and solution space on partial solutions until complete solutions are produced. Th...
The 2-constraint bin packing problem consists in packing a given number of items, each one character...
This paper presents a local-search heuristic, based on the simulated annealing (SA) algorithm for a ...
Includes bibliographical references (pages 84-88)A three-dimensional bin-packing problem is\ud consi...
This thesis presents a programme of research which investigated a genetic programming hyper-heuristi...
. The bin packing problem consists in finding the minimum number of bins of given capacity which are...
The well-known one-dimensional Bin Packing Problem (BPP) of whose variants arise in many real life s...
We study an extension of the well-known bin-packing problem to multiple dimensions, resulting in the...
Many combinatorial optimization problems such as the bin packing and multiple knap-sack problems inv...
The on line bin packing problem concerns the packing of pieces into the least number of bins possibl...
The offline 2D bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem in which...
The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes int...
There exists ample literature about on-line and off-line algorithms to solve the two and three dimen...
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems invo...
The variable sized bin packing problem is a generalisation of the one-dimensional bin packing proble...
The online bin packing problem is a well-known bin packing variant which requires immediate decision...
The 2-constraint bin packing problem consists in packing a given number of items, each one character...
This paper presents a local-search heuristic, based on the simulated annealing (SA) algorithm for a ...
Includes bibliographical references (pages 84-88)A three-dimensional bin-packing problem is\ud consi...
This thesis presents a programme of research which investigated a genetic programming hyper-heuristi...
. The bin packing problem consists in finding the minimum number of bins of given capacity which are...
The well-known one-dimensional Bin Packing Problem (BPP) of whose variants arise in many real life s...
We study an extension of the well-known bin-packing problem to multiple dimensions, resulting in the...
Many combinatorial optimization problems such as the bin packing and multiple knap-sack problems inv...
The on line bin packing problem concerns the packing of pieces into the least number of bins possibl...
The offline 2D bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem in which...
The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes int...
There exists ample literature about on-line and off-line algorithms to solve the two and three dimen...
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems invo...
The variable sized bin packing problem is a generalisation of the one-dimensional bin packing proble...
The online bin packing problem is a well-known bin packing variant which requires immediate decision...
The 2-constraint bin packing problem consists in packing a given number of items, each one character...
This paper presents a local-search heuristic, based on the simulated annealing (SA) algorithm for a ...
Includes bibliographical references (pages 84-88)A three-dimensional bin-packing problem is\ud consi...