arXiv: cs.AI preprintsInternational11 November 2026
Tailoring Optimization Approaches with Domain Knowledge in Industry Process for Meta-heuristic Development
This is an official announcement record
Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2611.13940v1 Announce Type: cross 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
Read the official announcement
Opens arxiv.org
More from arXiv: cs.AI preprints
- Auditable Human-Agent Teams for Autonomous X-ray Experimentation11 November 2026
- EarthRecord: From Pixels to Land Change with Multimodal Agents over Four Decades of Satellite Imagery11 November 2026
- Train on prefill, monitor at decode: Using sparse autoencoders for topic monitoring11 November 2026
- LandslideFM: A Foundation Model Towards Unified Landslide Perception and Understanding11 November 2026
- Tracing Psychometric Inference in Large Language Models11 November 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.