2 papers
cs.NE2025
Knowledge-Guided Memetic Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs
Qingya Li, Shengcai Liu, Wenjie Chen +3
The capacitated arc routing problem with time-dependent service costs (CARPTDSC) is a challenging combinatorial optimization problem that arises from winter gritting applications.…
math.OC2024
A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs
Qingya Li, Shengcai Liu, Juan Zou +1
This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current l…