arXiv · 2611.13940
Tailoring Optimization Approaches with Domain Knowledge in Industry Process for Meta-heuristic Development
Abstract
The paper presents an Industry Process for Meta-heuristic Development (IPMD) schema, a systematic methodology for applying meta- and hyper-heuristic applications to optimization problems. In this context, we present a case study of Balancing Non-dominated Tournament Genetic Programming (BNTGP) applied to solve two NP-hard multi-objective optimization problems: routing (Capacitated Vehicle Routing Problem with Time Windows) and scheduling (Multi-Skill Resource Constrained Project Scheduling Problem). The BNTGP method is based on a metaheuristic design. Its genetic programming-based representation makes BNTGP a hyper-heuristic, as it enables the exploration of a search space of heuristics for solving problems in general. The resulting heuristic can then be applied across a set of problem instances.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jakub Cebula, Konrad Gmyrek, Paweł B. Myszkowski, Marko Đurasević, Łukasz P. Olech, Adam Paliszek-Saładyga. 2026-11-10. Tailoring Optimization Approaches with Domain Knowledge in Industry Process for Meta-heuristic Development. https://searcharxiv.com/abs/2611.13940
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.