| dc.creator |
Zapiti, Maria |
|
| dc.date |
2017-03-31T07:21:35Z |
|
| dc.date |
2017-03-31T07:21:35Z |
|
| dc.date.accessioned |
2022-05-26T10:12:44Z |
|
| dc.date.available |
2022-05-26T10:12:44Z |
|
| dc.identifier |
https://rdmc.nottingham.ac.uk/handle/internal/168 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/202188 |
|
| dc.description |
The Problem:
Real-world problems are usually (if not always) considered hard to be solved because:
* Problems cannot always be represented and solved with a straightforward mathematical approach.
* A lot of parameters and constraints are involved.
* The number of possible solutions to a problem can be huge.
* Good solutions need to be found fast
* Checking every possible solution, for finding the best one, is time consuming and sometimes not even feasible.
* The quality of a solution may vary according to time, thereby; more than one different solution might be required.
Heuristic Search:
Heuristic search refers to techniques with the aim of finding ‘good’ solutions for a very hard optimization and decision within a reasonable amount of computation time.
Heuristic Local Search:
* A basic heuristic search technique that works with complete solutions and seeks to find better solutions by making small local changes.
* All heuristic search techniques share similar concepts; e.g. the search space, feasible/infeasible solutions, neighbourhoods, and the relation(s) between neighbours.
* Good understanding of the above concepts and how a basic local search works, is a key knowledge necessary to anyone who wishes to learn and work with heuristic and metaheuristic algorithms for solving hard real-world optimization problems. |
|
| dc.publisher |
University of Nottingham. Information Services. Learning Team |
|
| dc.rights |
Attribution-NonCommercial-ShareAlike 2.0 UK |
|
| dc.rights |
https://creativecommons.org/licenses/by-nc-sa/2.0/uk/ |
|
| dc.rights |
Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA) (URL: http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ ). Your use of the content provided in this resource is subject to the terms of the copyright statement available here: http://unow.nottingham.ac.uk/copyright.aspx |
|
| dc.title |
Heuristic local search tutorial |
|