@article {pub5390pub5520,
	title = {Building Blocks as Experiences in Dynamic Capacitated Arc Routing Problems },
	author = {Hao Tong AND Leandro L. Minku AND Stefan Menzel AND Bernhard Sendhoff AND Xin Yao},
	year = {2026},
	month = {February},
	abstract = {The Dynamic Capacitated Arc Routing Problem (DCARP) aims to update the service paths of vehicles in the capacitated arc routing problem when uncertain factors deteriorate the current schedule of vehicles{\textquoteright} services. For example, a road may become congested or inaccessible due to a traffic accident, or new tasks may need to be served. A DCARP scenario comprises a series of DCARP instances that share similarities with each other. Therefore, optimization experience gained from solving the former DCARP instance can potentially promote the dynamic optimization for a new DCARP instance in a DCARP scenario. However, existing optimization algorithms for solving DCARP scenarios seldom consider such optimization experience and instead re-optimize the DCARP instance from scratch. This paper proposes a dynamic optimization framework with a solution building block adaptation strategy (DO-SBBA) that extracts the optimization experience from the former optimization process to promote the dynamic optimization for DCARP. The framework introduces the concept of building blocks for extracting the valuable experience contained in historical solutions. The building block-based constructive heuristic is proposed to handle DCARP scenarios with cost- or task-changing dynamic events, and an insertion heuristic is proposed to handle task-changing dynamic events. Experimental studies demonstrate the effectiveness of DO-SBBA for extracting and utilizing optimization experience in DCARP scenarios, significantly improving the performance of dynamic optimization compared to state-of-the-art DCARP methods. },
	publisher = {John Wiley \& Sons Ltd},
	journal = {CAAI Transactions on Intelligence Technology}
}