cs.NENov 10, 2026

Tailoring Optimization Approaches with Domain Knowledge in Industry Process for Meta-heuristic Development

Authors: Jakub Cebula, Konrad Gmyrek, Paweł B. Myszkowski, Marko Đurasević, Łukasz P. Olech, Adam Paliszek-Saładyga

Organizations: Wrocław University of Science and Technology, Faculty of Information and Communication Technology, ul. Ignacego Łukasiewicza 5, 50-371 Wrocław, Poland · University of Zagreb, Faculty of Electrical Engineering and Computing, Unska ul. 3, 10000 Zagreb, Croatia · Melbourne, Victoria, Australia

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.

Figures & tables

Explore similar work

CardsList
  1. Hard Instances on Demand

    Oct 15, 2026Jamie Fravel, Martin Koutecký, Pavlo TsitseiSynthetic Benchmark Generation

  2. Petri Net Induced Heuristic Search for Resource Constrained Scheduling

    May 15, 2026Ido Lublin, Dor Atzmon, Izack CohenResource-Constrained Project SchedulingCombinatorial Optimization