Instance-Aware Parameter Configuration in Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem

·ArXiv cs.AI··

arXiv:2605.00572v1 Announce Type: new Abstract: Algorithm performance in combinatorial optimization is highly sensitive to parameter settings, while a single globally tuned configuration often fails to exploit the heterogeneity of instances. This limitation is particularly evident in the Electric Capacitated Vehicle Routing Problem, where instances differ in structure, demand patterns, and energy constraints. This paper investigates instance-aware parameter configuration for Bilevel Late Accepta...

Read full article →

Related Articles

Show HN: Tilde.run – Agent sandbox with a transactional, versioned filesystem
ozkatz · Hacker News · 2d ago
Computer Use is 45x more expensive than structured APIs
palashawas · Hacker News · 3d ago
Bun is being ported from Zig to Rust
SergeAx · Hacker News · 4d ago
Reverse-engineering the 1998 Ultima Online demo server
notsentient · Hacker News · 2d ago
RaTeX: KaTeX-compatible LaTeX rendering engine in pure Rust
atilimcetin · Hacker News · 4d ago