Metraipolis › archive › dc_0a44976540ef
Adaptive Operator Selection in Bilevel Large Neighborhood Search for Electric Autonomous Dial-a-Ride Problem under Uncertainty — arXiv:2610.04219
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.04219
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:26:04.281Z
- SHA-256 of the archived text
f4773c6ac3fd8985c494aef85a1ffa7f3a58dadbaea128fd9ed03bdc185789cc- Stable URL of this page
https://metraipolis.com/documento/dc_0a44976540ef
How to cite
Adaptive Operator Selection in Bilevel Large Neighborhood Search for Electric Autonomous Dial-a-Ride Problem under Uncertainty — arXiv:2610.04219 — arXiv, https://arxiv.org/abs/2610.04219 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0a44976540ef (Metraipolis archive dc_0a44976540ef, sha256 f4773c6ac3fd8985c494aef85a1ffa7f3a58dadbaea128fd9ed03bdc185789cc)
BibTeX
@misc{dc0a44976540ef,
title = {Adaptive Operator Selection in Bilevel Large Neighborhood Search for Electric Autonomous Dial-a-Ride Problem under Uncertainty — arXiv:2610.04219},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.04219},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0a44976540ef; sha256 f4773c6ac3fd8985c494aef85a1ffa7f3a58dadbaea128fd9ed03bdc185789cc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.04219. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The electric autonomous dial-a-ride problem (EADARP) extends the classical dial-a-ride problem by incorporating battery and charging constraints for electric vehicles. In practice, travel-time uncertainty can cause violations of time-window constraints. Large neighborhood search is effective for solving the EADARP, but its performance can depend on the choice of insertion operator during the repair phase. This paper investigates insertion-operator selection within a bilevel large neighborhood search framework for deterministic and chance-constrained variants of the EADARP. In the chance-constrained variant, arc travel times are modeled as independent normally distributed random variables, and upper time-window constraints are enforced probabilistically. We consider six selection methods, namely fixed greedy insertion, fixed regret-based insertion, random selection, a deterministic state-based rule, performance-adaptive ALNS selection, and LLM-based state-aware selection. Experimental results show comparable performance on smaller instances, while differences become more evident on larger and more constrained instances. There is no single strategy that performs best across all instances, and the relative performance of the LLM-based, rule-based, and ALNS strategies varies with the problem instance and experimental setting. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Neural and Evolutionary Computing (cs.NE) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2610.04219 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T05:24:05.816Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).