Details of Grant 

EPSRC Reference:	GR/S52414/01
Title:	An Investigation of Cutting/Packing and Planning using Automated Algorithm Selection
Principal Investigator:	Kendall, Professor G
Other Investigators:	Burke, Professor EK Bennell, Professor J
Researcher Co-Investigators:
Project Partners:	Gower Optimal Algorithms Ltd
Department:	School of Computer Science
Organisation:	University of Nottingham
Scheme:	Standard Research (Pre-FEC)
Starts:	02 February 2004	Ends:	01 February 2007	Value (£):	153,670
EPSRC Research Topic Classifications:	Manufacturing Machine & Plant
EPSRC Industrial Sector Classifications:	Manufacturing
Related Grants:	GR/S52421/01
Panel History:
Summary on Grant Application Form
To date, an effective NFP algorithm has eluded researchers thus making this effective tool unavailable for general use (both academic and commercial). The no fit polygon (NFP) is a powerful, geometric concept that has the potential to allow advances in many domains. This proposal, initially, aims to realise a robust algorithm(s) for the NFP. This is high risk, adventurous research yet, if it can be achieved it opens up many research directions which have not been possible before now. Once robust algorithm(s) have beer, developed we ::!!! investigate he,.-; they can be used !n the context of two domains. However, we will not simply apply the algorithm to the two domains. We will investigate how, when presented with a given problem instance, the selection of the best NFP algorithm is automated in order to solve that problem. Indeed, the approach we develop could select different NFP algorithms, to solve a single problem instance as the nature of the problem will change during the course of search. If this program of research is successful, not only would it present the research community with a robust algorithm for the first time but it will also present a framework that will automate the selection process when a user is presented with a problem they are asked to solve. In order to achieve this we will define a typology for NFP oroblems/aloorithms and use this tvooloav to choose which algorithm to aoolv for the particular ooint in the search space
Key Findings
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
Potential use in non-academic contexts
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
Impacts
Description This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk Summary Date Materialised
Sectors submitted by the Researcher
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
Project URL:
Further Information:
Organisation Website:	http://www.nottingham.ac.uk