Effects of update frequencies in a dynamic capacitated arc routing problem

Padungwech, Wasin ORCID: https://orcid.org/0000-0002-4842-5222, Thompson, Jonathan and Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X 2020. Effects of update frequencies in a dynamic capacitated arc routing problem. Networks 76 (4) , pp. 522-538. 10.1002/net.21990

Preview

PDF - Accepted Post-Print Version Download (633kB) | Preview

Abstract

The capacitated arc routing problem (CARP) concerns a minimum‐cost set of routes for vehicles that provide service on edges in a given graph while ensuring that the total demand in each route does not exceed the vehicle's capacity. This paper concerns a dynamic variant of the CARP. In particular, it focuses on a problem in which new tasks appear over time. We find that simply increasing the number of iterations of a tabu search algorithm does not always lead to a better solution for a dynamic CARP. This paper investigates how the solution quality can be affected by changing the frequency of updating solutions. Furthermore, we investigate whether or not such effect varies with a method of integrating new tasks into the solution at each update.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Additional Information:	Published in - Special Issue on Arc Routing Problems and Other Related Topics
Publisher:	Wiley
ISSN:	0028-3045
Date of First Compliant Deposit:	17 September 2020
Date of Acceptance:	13 August 2020
Last Modified:	08 Jan 2025 13:00
URI:	https://orca.cardiff.ac.uk/id/eprint/134895

Citation Data

Cited 12 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item