Towards More Effective Multi-objective Meta-Heuristics to Solve Complex Combinatorial Problems

这一研究项目提出了在多目标组合搜索领域中一些具有挑战性的想法的调查。这一领域的大部分研究都是基于从单目标案例研究中获得的回收知识，这启发了许多单目标技术扩展到其多目标变体。其中许多是进化技术的扩展，如遗传算法、进化策略、粒子群优化等。还有一些其他元启发式算法的扩展，如禁忌搜索和模拟退火法到多目标变量。进化方法在多目标启发式搜索中受到了最多的关注，但我认为应该研究更广泛的元启发式技术。这里提出的研究主题代表着重点的相当大的转移。具体地说，目的是构思更有效的多目标元启发式算法，以比当前技术状态更有效和更高效的方式解决复杂的组合问题。这一提议旨在通过在多目标范式中发展多目标元启发式而不是修改已知的单目标方法来重新思考多目标元启发式的设计。

This research project proposes the investigation of a number of challenging ideas in the field of multi-objective combinatorial search. Most of the research in this area has been based on recycling knowledge acquired from research on the single-objective case and this has inspired the extension of many single-objective techniques to their multi-objective variants. Many of these are extensions from evolutionary techniques such as genetic algorithms, evolutionary strategies, particle swarm optimisation and others. There are some extensions of other meta-heuristics such as tabu search and simulated annealing to multi-objective variants. Evolutionary approaches have received most of the attention in multi-objective heuristic search but I believe that a wider range of meta-heuristic techniques should be investigated. The research themes proposed here represent a considerable shift in emphasis. Specifically, the aim is to conceive more effective multi-objective meta-heuristics to tackle complex combinatorial problems in a more effective and efficient manner than the current state of the art is capable of. This proposal aims to re-think the design of multi-objective meta-heuristics by developing them within the multi-objective paradigm instead of modifying known single-objective approaches.