Surrogate-Assisted Genetic Programming with Rank-Based Phenotypic Characterisation for Dynamic Multi-Mode Project Scheduling
Yuan Tian, Yi Mei, Mengjie Zhang

TL;DR
This paper introduces a surrogate-assisted genetic programming method with a novel rank-based phenotypic characterisation scheme to efficiently evolve heuristic rules for dynamic multi-mode project scheduling, reducing computational costs.
Contribution
It proposes a new rank-based phenotypic characterisation scheme and integrates it into a surrogate-assisted GP algorithm for DMRCPSP, improving efficiency and solution quality.
Findings
Faster identification of high-quality heuristics
Reduced computational overhead compared to state-of-the-art
Surrogate model effectively guides offspring selection
Abstract
The dynamic multi-mode resource-constrained project scheduling problem (DMRCPSP) is of practical importance, as it requires making real-time decisions under changing project states and resource availability. Genetic Programming (GP) has been shown to effectively evolve heuristic rules for such decision-making tasks; however, the evolutionary process typically relies on a large number of simulation-based fitness evaluations, resulting in high computational cost. Surrogate models offer a promising solution to reduce evaluation cost, but their application to GP requires problem-specific phenotypic characterisation (PC) schemes of heuristic rules. There is currently a lack of suitable PC schemes for GP applied to DMRCPSP. This paper proposes a rank-based PC scheme derived from heuristic-driven ordering of eligible activity-mode pairs and activity groups in decision situations. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsResource-Constrained Project Scheduling · Advanced Multi-Objective Optimization Algorithms · Scheduling and Timetabling Solutions
