Knowledge-Guided Memetic Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs
cs.NE
Submitted: 2025-07-29
Updated: 2026-11-03
Comments: Accepted for publication in IEEE Transactions on Emerging Topics in Computational Intelligence. Updated to the accepted version with the IEEE copyright notice
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Hybrid Memetic Search for Electric Vehicle Routing with Time Windows, Simultaneous Pickup-Delivery, and Partial Recharges
- A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs
Related papers
- Evolutionary Ensemble of Agents
- EvoDR: Evolving Dispatching Rules via Large Language Model for Dynamic Flexible Assembly Flow Shop Scheduling
- RECAP: Local Hebbian Prototype Learning as a Self-Organizing Readout for Reservoir Dynamics
- Encoding and Decoding Temporal Signals with Spiking Bandpass Wavelets
- Design and Analysis of Temporal Representations in Neural Networks
- Evolutionary Computation: A Paradigm of Natural Generative AI and Creative Synthesis