A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems

TL;DR

This paper introduces a flexible meta-heuristic framework for dynamic capacitated arc routing problems, leveraging existing static algorithms to adapt to real-time changes and improve solution quality.

Contribution

It presents a novel, adaptable framework that utilizes static CARP algorithms for dynamic scenarios, addressing limitations of previous methods and enhancing real-time routing solutions.

Findings

Framework significantly outperforms existing dynamic algorithms

Effective in handling various dynamic events in routing

Improves solution feasibility and efficiency

Abstract

The capacitated arc routing problem (CARP) is a challenging combinatorial optimisation problem abstracted from many real-world applications, such as waste collection, road gritting and mail delivery. However, few studies considered dynamic changes during the vehicles' service, which can cause the original schedule infeasible or obsolete. The few existing studies are limited by the dynamic scenarios considered, and by overly complicated algorithms that are unable to benefit from the wealth of contributions provided by the existing CARP literature. In this paper, we first provide a mathematical formulation of dynamic CARP (DCARP) and design a simulation system that is able to consider dynamic events while a routing solution is already partially executed. We then propose a novel framework which can benefit from existing static CARP optimisation algorithms so that they could be used to handle DCARP instances. The framework is very flexible. In response to a dynamic event, it can use either a simple restart strategy or a sequence transfer strategy that benefits from past optimisation experience. Empirical studies have been conducted on a wide range of DCARP instances to evaluate our proposed framework. The results show that the proposed framework significantly improves over state-of-the-art dynamic optimisation algorithms.