Move Acceptance in Local Search Metaheuristics for Cross-domain Heuristic Search
Many real-world combinatorial optimisation problems (COPs) are computationally hard problems and search methods are frequently preferred as solution techniques. Traditionally, an expert with domain knowledge designs, and tailors the search method for solving a particular COP. This process is usuall...
| Main Author: | |
|---|---|
| Format: | Thesis (University of Nottingham only) |
| Language: | English |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/65417/ |